BFS (Graphoscope)

Graphoscope

Documentation for 0.5.1-preview.1

BFS Type

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

Breadth-First Traversal (or Search)

Constructors

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

Static members

Static member	Description
`BFS.Compute(starting, graph)` Full Usage: `BFS.Compute(starting, graph)` Parameters: starting : `'NodeKey` - Nodekey for starting the BFS traversal. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to traverse. Returns: `'a` Sequence of node key and node data	Traverses nodes reachable from given node in a Breadth-First Traversal (or Search) starting : `'NodeKey` Nodekey for starting the BFS traversal. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to traverse. Returns: `'a` Sequence of node key and node data
`BFS.Compute(starting, graph)` Full Usage: `BFS.Compute(starting, graph)` Parameters: starting : `'NodeKey` - Nodekey for starting the BFS traversal. graph : `AdjGraph<'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 Breadth-First Traversal (or Search) starting : `'NodeKey` Nodekey for starting the BFS traversal. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to traverse. Returns: `seq<'NodeKey * 'NodeData>` Sequence of node key and node data
`BFS.Compute(starting, graph)` Full Usage: `BFS.Compute(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 Breadth-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
`BFS.ofAdjGraph starting graph` Full Usage: `BFS.ofAdjGraph starting graph` Parameters: starting : `'NodeKey` - Nodekey for starting the BFS traversal. graph : `AdjGraph<'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 Breadth-First Traversal (or Search) starting : `'NodeKey` Nodekey for starting the BFS traversal. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to traverse. Returns: `seq<'NodeKey * 'NodeData>` Sequence of node key and node data
`BFS.ofFGraph starting graph` Full Usage: `BFS.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 Breadth-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