Shortest Path Problem

From Rice Wiki

Revision as of 01:24, 28 February 2024 by Rice (talk | contribs)

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

Problem Description

A path is a sequence of nodes

$x_{1},x_{2},x_{3},\ldots ,x_{i}$

such that for all consecutive nodes, there exist an edge

Retrieved from "http://ricefriedegg.com:80/mediawiki/index.php?title=Shortest_Path_Problem&oldid=21"