networks

Question 1

what do you do for kruskal’s algorithm?

Answer 1

select smallest length
keep on selecting smallest length left
NO LOOPS
number of lines = vertices - 1

Question 2

what do you do for prim’s algorithm?

Answer 2

choose a starting vertex
connect to nearest small length
repeat until all lines connected
NO LOOPS

Question 3

what do you do for prim’s algorithm in a table?

Answer 3

start at A
look down A column and pick smallest
cross off the two letters rows
look at both vertices and pick smallest
repeat

Question 4

what do you do for dijkstra’s algorithm?

Answer 4

start at A
write down all temporary values for edges
pick smallest and make permanent
repeat
at end follow back to find shortest path