What does Dijkstra's algorithm produce?

  • A: Shortest paths from one node to all other nodes
  • B: Shortest path between any pair of nodes
  • C: Shortest path from one node to one goal node
  • D: Minimum total distance of all paths
  • E: Minimum average distance between any pair of nodes


    Contents    Page-10    Prev    Next    Page+10    Index