Graphs: degrees, Euler paths and shortest paths
Sign up free to unlock this topic
Kindergarten is free, and guests can try one sample topic in every other grade. A free parent or teacher account opens every topic from Kindergarten to Grade 12 and saves progress. No credit card.
Try the free sample: Function notation and inverses · Have a class or homeroom code? Join here
Key idea: Graphs: degrees, Euler paths and shortest paths
A graph is dots (vertices) joined by edges. A vertex's degree is how many edges touch it. An Euler circuit uses every edge once and returns to the start; it exists when every degree is even.
Key words
- Euler path
- Exactly two odd-degree vertices.
- Shortest path
- Smallest total of edge weights.
🔎 What to look for: Count degrees first. For shortest paths, keep the best total to each vertex as you go.
