Week 10 - Graph structure/ Algorithms

Question 1

What is a graph in data structures?

Answer 1

A graph is a data structure used to represent a collection of objects (called vertices or nodes) and the connections between them (called edges).

Question 2

What is the difference between Undirected and Directed graphs?

Answer 2

Undirected: Edges are bidirectional (no direction).

Directed: Edges have a direction (from one vertex to another).

Question 3

What is the difference between Unweighted and Weighted graphs?

Answer 3

Unweighted: Does not assign any numerical value to the edges.

Weighted: Assigns a numerical value (weight) to the edges.

Question 4

What are the four types of graph?

Answer 4

• Undirected & Unweighted
• Directed & Unweighted
• Undirected & Weighted
• Directed & Weighted

Question 5

What is an example of an Undirected & Unweighted graph?

Answer 5

Example: Facebook relationship

Vertices: Registered people

Edges: Friendships (mutual)

Question 6

What is an example of a Directed & Unweighted graph?

Answer 6

Example: Twitter/X relationship

Vertices: Registered people

Edges: Who is following whom

Question 7

What is an example of an Undirected & Weighted graph?

Answer 7

Example: Train map

Vertices: Train stops/stations

Edges: Rail lines connecting train stops, with their length (weight)

Question 8

What is an example of a Directed & Weighted graph?

Answer 8

Example: Financial networks

Vertices: Bank accounts

Edges: Money transfers with the amount (weight)