The ArrayAdjacencyGraph<TVertex, TEdge>
, also known as
provides an efficient
data 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.