Loop Type

Constructors

Constructor Description

Loop()

Full Usage: Loop()

Returns: Loop
Returns: Loop

Static members

Static member Description

Loop.loopCount graph

Full Usage: Loop.loopCount graph

Parameters:
    graph : DiGraph<'NodeKey, 'NodeData, 'EdgeData> - The graph to be analysed

Returns: int An int of the mean degree

Get the amount of self loops.

graph : DiGraph<'NodeKey, 'NodeData, 'EdgeData>

The graph to be analysed

Returns: int

An int of the mean degree

Loop.loopCount graph

Full Usage: Loop.loopCount graph

Parameters:
    graph : AdjGraph<'NodeKey, 'NodeData, 'EdgeData> - The graph to be analysed

Returns: int An int of the mean degree

Get the amount of self loops.

graph : AdjGraph<'NodeKey, 'NodeData, 'EdgeData>

The graph to be analysed

Returns: int

An int of the mean degree

Loop.loopCount graph

Full Usage: Loop.loopCount graph

Parameters:
    graph : FGraph<'NodeKey, 'NodeData, 'EdgeData> - The graph to be analysed

Returns: int An int of the mean degree

Get the amount of self loops.

graph : FGraph<'NodeKey, 'NodeData, 'EdgeData>

The graph to be analysed

Returns: int

An int of the mean degree

Loop.loopCountAdjGraph graph

Full Usage: Loop.loopCountAdjGraph graph

Parameters:
    graph : AdjGraph<'NodeKey, 'NodeData, 'EdgeData> - The graph to be analysed

Returns: int An int of loop count

Get the amount of self loops.

graph : AdjGraph<'NodeKey, 'NodeData, 'EdgeData>

The graph to be analysed

Returns: int

An int of loop count

Loop.loopCountFGraph graph

Full Usage: Loop.loopCountFGraph graph

Parameters:
    graph : FGraph<'NodeKey, 'NodeData, 'EdgeData> - The graph to be analysed

Returns: int An int of loop count

Get the amount of self loops.

graph : FGraph<'NodeKey, 'NodeData, 'EdgeData>

The graph to be analysed

Returns: int

An int of loop count

Loop.loopCountOfDiGraph graph

Full Usage: Loop.loopCountOfDiGraph graph

Parameters:
    graph : DiGraph<'NodeKey, 'NodeData, 'EdgeData> - The graph to be analysed

Returns: int An int of loop count

Get the amount of self loops.

graph : DiGraph<'NodeKey, 'NodeData, 'EdgeData>

The graph to be analysed

Returns: int

An int of loop count