Find the shortest path algorithm tables (for the graph) using the

(a) Dijkstra algorithm

(b) Ford-Fulkerson algorithm

Label the columns B,C,D from left to right. Node A is the root node.

Use pointers for only the Ford Fulkerson algorithm as in the Networks and Grids book.

(c) Let the link number be bandwidth (data rate). Create the routing table that allows you find paths to the root node that maximize the bottleneck bandwidth as in the article on Blackboard under the "New Materials" folder (and as was done in class today).