Nonnegative Integer Weights: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

10 April 2023

15 February 2023

  • curprev 10:1910:19, 15 February 2023‎ Admin talk contribs‎ 2,426 bytes +2,426‎ Created page with "{{DISPLAYTITLE:Nonnegative Integer Weights (Shortest Path (Directed Graphs))}} == Description == The shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. Here, the weights are restricted to be nonnegative integers. == Related Problems == Generalizations: nonnegative weights Related: General Weights, Nonnegative Weights, Second Shortest..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Nonnegative_Integer_Weights"