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].

This node has no views

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.

To use this node in KNIME, install the extension KNIME Network Mining from the below update site following our NodePit Product and Node Installation Guide:

v5.4

A zipped version of the software site can be downloaded here.

Plugin provider: KNIME AG, Zurich, Switzerland

Plugin version: 5.4.0.v202407231410

On NodePit since: 2024-12-06

Last update: 2024-12-21

KNIME versions: Since v3.6

Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.