Degree (Graphoscope)

Graphoscope

Documentation for 0.5.1-preview.1

Degree Type

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

Constructors

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

Static members

Static member	Description
`Degree.average graph` Full Usage: `Degree.average graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean degree	Get the mean degree of the graph. This is an undirected measure so inbound links add to a nodes degree. graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean degree
`Degree.average graph` Full Usage: `Degree.average graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean degree	Get the mean degree of the graph. This is an undirected measure so inbound links add to a nodes degree. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean degree
`Degree.average graph` Full Usage: `Degree.average graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean degree	Get the mean degree of the graph. This is an undirected measure so inbound links add to a nodes degree. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean degree
`Degree.average graph` Full Usage: `Degree.average graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean degree	Get the mean degree of the graph. This is an undirected measure so inbound links add to a nodes degree. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean degree
`Degree.averageofAdjGraph graph` Full Usage: `Degree.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 degree of the graph. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean out-degree
`Degree.averageofDiGraph graph` Full Usage: `Degree.averageofDiGraph graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean degree	Get the mean degree of the graph. This is an undirected measure so inbound links add to a nodes degree. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean degree
`Degree.averageofFGraph graph` Full Usage: `Degree.averageofFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean degree	Get the mean degree of the graph. This is an undirected measure so inbound links add to a nodes degree. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean degree
`Degree.averageofUndirected graph` Full Usage: `Degree.averageofUndirected graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the mean degree	Get the mean degree of the graph. graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the mean degree
`Degree.cumulativeDegreeOfFGraph graph` Full Usage: `Degree.cumulativeDegreeOfFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `seq<float * int>` A float of the weighted degree of a node	Return the cummulative Degree of a FGraph sorted from smallest degree to highest as tupel of degree and Nodecount with that degree. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `seq<float * int>` A float of the weighted degree of a node
`Degree.maximum graph` Full Usage: `Degree.maximum graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max degree	Get the max degree of the graph. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max degree
`Degree.maximum graph` Full Usage: `Degree.maximum graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max degree	Get the max degree of the graph. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max degree
`Degree.maximum graph` Full Usage: `Degree.maximum graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max degree	Get the max degree of the graph. graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max degree
`Degree.maximum graph` Full Usage: `Degree.maximum graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max degree	Get the max degree of the graph. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max degree
`Degree.maximumOfAdjGraph graph` Full Usage: `Degree.maximumOfAdjGraph graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max degree	Get the max degree of the graph. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max degree
`Degree.maximumOfDiGraph graph` Full Usage: `Degree.maximumOfDiGraph graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max degree	Get the max degree of the graph. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max degree
`Degree.maximumOfFGraph graph` Full Usage: `Degree.maximumOfFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max degree	Get the max degree of the graph. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max degree
`Degree.maximumOfUndirected graph` Full Usage: `Degree.maximumOfUndirected graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the max degree	Get the max degree of the graph. graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the max degree
`Degree.minimum graph` Full Usage: `Degree.minimum graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min degree	Get the min degree of the graph. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min degree
`Degree.minimum graph` Full Usage: `Degree.minimum graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min degree	Get the min degree of the graph. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min degree
`Degree.minimum graph` Full Usage: `Degree.minimum graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min degree	Get the min degree of the graph. graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min degree
`Degree.minimum graph` Full Usage: `Degree.minimum graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min degree	Get the min degree of the graph. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min degree
`Degree.minimumOfAdjGraph graph` Full Usage: `Degree.minimumOfAdjGraph graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min degree	Get the min degree of the graph. graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min degree
`Degree.minimumOfDiGraph graph` Full Usage: `Degree.minimumOfDiGraph graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min degree	Get the min degree of the graph. graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min degree
`Degree.minimumOfFGraph graph` Full Usage: `Degree.minimumOfFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min degree	Get the min degree of the graph. graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min degree
`Degree.minimumOfUndirected graph` Full Usage: `Degree.minimumOfUndirected graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int` An int of the min degree	Get the min degree of the graph. graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int` An int of the min degree
`Degree.sequence graph` Full Usage: `Degree.sequence graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `seq<float>` A float seq of degree values	Returns the degree sequence of the graph graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `seq<float>` A float seq of degree values
`Degree.sequence graph` Full Usage: `Degree.sequence graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `seq<float>` A float seq of degree values	Returns the degree sequence of the graph graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `seq<float>` A float seq of degree values
`Degree.sequence graph` Full Usage: `Degree.sequence graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int[]` An array of degree values in descending order	Returns the degree sequence of the graph graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int[]` An array of degree values in descending order
`Degree.sequence graph` Full Usage: `Degree.sequence graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int[]` An array of degree values in descending order	Returns the degree sequence of the graph graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int[]` An array of degree values in descending order
`Degree.sequenceOfAdjGraph graph` Full Usage: `Degree.sequenceOfAdjGraph graph` Parameters: graph : `AdjGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `seq<float>` A float seq of out-degree values	Returns the 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
`Degree.sequenceOfDiGraph graph` Full Usage: `Degree.sequenceOfDiGraph graph` Parameters: graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int[]` An array of degree values in descending order	Returns the degree sequence of the graph graph : `DiGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int[]` An array of degree values in descending order
`Degree.sequenceOfFGraph graph` Full Usage: `Degree.sequenceOfFGraph graph` Parameters: graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `seq<float>` A float seq of degree values	Returns the degree sequence of the graph graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `seq<float>` A float seq of degree values
`Degree.sequenceOfUndirected graph` Full Usage: `Degree.sequenceOfUndirected graph` Parameters: graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `int[]` An array of degree values in descending order	Returns the degree sequence of the graph graph : `UndirectedGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `int[]` An array of degree values in descending order
`Degree.weightedDegreeOfFGraphNode nk weightF graph` Full Usage: `Degree.weightedDegreeOfFGraphNode nk weightF graph` Parameters: nk : `'NodeKey` - The NodeKey to get the weighted Degree weightF : `'EdgeData -> float` - Function to get a float weight of the EdgeData graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` - The graph to be analysed Returns: `float` A float of the weighted degree of a node	Get the weighted degree of the node with the 'NodeKey nk of the graph. nk : `'NodeKey` The NodeKey to get the weighted Degree weightF : `'EdgeData -> float` Function to get a float weight of the EdgeData graph : `FGraph<'NodeKey, 'NodeData, 'EdgeData>` The graph to be analysed Returns: `float` A float of the weighted degree of a node