Shortest Path

From GM-RKB
(Redirected from shortest path)
Jump to: navigation, search

A Shortest Path is a graph path that is a optimal graph path (such that the path length[math](v_1, v_2)[/math] is shorter than any other possible graph path).



References

2011