| ... | @@ -13,7 +13,7 @@ The Horst graph library is published under the [3-Clause BSD License](http://ope |
... | @@ -13,7 +13,7 @@ The Horst graph library is published under the [3-Clause BSD License](http://ope |
|
|
* 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.
|
|
* 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 query nodes, you will receive the connecting paths. If 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).
|
|
* 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 query nodes, you will receive the connecting paths. If 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).
|
|
|
|
|
|
|
|
Try it with the whole music domain at [Horst](http://horst.dfki.de)!
|
|
**Try it with the whole music domain at [Horst](http://horst.dfki.de)!**
|
|
|
|
|
|
|
|
Use it at own will and risk. Have fun.
|
|
Use it at own will and risk. Have fun.
|
|
|
|
|
|
| ... | | ... | |
