Transitive reduction of a DAG

Computes the transitive reduction of a directed acyclic graph (DAG)

Given a DAG in adjacency matrix format, this code will determine the topological ordering of the nodes and, using that ordering, efficiently compute the transitive reduction of the DAG. The package furthermore contains code to generate random non-transitive DAGs as well as derived transitive DAGs as test cases for the algorithm. A function writing the generated DAGs to graph file formats .sif or .dot for visualization is included. Code was developed as an alternative to the GraphViz tool tred, which has incredibly long run times on some medium-sized but highly connected DAGs (see file tred_vs_dag_trans_red.pdf included in the package).