Definition. A graph with no cycle is acyclic. An acyclic graph is a forest; a connected forest is a tree. A leaf is a vertex of degree 1 in a ...
確定! 回上一頁