That’s actually a tree. A cycle is a path from a node back to itself that does not traverse any edge more than once. You can have a directed acyclic graph (DA

That’s actually a tree. A cycle is a path from a node back to itself that does not traverse any edge more than once. You can have a directed acyclic graph (DAG) where there are multiple paths from one node to another, but there is no way to revisit a node once you have moved on.