|
## **Jade** - **J**ava kickin' **A**ss graph libraries **DE**luxe
|
|
## **Jade** - **J**ava kickin' **A**ss graph libraries **DE**luxe
|
|
|
|
---
|
|
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 needs (current year: 2013). Thus, we made it on our own.
|
|
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 needs (current year: 2013). Thus, we made it on our own.
|
|
|
|
|
|
**Key features:**
|
|
**Key features:**
|
... | @@ -10,3 +10,7 @@ Jade offers easy to use, [KISS](http://en.wikipedia.org/wiki/KISS_principle) gra |
... | @@ -10,3 +10,7 @@ Jade offers easy to use, [KISS](http://en.wikipedia.org/wiki/KISS_principle) gra |
|
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.
|
|
|
|
|
|
The Jade team
|
|
The Jade team
|
|
|
|
|
|
|
|
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
How to start | Code snippets / Examples | Extending Jade | People / Contact | Supporters
|
|
|
|
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
|
|
|
\ No newline at end of file |