@@ -4,7 +4,7 @@ Jade offers easy to use, [KISS](http://en.wikipedia.org/wiki/KISS_principle) gra
...
@@ -4,7 +4,7 @@ Jade offers easy to use, [KISS](http://en.wikipedia.org/wiki/KISS_principle) gra
**Key features:**
**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.
* 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 ~10M 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 (maybe you had more luck).
* 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 (maybe you had more luck).
Use it at own will, risk, we give no warranty (of course). Have fun.
Use it at own will, risk, we give no warranty (of course). Have fun.
