You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We can now get a graph with edges reversed easily, the use case is as follows
User constructs a regular graph
User creates a reverse copy of the graph
User can now traverse both graphs manually
This is a great step forward; ideally we'd have a proper undirected graph abstraction where the user has a single object at hand and does not have to know about a forward and backward graph, which makes combined traversal hard and quite a manual process. That's why I'm leaving this ticket open.
We should provide an undirected graph abstraction. At the moment the csr graph is directed.
For use what we have and turn it into an undirected graph, we'll need
then we can a forward and a reverse graph.
Or better: have one directed graph and for all (s,t) also store (t, s). Then have bitsets for what is a forward/reverse edge.
The text was updated successfully, but these errors were encountered: