turn list of graph algorithms into issues with progress tracking

[jexp]

create card for each algorithm track progress in

also note findings, links, ideas from research / reading in each card and also limitations of the current implementation / alternatives

• [ ] started work / paper reading

• [ ] implement baseline

• [ ] implement procedure

• [ ] test baseline

• [ ] performance test baseline

• [ ] edge case tests

• [ ] parallelization

• [ ] performance test parallelization

• [ ] documentation

• [ ] different APIs / memory structures

• Implementation of the selected algorithms and exposed them as a Java API and Java Stored Procedure

  • PageRank
  • Label Propagation
  • Louvain
  • Betweenness Centrality
  • Closeness Centrality
  • Degree Centrality
  • Single Shortest Path
  • Strongly, Weakly connected components
  • Parallel BFS / DFS

• Evaluation

  • Performance Tests (different dataset sizes, regressions, level of concurrency)
  • Performance comparison with other implementations (Spark/Flink/Graphlytic) on same dataset and same level of concurrency
  • Review existing implementations for its functional correctness and performance:
    • A*
    • Dijkstra
    • Shortest Path

issues created

• [x] PageRank
• [x] Label Propagation
• [x] Betweenness Centrality
• [x] Closeness Centrality
• [x] Single Shortest Path
• [x] Strongly connected components
• [x] Weakly connected components
• [x] Minimum Spanning Tree
• [x] Connected Components
• [ ] Parallel BFS / DFS

---

• [ ] Louvain
• [ ] k-means (for top-n)
• [ ] edge betweenness
• [ ] Bellman-Ford algorithm
• [ ] Floyd-Warshall algorithm
• [ ] Degree Centrality
• [ ] Eigenvector Centrality
• [ ] approximation of the Chromatic Number of a graph
• [ ] approximation of Hamiltonian cycle
• [ ] min cut
• [ ] community detection: Walk trap, infomap
• [ ] graph metrics

[jexp]

Added a few algorithms from an APOC issue