Cycle Detection in Undirected Graph
Write a function that detects if an undirected graph contains a cycle.
Articulation Points
Implement a function that returns the articulation points of an undirected graph.
Bridges in Graph
Implement a function that returns all bridges in an undirected graph.
Hamiltonian Path Check
Implement a function that checks whether an undirected graph has a Hamiltonian path using DFS and backtracking.
Minimum Cut
Given an undirected graph in adjacency-list form, return the size of the minimum edge cut that disconnects the graph.
Bipartite Graph Check
Implement a function to check if an undirected graph is bipartite using graph coloring.
Graph Coloring
Given an undirected graph, determine if it can be colored with two colors such that adjacent vertices have different colors.
Prim's Minimum Spanning Tree
Given a connected undirected weighted graph, compute the total weight of its minimum spanning tree using Prim's algorithm.
Kruskal MST
Implement Kruskal's algorithm to compute the total weight of a minimum spanning tree in a connected undirected graph.
Clique Detection
Given an undirected graph and a list of vertices, check if every pair of distinct vertices in the list is connected by an edge.
Minimum Height Trees
Given an undirected tree, find all root nodes that minimize the height of the tree.
Showing 1–11 of 11 challenges · Graphs & Graph Algorithms
Graphs & Graph Algorithms — Python coding challenges
What you will find here
This page lists graphs & graph algorithms challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.
Challenges vs tutorials and quizzes
Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.