-
I was trying to compute matchings with this package, I had a problem when installing the dependency BlossomV.jl (https://github.com/mlewe/BlossomV.jl/issues/12). Then, I saw that the other way to solv…
-
It looks like all the flow algorithms only work for directed graphs. Would some of them work if we lift this restriction or would we need a new implementation for that?
-
I'm trying to update LightGraphs to julia 0.5 but I get some failures due to this package. Can you fix that @jpfairbanks?
Thanks,
Carlo
-
- Can add it to the more rich set of packages, should have easy ways to traverse, etc.
- Has `gplot`
- Could load the graph from a file, or just display a simple one inline rather than the fancy on…
-
I wanted to contribute to the package's flow algorithms. I could start off with an implementation of Edmond Carp's Maximum flow algorithm. I'm planning to use networkx's implementation as reference.
…
-
Hello,
I am using graph plot and it would be interesting to add the feature of changing the style of the edge line.
In my application having the possibility to set a dashed line would be signific…
-
For some algorithms, it is needed to visit each node and perhaps do some work there and then move on, in other words iterate through them. I implemented this myself (although a rough approach) so I ju…
-
It may be useful to have a toolbox for treating synthetic grids as graphs. In that case, LightGraphs.jl provides a large number of functionalities. Thus, it should be considered for future integration…
-
Apparently, the old Graphs.jl package made it possible to define a graph implicitly, where neighbors of a vertex are generated just-in-time instead of being stored statically (source: https://github.c…
-
At the moment, [`a_star`](https://juliagraphs.org/Graphs.jl/dev/pathing/#Graphs.a_star) returns a list of edges, while [`dijkstra_shortest_paths`](https://juliagraphs.org/Graphs.jl/dev/pathing/#Graphs…