Closed buddha314 closed 3 years ago
I'm not sure if I want to create a concrete LineGraph
data structure, would a matrix be good enough? I'm assuming a A: |E| x |E| matrix, with A[i,j] containing the degree of connectivity between the hyperedge i and j?
Yeah, I think the matrix would be good enough with the parameters you mentioned. Maybe the method could include .getLineGraphAdjacencyMatrix
or something else that indicates the line graph. Not sure... .getLineGraph()
might return a graph then .getLineGraph().adjacencyMatrix()
gets the matrix? I don't know what convention you are following so I'll leave that up to you.
This issue is stale and should either be closed or eventually resolved.
The line graph in a hypergraph connects hyperedges that have vertices in common. It would be useful to find adjacent edges and the degree of connectivity.