EdgeExtensions

Namespace: QuickGraph

Static members

Static member	Description
`GetOtherVertex(edge, vertex)` Signature: (edge:'TEdge * vertex:'TVertex) -> 'TVertex Type parameters: 'TVertex, 'TEdge	Given a source vertex, returns the other vertex in the edge
`GetUndirectedVertexEquality()` Signature: unit -> EdgeEqualityComparer<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Returns the most efficient comporer for the particular type of TEdge. If TEdge implements IUndirectedEdge, then only the (source,target) pair has to be compared; if not, (source, target) and (target, source) have to be compared.
`HasCycles(path)` Signature: path:IEnumerable<'TEdge> -> bool Type parameters: 'TVertex, 'TEdge
`IsAdjacent(edge, vertex)` Signature: (edge:'TEdge * vertex:'TVertex) -> bool Type parameters: 'TVertex, 'TEdge	Gets a value indicating if is adjacent to (is the source or target).
`IsPath(path)` Signature: path:IEnumerable<'TEdge> -> bool Type parameters: 'TVertex, 'TEdge
`IsPathWithoutCycles(path)` Signature: path:IEnumerable<'TEdge> -> bool Type parameters: 'TVertex, 'TEdge
`IsPredecessor(...)` Signature: (predecessors:IDictionary<'TVertex,'TEdge> * root:'TVertex * vertex:'TVertex) -> bool Type parameters: 'TVertex, 'TEdge	Checks that is a predecessor of
`IsSelfEdge(edge)` Signature: edge:'TEdge -> bool Type parameters: 'TVertex, 'TEdge	Gets a value indicating if the edge is a self edge.
`ReverseEdges(edges)` Signature: edges:IEnumerable<'TEdge> -> IEnumerable<SReversedEdge<'TVertex,'TEdge>> Type parameters: 'TVertex, 'TEdge	Returns a reversed edge enumeration
`SortedVertexEquality(...)` Signature: (edge:'TEdge * source:'TVertex * target:'TVertex) -> bool Type parameters: 'TVertex, 'TEdge	Gets a value indicating if the vertices of edge match (source, target)
`ToVertexPair(edge)` Signature: edge:'TEdge -> SEquatableEdge<'TVertex> Type parameters: 'TVertex, 'TEdge	Creates a vertex pair (source, target) from the edge
`TryGetPath(predecessors, v, result)` Signature: (predecessors:IDictionary<'TVertex,'TEdge> * v:'TVertex * result:byref<IEnumerable<'TEdge>>) -> bool Type parameters: 'TVertex, 'TEdge	Tries to get the predecessor path, if reachable.
`UndirectedVertexEquality(...)` Signature: (edge:'TEdge * source:'TVertex * target:'TVertex) -> bool Type parameters: 'TVertex, 'TEdge	Gets a value indicating if the vertices of edge match (source, target) or (target, source)