Skip to content

ArrayAdjacencyGraph

Jump to bottom
Mark Junker edited this page Jun 7, 2018 · 2 revisions

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|Creating Graphs][. Internally, the data structure keeps a dictionary from TVertex to an unordered array of TEdge elements.

See also AdjacencyGraph.

Clone this wiki locally