- .travis.yml
- src/Experimental/Experimental.jl
- src/LightGraphs.jl
- src/Parallel/Parallel.jl
- src/Parallel/shortestpaths/deprecated.jl
- src/Parallel/shortestpaths/dijkstra.jl
- src/Parallel/shortestpaths/johnson.jl
- src/ShortestPaths/ShortestPaths.jl
- src/ShortestPaths/astar.jl
- src/ShortestPaths/bellman-ford.jl
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
- [ ] .travis.yml | |
- [ ] src/Experimental/Experimental.jl | |
- [ ] src/LightGraphs.jl | |
- [ ] src/Parallel/Parallel.jl | |
- [ ] src/Parallel/shortestpaths/deprecated.jl | |
- [ ] src/Parallel/shortestpaths/dijkstra.jl | |
- [ ] src/Parallel/shortestpaths/johnson.jl | |
- [ ] src/ShortestPaths/ShortestPaths.jl | |
- [ ] src/ShortestPaths/astar.jl | |
- [ ] src/ShortestPaths/bellman-ford.jl |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Ideas for graph planarity algorithms | |
* An algorithm for deciding if a graph is planar / maximal planar / outer plannar | |
* Computing a combinatorial embedding of a planar graph | |
* Computing a drawing of a planar graph (this part might then be put into GraphPlot,jl instead) | |
* Planar graphs can be stored as halfedge/decl data structures. There are already Julia packages that contain | |
such a datastructure, but these do not have an interface to LightGraphs. Might be interesting to either create a new package | |
that uses the LightGraphs package, or create a bridge to existing ones. | |
* There are related concepts, such as embeddings on other topological structures or graphs where only a fraction of the | |
edges may intersect - algorithm for these things might be NP-hard though |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
AbstractEdge | |
AbstractEdgeIter | |
AbstractGraph | |
BarbellGraph | |
BinaryTree | |
BoundedMinkowskiCost | |
CircularLadderGraph | |
CliqueGraph | |
CompleteBipartiteGraph | |
CompleteDiGraph |
At the momentent, LightGraphs.jl lacks algorithms that deal with graph planarity and familiar concepts. A candidate should study the literature and implement some algorithms that deal with planarity. Potential thins that could be done:
- Implementation of a tests for planarity and outer planarity
- Calculating a planar embedding of a graph
- There are some graph problems that have a much faster solution when a graph is planar.
- Getting the GraphBlas C API working from Julia
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Ok: | |
- LightGraphs | |
- SimpleWeightedGraphs | |
- MetaGraphs | |
- SNAPDatasets | |
- StaticGraphs | |
- Graph500 | |
- GraphIO | |
- GraphPlot | |
- CommunityDetection |