Current algorithms planned for implementation

[miratepuffin]

Currently have several algorithms planned for implementation - as they get grabbed out of this list we can make a separate ticket for them and ref back here.

Vertex-specific algorithms:

• [x] Single source shortest path
• [x] In components
• [x] out components
• [ ] Node redundancy
• [ ] Max flow
• [ ] Time respecting shortest path
• [ ] Edge independent paths (connectivity)
• [ ] Node independent paths (Connectivity)
• [ ] Local K-cliques

Global graph algorithms:

• [x] Temporal Connected Components (temporal reachability)
• [ ] Eigen Centrality
• [ ] Maximum Quasi-Cliques
• [ ] Graph Diameter
• [x] Strongly Connected Components
• [x] Degree Centrality
• [ ] Katz Centrality
• [ ] Closeness Centrality
• [x] Betweenness Centrality
• [ ] Random Walks + Graph embeddings
• [ ] Random-walk betweenness
• [ ] Graph Colouring
• [ ] Cycle inference (temporal + non)
• [ ] Cycle detection (temporal + non)
• [ ] K-cliques
• [ ] K-Core
• [ ] Bicomponents
• [ ] Tricomponents