DFS (Graphoscope)

Graphoscope

Documentation for 0.5.1-preview.1

DFS Type

Namespace: Graphoscope.Algorithms
Assembly: Graphoscope.dll
Base Type: obj

Depth-First Traversal (or Search)

Constructors

Constructor	Description
`DFS()` Full Usage: `DFS()` Returns: `DFS`	Returns: `DFS`

Static members

Static member	Description
`DFS.ofDiGraph starting graph` Full Usage: `DFS.ofDiGraph starting graph` Parameters: starting : `'NodeKey` graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `seq<'NodeKey * 'NodeData>`	Traverses nodes reachable from given node in a Depth-First Traversal (or Search) Nodekey for starting the BFS traversal. The graph to traverse. Sequence of node key and node data starting : `'NodeKey` graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `seq<'NodeKey * 'NodeData>`
`DFS.ofDiGraphUndirected starting graph` Full Usage: `DFS.ofDiGraphUndirected starting graph` Parameters: starting : `'NodeKey` graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `seq<'NodeKey * 'NodeData>`	Same as ofDiGraph except it traverses nodes along in and out edges. This is useful for finding components and other operations where the direction of the edge shouldnt matter. Nodekey for starting the BFS traversal. The graph to traverse. Sequence of node key and node data starting : `'NodeKey` graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `seq<'NodeKey * 'NodeData>`
`DFS.ofFGraph starting graph` Full Usage: `DFS.ofFGraph starting graph` Parameters: starting : `'NodeKey` - Nodekey for starting the BFS traversal. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to traverse. Returns: `seq<'NodeKey * 'NodeData>` Sequence of node key and node data	Traverses nodes reachable from given node in a Depth-First Traversal (or Search) starting : `'NodeKey` Nodekey for starting the BFS traversal. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to traverse. Returns: `seq<'NodeKey * 'NodeData>` Sequence of node key and node data