home.markdown

@@ -4,16 +4,16 @@
 
 ## 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. 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. 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, flexibility and simplicity 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.
 
 **Key features:**
 
-* In-memory graph representation with small memory footprint. We e.g. host the whole music area in a ~1GB RAM graph at [Horst](http://horst.dfki.de). This graph comprises currently(year 2020) ~21 million nodes with ~67 million connecting relationships.
-* Fast multi steiner tree implementation, offering nearly-cheapest (cheapest if you calculate to the end), connecting subgraphs between a set of graph nodes. In the case you give just two start nodes, you will receive the connecting paths. In the simple case where all relations and nodes have the same weight, this implements a shortest path algorithm - but even faster than other implementations we tried (maybe you had more luck).
-* Node recommendations by specifying start nodes and result node types.
-* RDF module to load arbitrary rdf graphs and offer the Horst functionality on top of it.
+* In-memory graph representation with **small memory footprint**. We e.g. host the whole music area in a ~1GB RAM graph at [Horst](http://horst.dfki.de). This graph comprises currently(year 2020) ~21 million nodes with ~67 million connecting relationships.
+* Fast multi **steiner tree** implementation, offering cheapest connecting subgraphs between a set of graph nodes. In the case you give just two start nodes, you will receive the connecting paths, which implements a **shortest path** algorithm - but even faster than other implementations we tried (maybe you had more luck).
+* Explainable **node recommendations** by specifying start nodes and result node types.
+* RDF module to **load arbitrary rdf graphs** and offer the Horst functionality on top of it.
 
 **Try it with the whole music domain at [Horst](http://horst.dfki.de)!**