Computes the graph density
Constructor | Description |
|
|
Static member | Description |
Full Usage:
InformationEntropy.compute (labelF, graph, n)
Parameters:
'NodeData -> 'Information
-
The function to get the desired information for the entropy of the nodedata.
graph : AdjGraph<'NodeKey, 'NodeData, 'EdgeData>
-
The graph for which to compute the information entropy.
n : 'NodeKey
-
The node for which to compute the information entropy.
Returns: float
The information entropy of the given node .
|
This calculation does not consider self loops
|
Full Usage:
InformationEntropy.compute (labelF, graph, n)
Parameters:
'NodeData -> 'Information
-
The function to get the desired information for the entropy of the nodedata.
graph : FGraph<'NodeKey, 'NodeData, 'EdgeData>
-
The graph for which to compute the information entropy.
n : 'NodeKey
-
The node for which to compute the information entropy.
Returns: float
The information entropy of the given node .
|
This calculation does not consider self loops
|
Full Usage:
InformationEntropy.compute (labelF, graph, n)
Parameters:
'NodeData -> 'Information
-
The function to get the desired information for the entropy of the nodedata.
graph : DiGraph<'NodeKey, 'NodeData, 'EdgeData>
-
The graph for which to compute the information entropy.
n : 'NodeKey
-
The node for which to compute the information entropy.
Returns: 'a
The information entropy of the given node .
|
This calculation does not consider self loops
|
Full Usage:
InformationEntropy.ofAdjGraph labelF graph n
Parameters:
'NodeData -> 'Information
-
The function to get the desired information for the entropy of the nodedata.
graph : AdjGraph<'NodeKey, 'NodeData, 'EdgeData>
-
The graph for which to compute the information entropy.
n : 'NodeKey
-
The node for which to compute the information entropy.
Returns: float
The information entropy of the given node .
|
This calculation does not consider self loops
|
Full Usage:
InformationEntropy.ofDiGraph labelF graph n
Parameters:
'NodeData -> 'Information
-
The function to get the desired information for the entropy of the nodedata.
graph : DiGraph<'NodeKey, 'NodeData, 'EdgeData>
-
The graph for which to compute the information entropy.
n : 'NodeKey
-
The node for which to compute the information entropy.
Returns: 'a
The information entropy of the given node .
|
This calculation does not consider self loops
|
Full Usage:
InformationEntropy.ofFGraph labelF graph n
Parameters:
'NodeData -> 'Information
-
The function to get the desired information for the entropy of the nodedata.
graph : FGraph<'NodeKey, 'NodeData, 'EdgeData>
-
The graph for which to compute the information entropy.
n : 'NodeKey
-
The node for which to compute the information entropy.
Returns: float
The information entropy of the given node .
|
This calculation does not consider self loops
|