Skip to Content
Learning JavaScript Data Structures and Algorithms - Third Edition
book

Learning JavaScript Data Structures and Algorithms - Third Edition

by Loiane Avancini
April 2018
Beginner to intermediate content levelBeginner to intermediate
426 pages
10h 19m
English
Packt Publishing
Content preview from Learning JavaScript Data Structures and Algorithms - Third Edition

The Floyd-Warshall algorithm

The Floyd-Warshall algorithm is a dynamic programming algorithm (you will learn more about dynamic programming in Chapter 14, Algorithm Design and Techniques) to calculate all the shortest paths on a graph. With this algorithm, we can find the shortest path from all the sources to all the vertices.

The Floyd-Warshall algorithm is given as follows:

const floydWarshall = graph => {  const dist = [];  const { length } = graph;  for (let i = 0; i < length; i++) { // {1}    dist[i] = [];    for (let j = 0; j < length; j++) {      if (i === j) {        dist[i][j] = 0; // {2}      } else if (!isFinite(graph[i][j])) {        dist[i][j] = Infinity; // {3}      } else {        dist[i][j] = graph[i][j]; // {4}      }    }  }  for (let k = 0; k < length; k++) { // {5} for (let ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms

Loiane Avancini

Publisher Resources

ISBN: 9781788623872Supplemental Content