5.15. Self Check

Q-2: Which of the below graph algorithms are used for computing the shortest path between nodes. Select multiple choices.

• Breadth-first search (BFS)
• Good Job!
• Depth-first search (DFS)
• Incorrect, DFS is not used for computing the shortest path between nodes. Please try again.
• Dijkstra’s algorithm
• Correct!
• Bellman-Ford Algorithm
• Incorrect, Bellman-Ford is not used. Please try again

Before you keep reading...

Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.

Support Runestone Academy Today

Before you keep reading...

Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.

Support Runestone Academy Today

Q-3: Match the following to the order that they need to be in to build a Watts-Strogatz (WS) graph.
• 1
• Rewire some of the edges of the ring lattice.
• 2
• Quantify the tendency for the nodes to form cliques.
• 3
• Compute the average length of the shortest path between each pair of nodes.
• 4
• You are ready to replicate the WS experiment.

You have attempted 1 of 4 activities on this page