Week 11

1. dfs spanning tree (A,E) (E,D) (D,C) (C,B) (E,F)
2. bfs spanning tree (A,B) (A,E) (B,C) (E,D) (E,F)
3. prims (A,E) (E,D) (D,C) (E,F) (B,C)
   Starting with a single vertex in MST keep adding least weight edge vertex of ANY vertex in MST to MST.
4. kruskals (C,D) (E,D) (E,F) (B,C) (A,E)
   (put all edges on priority queue - take off one by one and insert into tree providing it doesn't make a cycle)

5. dijkstra
   
   vertex set  weight[a] weight[b] weight[c] weight[d] weight[e]
     a           0         inf       inf        7        inf
     a d         0          9        12          7       inf
    a d b        0          9        12          7       inf
   a d b c       0          9        12          7       18
   a d b c e     0          9        12          7       18
   
   
   

6. For any vertex v in Vertex set, weight[v] is the least cost path from source to v.