Question 1
Which of the following best describes a 'vertex' in a graph?
Question 2
What is the primary characteristic of a 'directed graph'?
Question 3
Which graph representation is generally more efficient for sparse graphs (graphs with relatively few edges)?
Question 4
What is the key difference between Breadth-First Search (BFS) and Depth-First Search (DFS) traversal algorithms?
Question 5
In the context of graph applications, what problem does Dijkstra's algorithm typically solve?
