GraphExtensions

Namespace: QuickGraph

Extension methods for populating graph datastructures

Static members

Static member	Description
`ToAdjacencyGraph(edges)` Signature: (edges:'TVertex [] []) -> AdjacencyGraph<'TVertex,SEquatableEdge<'TVertex>> Type parameters: 'TVertex	Converts a jagged array of sources and targets into a graph
`ToAdjacencyGraph(...)` Signature: (edges:IEnumerable<'TEdge> * allowParallelEdges:bool) -> AdjacencyGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a set of edges into an adjacency graph.
`ToAdjacencyGraph(edges)` Signature: edges:IEnumerable<'TEdge> -> AdjacencyGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a set of edges into an adjacency graph.
`ToAdjacencyGraph(...)` Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> AdjacencyGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a set of vertices into an adjacency graph, using an edge factory.
`ToAdjacencyGraph(...)` Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>>) -> AdjacencyGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a set of vertices into an adjacency graph, using an edge factory.
`ToAdjacencyGraph(vertexPairs)` Signature: vertexPairs:IEnumerable<SEquatableEdge<'TVertex>> -> AdjacencyGraph<'TVertex,SEquatableEdge<'TVertex>> Type parameters: 'TVertex	Converts a sequence of vertex pairs into an adjancency graph
`ToArrayAdjacencyGraph(graph)` Signature: graph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> ArrayAdjacencyGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an immutable array adjacency graph from the input graph
`ToArrayBidirectionalGraph(graph)` Signature: graph:IBidirectionalGraph<'TVertex,'TEdge> -> ArrayBidirectionalGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an immutable array bidirectional graph from the input graph
`ToArrayUndirectedGraph(graph)` Signature: graph:IUndirectedGraph<'TVertex,'TEdge> -> ArrayUndirectedGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an immutable array undirected graph from the input graph
`ToBidirectionalGraph(graph)` Signature: graph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> IBidirectionalGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Wraps a adjacency graph (out-edge only) into a bidirectional graph.
`ToBidirectionalGraph(...)` Signature: (edges:IEnumerable<'TEdge> * allowParallelEdges:bool) -> BidirectionalGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a set of edges into a bidirectional graph.
`ToBidirectionalGraph(edges)` Signature: edges:IEnumerable<'TEdge> -> BidirectionalGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a set of edges into a bidirectional graph.
`ToBidirectionalGraph(...)` Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> BidirectionalGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a set of vertices into a bidirectional graph, using an edge factory.
`ToBidirectionalGraph(...)` Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>>) -> BidirectionalGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a set of vertices into a bidirectional graph, using an edge factory
`ToBidirectionalGraph(vertexPairs)` Signature: vertexPairs:IEnumerable<SEquatableEdge<'TVertex>> -> BidirectionalGraph<'TVertex,SEquatableEdge<'TVertex>> Type parameters: 'TVertex	Converts a sequence of vertex pairs into an bidirectional graph
`ToCompressedRowGraph(visitedGraph)` Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> CompressedSparseRowGraph<'TVertex> Type parameters: 'TVertex, 'TEdge	Creates an immutable compressed row graph representation of the visited graph
`ToDelegateBidirectionalIncidenceGraph(...)` Signature: (tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> * tryGetInEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> DelegateBidirectionalIncidenceGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an instance of DelegateIncidenceGraph.
`ToDelegateIncidenceGraph(tryGetOutEdges)` Signature: tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> -> DelegateIncidenceGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an instance of DelegateIncidenceGraph.
`ToDelegateIncidenceGraph(getOutEdges)` Signature: getOutEdges:Func<'TVertex,IEnumerable<'TEdge>> -> DelegateIncidenceGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an instance of DelegateIncidenceGraph.
`ToDelegateUndirectedGraph(dictionary)` Signature: dictionary:IDictionary<'TVertex,'TValue> -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge, 'TValue	Wraps a dictionary into an undirected list graph
`ToDelegateUndirectedGraph(...)` Signature: (dictionary:IDictionary<'TVertex,'TValue> * keyValueToOutEdges:Converter<KeyValuePair<'TVertex,'TValue>,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge, 'TValue	Wraps a dictionary into an undirected graph
`ToDelegateUndirectedGraph(...)` Signature: (vertices:IEnumerable<'TVertex> * tryGetAdjacentEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> DelegateUndirectedGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an instance of DelegateIncidenceGraph.
`ToDelegateUndirectedGraph(...)` Signature: (vertices:IEnumerable<'TVertex> * getAdjacentEdges:Func<'TVertex,IEnumerable<'TEdge>>) -> DelegateUndirectedGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an instance of DelegateIncidenceGraph.
`ToDelegateVertexAndEdgeListGraph(...)` Signature: (vertices:IEnumerable<'TVertex> * tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an instance of DelegateIncidenceGraph.
`ToDelegateVertexAndEdgeListGraph(...)` Signature: (vertices:IEnumerable<'TVertex> * getOutEdges:Func<'TVertex,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Creates an instance of DelegateIncidenceGraph.
`ToTryFunc(func)` Signature: func:Func<'T,'TResult> -> TryFunc<'T,'TResult> Type parameters: 'T, 'TResult	Converts a Func that returns a reference type into a tryfunc
`ToUndirectedGraph(edges)` Signature: edges:IEnumerable<'TEdge> -> UndirectedGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a sequence of edges into an undirected graph
`ToUndirectedGraph(...)` Signature: (edges:IEnumerable<'TEdge> * allowParralelEdges:bool) -> UndirectedGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge	Converts a sequence of edges into an undirected graph
`ToUndirectedGraph(vertexPairs)` Signature: vertexPairs:IEnumerable<SEquatableEdge<'TVertex>> -> UndirectedGraph<'TVertex,SEquatableEdge<'TVertex>> Type parameters: 'TVertex	Converts a sequence of vertex pairs into an bidirectional graph
`ToVertexAndEdgeListGraph(dictionary)` Signature: dictionary:IDictionary<'TVertex,'TValue> -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge, 'TValue	Wraps a dictionary into a vertex and edge list graph
`ToVertexAndEdgeListGraph(...)` Signature: (dictionary:IDictionary<'TVertex,'TValue> * keyValueToOutEdges:Converter<KeyValuePair<'TVertex,'TValue>,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge> Type parameters: 'TVertex, 'TEdge, 'TValue	Wraps a dictionary into a vertex and edge list graph