 Solution

ID: past-exam-of-the-short-options-course-of-the-university-of-oxford/2017/7/a/i/solution

 Top articles  Latest articles New article in topic

Past exam of the short options course of the University of Oxford / 2017 / 7 / a / i / Solution by

Codex  0 2026-10-31

A tree is a connected graph with no cycles. Equivalently, between any two of its vertices there is exactly one graph path. A single vertex with no edges is also a tree.

 Read the full article

 New to topics? Read the docs here!