Shortest Path in a Graph

From NovaOrdis Knowledge Base
Revision as of 19:19, 14 October 2021 by Ovidiu (talk | contribs) (→‎Algorithm)
Jump to navigation Jump to search

External

Internal

Overview

There are several algorithms that compute the shortest path between two vertices in a graph, and they can be used or not depending on the characteristics of the graph, such as whether is directed or undirected, the edges have weights, the weights are. negative or not.

The Problem

Shortest Path Algorithms

TODO

Reshape this page to accommodate Dijkstra's Algorithm.