Floyd–Warshall algorithm

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm) is an algorithm for finding shortest paths in a directed weighted graph with positive or negative edge weights (but with no negative cycles).

Excerpt from the Wikipedia article “Floyd–Warshall algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Mablue92, CC BY-SA 4.0, via Wikimedia Commons.