Skip to content

ArrayBidirectionalGraph

Alexandre Rabérin edited this page May 11, 2020 · 1 revision

ArrayBidirectionalGraph

The ArrayBidirectionalGraph<TVertex, TEdge> provides an efficient readonly data structure to access the out-edges and the in-edges of a vertex of sparse directed graphs.

This class is serializable, cloneable and can be constructed in many different ways. Internally, the data structure keeps a dictionary from TVertex to a unordered array of TEdge elements.

See also BidirectionalGraph.

Clone this wiki locally