shortest path problem

Show Summary Details

Quick Reference

The problem in graph theory to find the shortest connected route between two points or vertices, i.e. the minimum sum of the edges on all possible connected routes between the two vertices.

Subjects: Mathematics.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.