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.
