|
|
|
## Jade - **J**ava kickin' **A**ss graph libraries **DE**luxe |
|
|
\ No newline at end of file |
|
|
|
## **Jade** - **J**ava kickin' **A**ss graph libraries **DE**luxe
|
|
|
|
|
|
|
|
Jade offers easy to use, simple approach graph libraries, without sleepless nights (depending on your scenario of course ;) ) We searched such a library for our project [Horst](http://horst.dfki.de), but depending on 'find shortest/cheapest path between two nodes' no free library we tried fits our performance needs (current year: 2013).
|
|
|
|
|
|
|
|
Key features:
|
|
|
|
|
|
|
|
* In-memory graph representation with small memory footprint. We e.g. host the whole music area in a ~1.8GB RAM graph at [Horst](http://horst.dfki.de). This graph comprises currently ~1M nodes with ~28M relations.
|
|
|
|
* Fast multi steiner tree implementation, offering nearly-cheapest, connecting subgraphs between a set of graph nodes. In the case you give just two query nodes, you will receive the connecting paths. If all relations and nodes have the same weight, this approximates a shortest path algorithm - but even faster than other implementations we tried.
|
|
|
|
|
|
|
|
Use it at own will, risk, we give no warranty (of course). Have fun
|
|
|
|
|
|
|
|
The Jade team |
|
|
\ No newline at end of file |
