GitHub - igel-kun/transEd: implementation of an exact algorithm (+greedy heuristic) to edit a given digraph into a transitive one.

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
brute_graph.cpp		brute_graph.cpp
digraph.cpp		digraph.cpp
digraph.h		digraph.h
editing.cpp		editing.cpp
editing.h		editing.h
makefile		makefile
search_dag.cpp		search_dag.cpp
test_graph.txt		test_graph.txt
test_set.cpp		test_set.cpp
trans_brute.cpp		trans_brute.cpp