19.1. Representing Graphs

Try these first

1. 1.

   Define a graph.

   Hint

   Think about nodes and their connections.

2. 2.

   What is the difference between undirected and directed graphs?

   Hint

   Consider the flow of connections.

3. 3.

   What does a directed edge in a graph represent?

   • Two-way connection
   • One-way connection
   • No connection

   Hint

   Remember the flow of direction!

4. 4.

   An adjacency matrix is symmetric for which type of graph?

   • True
   • False

   Hint

   Think about undirected edges!

5. 5.

   Given a weighted graph, explain how you'd modify the adjacency matrix to represent weights instead of binary connections.

   Hint

   Consider what information the weights convey.

6. 6.

   Design an algorithm using BFS to find the shortest path in an unweighted graph, then explain key steps.

   Hint

   Think about how you would ensure all connections are checked systematically.