Shortest Path

Find shortest paths between two defined objects by executing the standard Dijkstra-Algorithm. Notice: The node does not support hypergraphs.

Options

Source
The id of the source object
Target
The id of the target object
Copy features
Tick if all features of the objects along the shortest path should be copied from the original network to the new network with the shortest path including direction.
Weght policy
None does not consider the weight, weight as distance treats the edge weight as distance and weight as similarity treats the edge weight as similarity. Similarity weights are converted to distance by computing 1 - original weight thus the edge weight should be in the range between [0,1].

Input Ports

Icon
Network to analyze

Output Ports

Icon
Network with the shortest path

Views

This node has no views

Workflows

Further Links

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.