🎯

Shortest Path Calculator

Inputs

Number of Nodes

Total number of locations or waypoints in your network

Starting Node

The node number where your path begins (0-indexed)

Ending Node

The node number where your path ends (0-indexed)

Average Edge Distance (km)(km)

Average distance or cost between connected nodes

Network Density (%)

Percentage of possible connections that exist (10-100)

Shortest Path Distance

—

Total distance of the optimal route

Number of Hops

—

Nodes in Path

—

Estimated Travel Time

—

Formula

Shortest Distance = Σ(edge weights on optimal path); Travel Time = (Distance / Speed) × 60