Skip to content
College Subject Practice · College Year 2

Graph Algorithms practice questions — College Subject Practice · College Year 2 Algorithms

Practise graph algorithms with topic-based questions. Preview a sample, then start a short session.

See the question style before signup · Get instant feedback · Continue with focused practice

What you will practise

Breadth-First Search

Depth-First Search

Dijkstra's Algorithm

Bellman-Ford Algorithm

Floyd-Warshall Algorithm

Minimum Spanning Tree

Topological Sorting

Try a sample question

Check your answer to see the explanation where one has been published.

Try this question
Which traversal explores a graph level by level using a queue?

1 sample question · No signup needed

Something unclear? Report this question.

2
Which graph representation is most space-efficient for a sparse graph (few edges)?
3
In an undirected graph, the degree of a vertex is:
Start a sample session

50 published questions available for this topic.