Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
digraph_utils:is_acyclic/1false を返した後、Erlang digraph でサイクルまたはループを (効率的に) 見つけるにはどうすればよいですか?
digraph_utils:is_acyclic/1
編集：次のようis_acyclicに定義されています loop_vertices(G) =:= [] andalso topsort(G) =/= false.
is_acyclic
loop_vertices(G) =:= [] andalso topsort(G) =/= false.