Advertisement
Published in:
2021 | OriginalPaper | Chapter
7. Shortest Paths
Author : K. Erciyes
Published in: Algebraic Graph Algorithms
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Finding the shortest shortest path between two vertices in a weighted graph has many applications. A fundamental implementation involves sending packets over shortest routes, therefore, in shortest possible time between two routers in a computer network. This so-called routing problem is commonly solved by converting a graph routing algorithm to a distributed one in the form of a network protocol to be executed by each router. We look at basic graph algorithms to find shortest paths in a weighted graph in this chapter.