Single Source Shortest Paths

Single-Source Shortest-Path computes the shortest path from a source vertex to all other vertices of a logical graph. Each vertex contains this shortest path as a property. This algorithm use a scatter-gather iteration.

Options

Source Vertex ID: The id of the source vertex.
Fixed Iterations: Select the number of fixed iterations.
Property Key Edge: Set the name of the property for edges.
Property Key Vertex: Set the name of the property for vertices.

Input Ports

: One single logical graph.

Output Ports

: Same graph with shortest path to source vertex as vertex property.

Popular Predecessors

No recommendations found

Popular Successors

No recommendations found

Views

This node has no views

Workflows

No workflows found

Developers

You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.