The Horst graph library offers an easy to use, [KISS](http://en.wikipedia.org/wiki/KISS_principle) graph library, 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.
The Horst graph library offers an easy to use, [KISS](http://en.wikipedia.org/wiki/KISS_principle) graph library, 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. Thus, we made it on our own.
Horst is an acronym for 'holistic recommender and storytelling technology' and is published under the [3-Clause BSD License](http://opensource.org/licenses/BSD-3-Clause), Owner/Organization: [DFKI GmbH](http://www.dfki.de), 2014.
