Shortest Path Problem: Difference between revisions
From Rice Wiki
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
= Problem Description = | |||
A path is a sequence of nodes <math>x_i</math> | |||
such that for all consecutive nodes, there exist an edge | |||
</ | |||
Revision as of 01:21, 28 February 2024
Problem Description
A path is a sequence of nodes Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle x_i} such that for all consecutive nodes, there exist an edge
