Function minDistance

src/13-graph/dijkstra.ts:5–15

(dist: number[], visited: boolean[])

const INF = Number.MAX_SAFE_INTEGER; // Infinity

const minDistance = (dist: number[], visited: boolean[]): number => {
  let min = INF;
  let minIndex = -1;
  for (let v = 0; v < dist.length; v++) {
    if (visited[v] === false && dist[v] <= min) {
      min = dist[v];
      minIndex = v;
    }
  }
  return minIndex;
};

/**
 * Runs Dijkstra's shortest-path algorithm on an adjacency-matrix graph.