com.biserkov/twotree.longest-path

Library for computing longest paths in 2-trees in O(n) time

Leiningen/Boot

[com.biserkov/twotree.longest-path "0.1.0-SNAPSHOT"]

com.biserkov/twotree.longest-path {:mvn/version "0.1.0-SNAPSHOT"}

implementation("com.biserkov:twotree.longest-path:0.1.0-SNAPSHOT")

<dependency>
  <groupId>com.biserkov</groupId>
  <artifactId>twotree.longest-path</artifactId>
  <version>0.1.0-SNAPSHOT</version>
</dependency>

Pushed by
jbiserkov on Aug 27, 2018
Recent Versions
- 0.1.0-SNAPSHOT
Dependencies
Homepage
https://github.com/Biserkov/twotree-longest-path
License
- Eclipse Public License
Version Badge
Want to display the latest version of your project on GitHub? Use the markdown code below!
[![Clojars Project](https://img.shields.io/clojars/v/com.biserkov/twotree.longest-path.svg)](https://clojars.org/com.biserkov/twotree.longest-path)
If you want to include pre-releases and snapshots, use the following markdown code:
[![Clojars Project](https://img.shields.io/clojars/v/com.biserkov/twotree.longest-path.svg?include_prereleases)](https://clojars.org/com.biserkov/twotree.longest-path)