HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Python Labs
  2. /Degrees and components
MathematicsMediumHigh School (11–12)Pigeonhole Principle, Recursion and Graph Theory

Degrees and components

You will write three functions for a graph stored as a list of edges, such as [(0, 1), (1, 2)], on the vertices 0 to n - 1.

Your tasks.

  1. Finish degrees(n, edges). Return the list of degrees.
  2. Finish handshake_ok(n, edges). Return True when the sum of the degrees is twice the number of edges.
  3. Finish component(n, edges, start). Return the set of vertices reachable from start.

Run it first, just as it is. The checker at the end prints FAIL for each task. Then do the tasks one at a time, and run the program again after each one. A Hint appears under every check that still fails.

When every line says PASS, build K5K_5K5​ with combinations(range(5), 2) and print its degrees.

StemPy LabContributed by StemPy Lab
python
Loading Python runtime…

A worked solution

Run your code once to unlock the worked solution.

Have you tried it?

Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.

Log in to save
← All Labs
← Derangements and Catalan numbersEuler and two colours →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Graphs, degrees and the handshake lemmaGraph Theory

More labs on this topic

  1. Euler and two coloursMedium
  2. Derangements and Catalan numbersMedium
  3. Counting by recursionMedium
  4. Blocks and odd partsMedium
  5. Boxes for remainders
Medium
All labs on this topic →