Shortest Path Problem: Difference between revisions
From Rice Wiki
No edit summary |
No edit summary |
||
| Line 2: | Line 2: | ||
A path is a sequence of nodes | A path is a sequence of nodes | ||
<math> | <math> | ||
x_1, x_2, x_3, \ldots, x_i | x_1, x_2, x_3, \ldots, x_i | ||
</math> | </math> | ||
such that for all consecutive nodes, there exist an edge | such that for all consecutive nodes, there exist an edge | ||
Revision as of 01:24, 28 February 2024
Problem Description
A path is a sequence of nodes
such that for all consecutive nodes, there exist an edge
