All notable changes to this project will be documented in this file.
The format is based on Keep a Changelog, and this project adheres to Semantic Versioning.
- Added function
cycles(g)to check if a graph has cycles
- Have redone the algorighm from scratch
- Simple module that finds explicitly defined transitive edges in an directed acyclic graph