Also known as Warshall–Floyd Algorithm
algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
via Wikidata · CC0
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).