BidirectionalMatrixGraph

The BidirectionalMatrixGraph<TVertex, TEdge> provides an efficient data structure to access the out edges and the in edges of a vertex of dense directed graphs with known number of vertices. This class is mutable, serializable, cloneable and can be constructed in many different ways. Internally, the data structure keeps a 2D fixed size array of edges. Does not support multi-edges.

intvertexCount= ...;// must be known a-priorivargraph=newBidirectionalMatrixGraph<int,Edge<int>>(vertexCount);
...foreach(varvertexingraph.Vertices)foreach(varedgeingraph.InEdges(vertex))Console.WriteLine(edge);

For sparse graphs, consider using AdjacencyGraph or BidirectionalGraph.