ArrayAdjacencyGraph<'TVertex, 'TEdge>
Namespace: QuickGraph
An immutable directed graph data structure efficient for large sparse graph representation where out-edge need to be enumerated only.
Constructors
| Constructor | Description |
new(visitedGraph)
Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
|
Instance members
| Instance member | Description |
AllowParallelEdges
Signature: bool
Modifiers: abstract |
|
Clone()
Signature: unit -> ArrayAdjacencyGraph<'TVertex,'TEdge>
|
Returns self since this class is immutable |
ContainsEdge(source, target)
Signature: (source:'TVertex * target:'TVertex) -> bool
Modifiers: abstract |
|
ContainsEdge(edge)
Signature: edge:'TEdge -> bool
Modifiers: abstract |
|
ContainsVertex(vertex)
Signature: vertex:'TVertex -> bool
Modifiers: abstract |
|
EdgeCount
Signature: int
Modifiers: abstract |
|
Edges
Signature: IEnumerable<'TEdge>
Modifiers: abstract |
|
IsDirected
Signature: bool
Modifiers: abstract |
|
IsEdgesEmpty
Signature: bool
Modifiers: abstract |
|
IsOutEdgesEmpty(v)
Signature: v:'TVertex -> bool
Modifiers: abstract |
|
IsVerticesEmpty
Signature: bool
Modifiers: abstract |
|
OutDegree(v)
Signature: v:'TVertex -> int
Modifiers: abstract |
|
OutEdge(v, index)
Signature: (v:'TVertex * index:int) -> 'TEdge
Modifiers: abstract |
|
OutEdges(v)
Signature: v:'TVertex -> IEnumerable<'TEdge>
Modifiers: abstract |
|
TryGetEdge(source, target, edge)
Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
Modifiers: abstract |
|
TryGetEdges(source, target, edges)
Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
Modifiers: abstract |
|
TryGetOutEdges(v, edges)
Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
Modifiers: abstract |
|
VertexCount
Signature: int
Modifiers: abstract |
|
Vertices
Signature: IEnumerable<'TVertex>
Modifiers: abstract |
