Volume (Graphoscope)

Graphoscope

Documentation for 0.5.1-preview.1

Volume Type

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

Constructors

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

Static members

Static member	Description
`Volume.compute graph` Full Usage: `Volume.compute graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` A float of the total edges	Gets the total number of edges of the graph graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` A float of the total edges
`Volume.compute graph` Full Usage: `Volume.compute graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` A float of the total edges	Gets the total number of edges of the graph graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` A float of the total edges
`Volume.compute graph` Full Usage: `Volume.compute graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` A float of the total edges	Gets the total number of edges of the graph graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` A float of the total edges
`Volume.compute graph` Full Usage: `Volume.compute graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` A float of the total edges	Gets the total number of edges of the graph graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` A float of the total edges
`Volume.volumeOfAdjGraph graph` Full Usage: `Volume.volumeOfAdjGraph graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` A float of the total edges	Gets the total number of edges of the graph graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` A float of the total edges
`Volume.volumeOfDiGraph graph` Full Usage: `Volume.volumeOfDiGraph graph` Parameters: graph : `DiGraph<'NodeKey, 'a, 'EdgeData>` - The graph to be analysed Returns: `int` A float of the total edges	Gets the total number of edges of the graph graph : `DiGraph<'NodeKey, 'a, 'EdgeData>` The graph to be analysed Returns: `int` A float of the total edges
`Volume.volumeOfFGraph graph` Full Usage: `Volume.volumeOfFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` A float of the total edges	Gets the total number of edges of the graph graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` A float of the total edges
`Volume.volumeOfUndirected graph` Full Usage: `Volume.volumeOfUndirected graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` A float of the total edges	Gets the total number of edges of the graph graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` A float of the total edges