The ArrayAdjacencyGraph<TVertex, TEdge>, also known as adjacency list provides an efficient readonlydata structure to access the out edges of a vertex. This class is serializable, cloneable and can be constructed in many different ways. Internally, the data structure keeps a dictionary from TVertex to an unordered array of TEdge elements.

See also AdjacencyGraph.

Last edited Nov 7, 2010 at 12:16 PM by pelikhan, version 1


No comments yet.