Components (Graphoscope)

Graphoscope

Documentation for 0.5.1-preview.1

Components Type

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

Constructors

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

Static members

Static member	Description
`Components.compute graph` Full Usage: `Components.compute graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `seq<AdjGraph<'NodeKey, 'NodeData, 'EdgeData>>`	graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `seq<AdjGraph<'NodeKey, 'NodeData, 'EdgeData>>`
`Components.getComponentOfAdjGraphNode graph nodeID` Full Usage: `Components.getComponentOfAdjGraphNode graph nodeID` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` nodeID : `'NodeKey` Returns: `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>`	graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` nodeID : `'NodeKey` Returns: `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>`
`Components.getGraphComponentsOfAdjGraph graph` Full Usage: `Components.getGraphComponentsOfAdjGraph graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `seq<AdjGraph<'NodeKey, 'NodeData, 'EdgeData>>`	graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `seq<AdjGraph<'NodeKey, 'NodeData, 'EdgeData>>`
`Components.getLargestWeakComponentOfDiGraph g` Full Usage: `Components.getLargestWeakComponentOfDiGraph g` Parameters: g : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` returns a new graph	Finds the largest weakly connected component and returns it as a new graph g : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` returns a new graph
`Components.getLargestWeakComponentSizeOfDiGraph g` Full Usage: `Components.getLargestWeakComponentSizeOfDiGraph g` Parameters: g : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `int` returns an int indicating numner of nodes	Finds the largest weakly connected component and returns it's size. g : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `int` returns an int indicating numner of nodes
`Components.getWeakComponentsOfDiGraph g` Full Usage: `Components.getWeakComponentsOfDiGraph g` Parameters: g : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `Set<Set<'NodeKey * 'NodeData>>` returns set of sets of nodes making up each component.	Finds seperate weakly connected components of the graph and returns sets of nodes g : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `Set<Set<'NodeKey * 'NodeData>>` returns set of sets of nodes making up each component.
`Components.isWeakComponentOfDiGraph g` Full Usage: `Components.isWeakComponentOfDiGraph g` Parameters: g : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `bool`	DiGraph Returns true if all nodes in the graph are weakly connected into one component. The graph to analyse Returns true or false g : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` Returns: `bool`