What does Prim's algorithm guarantee?

  • A: Distance between any two cities is no more than twice the shortest path between them
  • B: If two cities have a direct edge connecting them, the path between them will use it
  • C: Total distance to connect all nodes is minimized
  • D: Total distance between pairs of nodes is minimized
  • E: Nodes that are too far away are not connected


    Contents    Page-10    Prev    Next    Page+10    Index