Graph data structure and algorithms for Common Lisp
The GRAPH Common Lisp library provides a data structures to represent graphs, as well as some graph manipulation and analysis algorithms (shortest path, maximum flow, minimum spanning tree, etc.).
System | Target | Derivation | Build status |
---|---|---|---|
x86_64-linux | /gnu/store/jaf2krinr2b0z9xpj10x6558jlynhai8-sbcl-graph-0.0.0-0.78bf9ec.drv | ||
mips64el-linux | /gnu/store/lvk8w60qj98651xknkdnkyhg9ddqy92j-sbcl-graph-0.0.0-0.78bf9ec.drv | ||
i686-linux | /gnu/store/nyq9z80zdsb9xiw4p2myax7jff6z7j7m-sbcl-graph-0.0.0-0.78bf9ec.drv | ||
armhf-linux | /gnu/store/z1c886plcws13z5zb2sb2rzichq4mcjz-sbcl-graph-0.0.0-0.78bf9ec.drv | ||
aarch64-linux | /gnu/store/izipzniiz7j368q5iaj09wkfzfxq3apn-sbcl-graph-0.0.0-0.78bf9ec.drv |
Linter | Message | Location |
---|---|---|
No lint warnings ✓ |