Skip to content

Instantly share code, notes, and snippets.

View simonschoelly's full-sized avatar

Simon Schölly simonschoelly

View GitHub Profile
@simonschoelly
simonschoelly / reviewd.md
Last active March 18, 2020 17:38
Review Pr 1332
  • .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
- [ ] .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
@simonschoelly
simonschoelly / gist:2712ea2004be2ba70a7853fc21cda68c
Created March 23, 2019 15:31
Ideas for graph planarity algorithms
# 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
@simonschoelly
simonschoelly / gist:be875ace40ce6852d590beb404b81e59
Created January 26, 2019 17:55
List of exported LightGraph symbols that do not have Examples
AbstractEdge
AbstractEdgeIter
AbstractGraph
BarbellGraph
BinaryTree
BoundedMinkowskiCost
CircularLadderGraph
CliqueGraph
CompleteBipartiteGraph
CompleteDiGraph
@simonschoelly
simonschoelly / JuliaGraphs_GSOC.md
Last active February 15, 2019 14:28
# Ideas for JuliaGraphs GSOC 2019

Ideas for JuliaGraphs GSOC 2019

Planarity algorithms for LightGraphs.jl

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.

GraphBlas Impementation

  • Getting the GraphBlas C API working from Julia
@simonschoelly
simonschoelly / gist:3c2809994b1a8ce87334b87ab90b4c73
Last active November 9, 2018 11:01
List of JuliaGraphs repositories that need to be upgraded for Julia version 0.7 and 1.0
Ok:
- LightGraphs
- SimpleWeightedGraphs
- MetaGraphs
- SNAPDatasets
- StaticGraphs
- Graph500
- GraphIO
- GraphPlot
- CommunityDetection