OutDegree (Graphoscope)

Graphoscope

Documentation for 0.5.1-preview.1

OutDegree Type

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

Constructors

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

Static members

Static member	Description
`OutDegree.average graph` Full Usage: `OutDegree.average graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean out-degree	Get the mean out-degree of the graph. This is an undirected measure so inbound links add to a nodes out-degree. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean out-degree
`OutDegree.average graph` Full Usage: `OutDegree.average graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean out-degree	Get the mean out-degree of the graph. This is an undirected measure so inbound links add to a nodes out-degree. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean out-degree
`OutDegree.average graph` Full Usage: `OutDegree.average graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean out-degree	Get the mean out-degree of the graph. This is an undirected measure so inbound links add to a nodes out-degree. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean out-degree
`OutDegree.averageofAdjGraph graph` Full Usage: `OutDegree.averageofAdjGraph graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean out-degree	Get the mean out-degree of the graph. This is an undirected measure so inbound links add to a nodes out-degree. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean out-degree
`OutDegree.averageofDiGraph graph` Full Usage: `OutDegree.averageofDiGraph graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean out-degree	Get the mean out-degree of the graph. This is an undirected measure so inbound links add to a nodes out-degree. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean out-degree
`OutDegree.averageofFGraph graph` Full Usage: `OutDegree.averageofFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean out-degree	Get the mean out-degree of the graph. This is an undirected measure so inbound links add to a nodes out-degree. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean out-degree
`OutDegree.maximum graph` Full Usage: `OutDegree.maximum graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max out-degree	Get the max out-degree of the graph. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max out-degree
`OutDegree.maximum graph` Full Usage: `OutDegree.maximum graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max out-degree	Get the max out-degree of the graph. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max out-degree
`OutDegree.maximum graph` Full Usage: `OutDegree.maximum graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max out-degree	Get the max out-degree of the graph. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max out-degree
`OutDegree.maximumOfAdjGraph graph` Full Usage: `OutDegree.maximumOfAdjGraph graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max out-degree	Get the max out-degree of the graph. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max out-degree
`OutDegree.maximumOfDiGraph graph` Full Usage: `OutDegree.maximumOfDiGraph graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max out-degree	Get the max out-degree of the graph. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max out-degree
`OutDegree.maximumOfFGraph graph` Full Usage: `OutDegree.maximumOfFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max out-degree	Get the max out-degree of the graph. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max out-degree
`OutDegree.minimum graph` Full Usage: `OutDegree.minimum graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min out-degree	Get the min out-degree of the graph. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min out-degree
`OutDegree.minimum graph` Full Usage: `OutDegree.minimum graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min out-degree	Get the min out-degree of the graph. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min out-degree
`OutDegree.minimum graph` Full Usage: `OutDegree.minimum graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min out-degree	Get the min out-degree of the graph. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min out-degree
`OutDegree.minimumOfAdjGraph graph` Full Usage: `OutDegree.minimumOfAdjGraph graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max out-degree	Get the min out-degree of the graph. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max out-degree
`OutDegree.minimumOfDiGraph graph` Full Usage: `OutDegree.minimumOfDiGraph graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min out-degree	Get the min out-degree of the graph. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min out-degree
`OutDegree.minimumOfFGraph graph` Full Usage: `OutDegree.minimumOfFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min out-degree	Get the min out-degree of the graph. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min out-degree
`OutDegree.sequence graph` Full Usage: `OutDegree.sequence graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int[]` An array of out-degree values in descending order	Returns the out-degree sequence of the graph graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int[]` An array of out-degree values in descending order
`OutDegree.sequence graph` Full Usage: `OutDegree.sequence graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `seq<float>` A float seq of out-degree values	Returns the out-degree sequence of the graph graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `seq<float>` A float seq of out-degree values
`OutDegree.sequence graph` Full Usage: `OutDegree.sequence graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `seq<float>` A float seq of out-degree values	Returns the out-degree sequence of the graph graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `seq<float>` A float seq of out-degree values
`OutDegree.sequenceOfAdjGraph graph` Full Usage: `OutDegree.sequenceOfAdjGraph graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `seq<float>` A float seq of out-degree values	graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `seq<float>` A float seq of out-degree values
`OutDegree.sequenceOfDiGraph graph` Full Usage: `OutDegree.sequenceOfDiGraph graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int[]` An array of out-degree values in descending order	Returns the out-degree sequence of the graph graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int[]` An array of out-degree values in descending order
`OutDegree.sequenceOfFGraph graph` Full Usage: `OutDegree.sequenceOfFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `seq<float>` A float seq of out-degree values	graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `seq<float>` A float seq of out-degree values