Directed vs undirected graphs in Data Structures Theory - Quick Revision & Key Differences

Recall & Review

beginner

What is a directed graph?

A directed graph is a set of points called vertices connected by edges that have a direction. Each edge goes from one vertex to another specific vertex.

beginner

What is an undirected graph?

An undirected graph is a set of vertices connected by edges that do not have a direction. The connection between two vertices is mutual.

intermediate

How does edge direction affect graph traversal?

In directed graphs, you can only move along edges in their given direction. In undirected graphs, you can move freely between connected vertices both ways.

beginner

Give a real-life example of a directed graph.

A social media follower network is a directed graph because one person can follow another without the follow being mutual.

beginner

Give a real-life example of an undirected graph.

A friendship network is an undirected graph because friendship is usually mutual, so the connection goes both ways.

Which type of graph has edges with a specific direction?

A Both directed and undirected

B Undirected graph

C Directed graph

D Neither

Directed graphs have edges that point from one vertex to another, showing direction.

In an undirected graph, how do edges connect vertices?

A Edges have arrows showing direction

B Edges connect vertices mutually without direction

C Edges connect only one vertex

D Edges are not used

Undirected graph edges connect vertices in both directions equally.

Which graph type would best represent a one-way street map?

A Undirected graph

B Both

C Neither

D Directed graph

One-way streets have direction, so a directed graph models them well.

If you can travel back and forth freely between two points, the graph is likely:

A Undirected

B Weighted

C Directed

D Disconnected

Undirected graphs allow movement in both directions between connected vertices.

Which of these is NOT a property of directed graphs?

A Edges connect vertices mutually

B Edges can be one-way

C Edges have direction

D Edges go from one vertex to another

Directed graph edges do not necessarily connect vertices mutually; they have a specific direction.

Explain the main difference between directed and undirected graphs with examples.

Think about whether connections go one way or both ways.

Describe how edge direction affects movement in a graph.

Consider how you can travel between points.