Shortest Path Problem: Difference between revisions
From Rice Wiki
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
= Problem Description = | = Problem Description = | ||
A path is a sequence of nodes <math>x_i</math> | A path is a sequence of nodes | ||
<math> | |||
x_1, x_2, x_3, \ldots, x_i | |||
</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
