-
## New `geo::algorithm` module to calculate shortest path between two given points based on given `MultiLineString` struct.
### Let's implement it in two separate steps for two separate features.
…
-
Currently KOMB relies on [igraph](https://igraph.org/c/) for k-core decomposition. Hence, although all the adjacency information for the graph construction is done in the functions `Kgraph::readSAM`, …
-
The possibility to have alternatives to solph is part of oemof's core design. At the Nov. '18 dev meeting the idea came up, to implement such an alternative that can directly model classical control s…
-
### Proposal
Update the adaptive step-size algorithm to capture the stability and conditioning improvements demonstrated in [1].
Feedback would be much appreciated on the technical details of the …
-
Hey, I see this package is struggling to catch up latest changes. Will it be in the maintenance mode in future? I personally feel it is a very useful library. Also there are some pull requests that ha…
-
This is part of [openjournals/joss-reviews#1843](https://github.com/openjournals/joss-reviews/issues/1843). This post is about code implementation.
The author implements a coloring algorithm based…
-
Hello,
Thanks for this beautiful ecosystem!
We are the developers of [`MultilayerGraphs.jl`](https://github.com/InPhyT/MultilayerGraphs.jl). As stated in the [announcement](https://discourse.jul…
-
Hi,
This is a new-feature request or consultation (since i may try to implement this myself).
I wish to use GraphMatcher.subgraph_isomorphisms_iter() in order to retrieve candidates from a (graph…
-
# Summary
This RFC explores the potential of adding additional functionality to XYFlow to allow for more complex graphs while still remaining performant for smaller graphs and the general case.
# Mo…
-
I am deciding whether to use Java 8 + JGraphT or Python 3 + NetworkX. So I implemented a simple triangle counting algorithm in both. To my surprise, JGraphT runs slower than NetworkX on the same machi…