QuickGraph


FilteredUndirectedGraph<'TVertex, 'TEdge, 'TGraph>

Namespace: QuickGraph.Predicates

Constructors

ConstructorDescription
new(...)
Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit

Instance members

Instance memberDescription
AdjacentDegree(v)
Signature: v:'TVertex -> int
Modifiers: abstract
AdjacentEdge(v, index)
Signature: (v:'TVertex * index:int) -> 'TEdge
Modifiers: abstract
AdjacentEdges(v)
Signature: v:'TVertex -> IEnumerable<'TEdge>
Modifiers: abstract
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
EdgeEqualityComparer
Signature: EdgeEqualityComparer<'TVertex,'TEdge>
Modifiers: abstract
Edges
Signature: IEnumerable<'TEdge>
Modifiers: abstract
IsAdjacentEdgesEmpty(v)
Signature: v:'TVertex -> bool
Modifiers: abstract
IsEdgesEmpty
Signature: bool
Modifiers: abstract
IsVerticesEmpty
Signature: bool
Modifiers: abstract
TryGetEdge(source, target, edge)
Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
Modifiers: abstract
VertexCount
Signature: int
Modifiers: abstract
Vertices
Signature: IEnumerable<'TVertex>
Modifiers: abstract
Fork me on GitHub