The following node is available in the Open Source KNIME predictive analytics and data mining platform version 2.7.1. Discover over 1000 other nodes, as well as enterprise functionality at
http://knime.com.
Shortest Path
Find shortest paths between to defined objects
by executing the standard Dijkstra-Algorithm.
Notice: The node does not support hypergraphs.
Dialog 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].
Ports
Output Ports
0 |
Network with the shortest path
|
This node is contained in Network Base Plug-in
provided by Chair for Bioinformatics and Information Mining,University of Konstanz,Germany.