Jump to content

Shortest path problem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 80.128.181.114 (talk) at 15:45, 26 February 2002. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Given a weighted graph, that is a set N of nodes, a set E of edges and a function f:E-->R, and given further two elements n, n' of N, find a path P from n to n', so that

-----
 
 /      f(p)
-----
p in P

is minimal in all pathes connecting n to n'.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Shortest_path_problem&oldid=20361"