BellmanFord Type

Computes BellmanFord shortest path

Constructors

Constructor Description

BellmanFord()

Full Usage: BellmanFord()

Returns: BellmanFord
Returns: BellmanFord

Static members

Static member Description

BellmanFord.hasNegativeCycles graph distances

Full Usage: BellmanFord.hasNegativeCycles graph distances

Parameters:
    graph : FGraph<'NodeKey, 'NodeData, float>
    distances : Dictionary<'NodeKey, float>

Returns: bool
graph : FGraph<'NodeKey, 'NodeData, float>
distances : Dictionary<'NodeKey, float>
Returns: bool

BellmanFord.ofFGraph starting graph

Full Usage: BellmanFord.ofFGraph starting graph

Parameters:
    starting : 'NodeKey
    graph : FGraph<'NodeKey, 'NodeData, float>

Returns: Dictionary<'NodeKey, float>
starting : 'NodeKey
graph : FGraph<'NodeKey, 'NodeData, float>
Returns: Dictionary<'NodeKey, float>