Network algoritms

Home > Preview

The flashcards below were created by user algebrageek on FreezingBlue Flashcards.


  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

Card Set Information

Author:
algebrageek
ID:
184654
Filename:
Network algoritms
Updated:
2012-11-20 18:30:22
Tags:
Further Maths
Folders:

Description:
MEI FP1: Chapter 3
Show Answers:

What would you like to do?

Home > Flashcards > Print Preview