👉 Untiered is a type of graph that is not connected. It means that there are no edges between nodes and all vertices have degree 1, meaning they can only be reached from one vertex by passing through other vertices. This property makes it possible to represent graphs with an undirected or directed edge where the directionality of the edges does not matter but their presence or absence matters.
