What are the differences between Graph Types?

Topics: graph
Oct 5, 2007 at 8:50 PM
I am trying to figure out when you would use any of the different types of Graph and am not getting very far because of a lack of information about each type. Can you give a break down of what are the major differences between Graph classes.

Thanks
Oct 6, 2007 at 12:17 AM
You can open a workitem on this.

In a nutshell,

  • AdjancecyGraph is a map {vertex -> out edges}
  • BidirectionalGraph is a double map {vertex-> out edges, vertex->in edges} (x 2 memory footprint)
  • BidirectionalMatricGraph stores the edges in an array. Good for dense graph with fixed known number of vertices.