A graph that has at least one such loop is called cyclic, and one which doesn't is called acyclic. Acylic directed graphs are also called dags.
確定！ 回上一頁
