Topics: Graph Theory - Tree - Vertex
(definition)
In a tree, a vertex that has no predecessors is called a root vertex.
Search
Topics: Graph Theory - Tree - Vertex
(definition)
In a tree, a vertex that has no predecessors is called a root vertex.