Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Floyd–Warshall algorithm · Vinony

EntityQ1047576· pop 24· linked from 171 articles

Floyd–Warshall algorithm

Sign in to save

algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative

Connections

Bellman–Ford algorithm

mathematical optimization

greedy algorithm

list of algorithms

shortest path problem

convex optimization

computer science

International Standard Book Number

programming language

Wayback Machine

digital object identifier

Categories

Dynamic programming Graph algorithms Graph distance Polynomial-time problems Routing algorithms

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Bellman–Ford algorithm

Entitydist 0.23

Ear decomposition

Entitydist 0.61

Entitydist 0.61

Karger's algorithm

Entitydist 0.64

Gauss–Jordan elimination

Entitydist 0.68

non-negative matrix factorization

Entitydist 0.70

Akra–Bazzi method

Entitydist 0.71

Entitydist 0.71

Entitydist 0.74

Qatada ibn al-Nu'man

Entitydist 0.74

Entitydist 0.75

Muhammad al Warraq

Entitydist 0.76

What links here171 pages

alpha–beta pruning

ellipsoid method

approximation algorithm

Dijkstra's algorithm

Broyden–Fletcher–Goldfarb–Shanno algorithm

nonlinear programming

golden section search

convex optimization

Johnson's algorithm

route planning software

Firefly algorithm

integer programming

ant colony optimization algorithms

bidirectional search

Dinic's algorithm

register allocation

Newton's method in optimization

Coordinate descent