... | ... | @@ -2,6 +2,8 @@ |
|
|
---
|
|
|
Jade offers easy to use, [KISS](http://en.wikipedia.org/wiki/KISS_principle) 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 paths between two nodes', no free library we tried fits our performance and flexibility needs (current year: 2013). Thus, we made it on our own.
|
|
|
|
|
|
Jade is published under the [3-Clause BSD License](http://opensource.org/licenses/BSD-3-Clause), Owner/Organization: [DFKI GmbH](http://www.dfki.de), 2013.
|
|
|
|
|
|
**Key features:**
|
|
|
|
|
|
* In-memory graph representation with small memory footprint. We e.g. host the whole music area in a ~1GB RAM graph at [Horst](http://horst.dfki.de). This graph comprises currently ~10M nodes with ~28M relations.
|
... | ... | @@ -13,8 +15,4 @@ The Jade team |
|
|
|
|
|
***
|
|
|
[How to start](how-to-start) | [Code snippets / Examples](examples) | [Extending Jade](extending_jade) | [People / Contact](people) | [Supporters](supporters)
|
|
|
***
|
|
|
|
|
|
Jade is published under the [3-Clause BSD License](http://opensource.org/licenses/BSD-3-Clause), Owner/Organization: [DFKI GmbH](http://www.dfki.de), 2014.
|
|
|
|
|
|
--- |
|
|
\ No newline at end of file |
|
|
*** |
|
|
\ No newline at end of file |