InDegree (Graphoscope)

Graphoscope

Documentation for 0.5.1-preview.1

InDegree Type

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

Constructors

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

Static members

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