5.15. Self Check

Q-1: is a graph with n nodes, the nodes can be arranged in a circle with each node connected to the k nearest neighbors.

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

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 of activities on this page