home.markdown

-## **Jade** - **Ja**va KISS graph library **DE**luxe
+## The **HORST** graph library
 ---
-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.
+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.
 
-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.
+The Horst graph library is published under the [3-Clause BSD License](http://opensource.org/licenses/BSD-3-Clause), Owner/Organization: [DFKI GmbH](http://www.dfki.de), 2014.
 
 **Key features:**
 
@@ -11,8 +11,8 @@ Jade is published under the [3-Clause BSD License](http://opensource.org/license
 
 Use it at own will and risk. Have fun.
 
-The Jade team
+The HORST team
 
 ***
-[How to start](how-to-start) | [Code snippets / Examples](examples) | [Extending Jade](extending_jade) | [People / Contact](people) | [Supporters](supporters)
+[How to start](how-to-start) | [Code snippets / Examples](examples) | [Extending Horst](extending_horst | [People / Contact](people) | [Supporters](supporters)
 ***
\ No newline at end of file