home.markdown

-## The **HORST** graph library
+
+## [Home](https://git.opendfki.de/reuschling/horst-graph/wikis) | [How to start](https://git.opendfki.de/reuschling/horst-graph/wikis/how-to-start) | [Examples](https://git.opendfki.de/reuschling/horst-graph/wikis/examples) | [Extending Horst](https://git.opendfki.de/reuschling/horst-graph/wikis/extending_horst) | [People/Legal Information](https://git.opendfki.de/reuschling/horst-graph/wikis/people) | [Data Protection](https://git.opendfki.de/reuschling/horst-graph/wikis/dataprotection)
 ---
+
+## The **HORST** graph library
+
 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 is published under the [3-Clause BSD License](http://opensource.org/licenses/BSD-3-Clause), Owner/Organization: [DFKI GmbH](http://www.dfki.de), 2014.
@@ -12,7 +16,3 @@ The Horst graph library is published under the [3-Clause BSD License](http://ope
 Use it at own will and risk. Have fun.
 
 The HORST team
-
-***
-[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