Library for computing longest paths in 2-trees in O(n) time
[twotree.longest-path "0.1.2"]
twotree.longest-path/twotree.longest-path {:mvn/version "0.1.2"}
implementation("twotree.longest-path:twotree.longest-path:0.1.2")
<dependency> <groupId>twotree.longest-path</groupId> <artifactId>twotree.longest-path</artifactId> <version>0.1.2</version> </dependency>
Want to display the latest version of your project on GitHub? Use the markdown code below!
If you want to include pre-releases and snapshots, use the following markdown code: