1. Home
  2. Flashcards
  3. Preview

Network algoritms

  1. Kruskal's
    • Minimal spanning tree
    • Select shortest edge, then next shortest etc.
    • Stop when all nodes connected
    • Don't create cycles
  2. Prim's
    • Minimal spanning tree
    • Chose starting node
    • Pick shortest connected edge etc.
    • Stop when all nodes connected
    • Don't create any cycles
  3. Dijkstra's
    • Shortest path from node-node
    • Image Upload 2
Author
algebrageek
ID
184654
Card Set
Network algoritms
Description
MEI FP1: Chapter 3
Updated

  1. Home
  2. Flashcards
  3. Preview