-
For presenting and visualization of our work, it would be cool to generate 3d-force-graphs of the computation graphs using
https://github.com/vasturiano/3d-force-graph/
We need
a) functional…
-
Interface with USGS data? Create graphs that have this embedded? What new or modified algorithms would be possible?
-
This is something I noticed while investigating #7354. The test suite when run with the `nx-loopback` backend is significantly slower than when run without loopback. I'd expect it to be a little slowe…
-
# 17_Graphs
Notes should try to cover the following topics:
1. Adjacency List and Adjacency Matrix
2. Breadth-First Search Algorithms
3. Depth First Search Algorithms
4. Topological Sorting
5. P…
-
During the [Dispatching, Backend Selection, and Compatibility APIs](https://pretalx.com/euroscipy-2024/talk/8MXPRW/) discussion at EuroSciPy 2024 (for reference - https://hackmd.io/@seberg/spatch), it…
-
It would be nice to specialize methods on weighted graphs, with weights representing the capacities. In a lot of situations, people who need flow algorithms work with weighted graphs. It also provide …
-
In GitLab by @TiloW on Oct 18, 2016, 13:14
Some requirements are not stated in `test/src/graphalg/planar_test.cpp`. For example, some algorithms require *simple* graphs.
-
Currently using JGraphT's `DijkstraShortestPath` algorithm. However, the WordGraph is a simple, undirected graph, so maybe there are more performant algorithms for such graphs.
-
- The first option (the current one) makes accessing the data easier
- The second option makes working with Graphs.jl algorithms easier
-
Hello all! As my first issue here, I want to thank you for the great library, it is really handy :).
After taking a quick look in `build.sbt`, I haven't seen any particular java dependency. My Scal…