Root Loops

Classify as many graphs as you can in 60 seconds. Each graph is either a tree (has zero cycles) or cyclic (has at least one cycle).

Controls

• X - Classify graph as a tree
• Z - Classify graph as cyclic

Examples

The graph pictured below is a tree because there are no loops

This graph pictured below is cyclic because there is a loop

Hints

Wikipedia has more information about graph theory and cycles.

About

Created for TriJam 227
Theme: Trees
Development Time: 1h 56m 46s

Also submitted to MiniJam 136
Theme: Cycles
Limitation: 16x16 resolution

Source code available on GitHub

Acknowledgements

Sound effects are from Gruber's Pico-8 SFX Pack, licensed under CC BY-NC-SA 4.0