An edge-list representation of a graph is simply a sequence of edges,
where each edge is represented as a pair of vertex ID's.
Namespace:
QuickGraph.RepresentationsAssembly: QuickGraph.Algorithms (in QuickGraph.Algorithms.dll) Version: 2.4.2.1515 (2.4.2.1515)
Syntax
| C# |
|---|
public class EdgeList : IEdgeListGraph, IGraph |
| Visual Basic (Declaration) |
|---|
Public Class EdgeList _ Implements IEdgeListGraph, IGraph |
Remarks
The EdgeList class is an adaptor that turns an edge collection into a class that models IEdgeListGraph. The value type of the edge collection must be be inherited form IEdge.
An edge-list representation of a graph is simply a sequence of edges, where each edge is represented as a pair of vertex ID's. The memory required is only O(E). Edge insertion is typically O(1), though accessing a particular edge is O(E) (not efficient).
