@@ -23,16 +23,16 @@ set of ready-to-use algorithms for graph analysis and mining.
2323
2424## Features
2525
26- | Module | Feature | Status | Notes |
27- | ----------------------------------------------------| ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| -------------------------------| ---------------------------------------------|
28- | [ ** Types** ] ( src/graph/types.rs ) | - ✓ Directed and undirected graphs<br >- ✓ Weighted and unweighted graphs | - ☐ Tested<br >- ☐ Benchmarked | Core graph types |
29- | [ ** IO** ] ( src/graph/io.rs ) | - ✓ Edge list<br >- ✓ Adjacency list<br >- ☐ GraphML<br >- ☐ GML<br >- ☐ JSON | - ☐ Tested<br >- ☐ Benchmarked | I/O routines for reading/writing graph data |
30- | [ ** Generators** ] ( src/graph/generators.rs ) | - ✓ Erdős–Rényi graph<br >- ✓ Watts–Strogatz graph<br >- ✓ Barabási–Albert graph<br >- ✓ Complete graph<br >- ✓ Bipartite graph<br >- ✓ Star graph<br >- ✓ Cycle graph | - ☐ Tested<br >- ☐ Benchmarked | Generators for random and structured graphs |
31- | [ ** Graph Traversal** ] ( src/traversal/ ) | - ✓ Breadth-first search<br >- ✓ Depth-first search<br >- ✓ Iterative deepening DFS<br >- ✓ Bidirectional search | - ☐ Tested<br >- ☐ Benchmarked | Graph traversal algorithms |
32- | [ ** Shortest Paths** ] ( src/paths/ ) | - ✓ Dijkstra's algorithm<br >- ✓ Bellman–Ford algorithm<br >- ✓ Floyd–Warshall algorithm<br >- ✓ Johnson's algorithm<br >- ✓ A* search algorithm<br >- ✓ Iterative deepening A* search algorithm | - ☐ Tested<br >- ☐ Benchmarked | Shortest path algorithms |
33- | [ ** Centrality** ] ( src/centrality/algorithms.rs ) | - ✓ Degree centrality<br >- ✓ Closeness centrality<br >- ✓ Betweenness centrality<br >- ✓ Eigenvector centrality<br >- ✓ PageRank<br >- ✓ Katz centrality<br >- ✓ Harmonic centrality | - ☐ Tested<br >- ☐ Benchmarked | Centrality measures for graph analysis |
34- | [ ** Minimum Spanning Tree** ] ( src/mst/algorithms.rs ) | - ✓ Borůvka’s algorithm<br >- ✓ Kruskal’s algorithm<br >- ✓ Prim’s algorithm | - ☐ Tested<br >- ☐ Benchmarked | MST algorithms for undirected graphs |
35- | ** Remaining Modules** | - ☐ Connected components<br >- ☐ Clustering, partitioning, and community detection<br >- ☐ Graph matching<br >- ☐ Graph visualization | Planned | Future work: additional graph algorithms |
26+ | Module | Feature | Status | Notes |
27+ | ----------------------------------------------------| ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| ---------------------------------------------- | ------ ---------------------------------------------|
28+ | [ ** Types** ] ( src/graph/types.rs ) | - ✓ Directed and undirected graphs<br >- ✓ Weighted and unweighted graphs | < small > - ☐ Tested<br >- ☐ Benchmarked</ small > | Core graph types |
29+ | [ ** IO** ] ( src/graph/io.rs ) | - ✓ Edge list<br >- ✓ Adjacency list<br >- ☐ GraphML<br >- ☐ GML<br >- ☐ JSON | < small > - ☐ Tested<br >- ☐ Benchmarked</ small > | I/O routines for reading/writing graph data |
30+ | [ ** Generators** ] ( src/graph/generators.rs ) | - ✓ Erdős–Rényi graph<br >- ✓ Watts–Strogatz graph<br >- ✓ Barabási–Albert graph<br >- ✓ Complete graph<br >- ✓ Bipartite graph<br >- ✓ Star graph<br >- ✓ Cycle graph | < small > - ☐ Tested<br >- ☐ Benchmarked</ small > | Generators for random and structured graph models |
31+ | [ ** Graph Traversal** ] ( src/traversal/ ) | - ✓ Breadth-first search<br >- ✓ Depth-first search<br >- ✓ Iterative deepening DFS<br >- ✓ Bidirectional search | < small > - ☐ Tested<br >- ☐ Benchmarked</ small > | Graph traversal algorithms |
32+ | [ ** Shortest Paths** ] ( src/paths/ ) | - ✓ Dijkstra's algorithm<br >- ✓ Bellman–Ford algorithm<br >- ✓ Floyd–Warshall algorithm<br >- ✓ Johnson's algorithm<br >- ✓ A* search algorithm<br >- ✓ Iterative deepening A* search algorithm | < small > - ☐ Tested<br >- ☐ Benchmarked</ small > | Shortest path algorithms |
33+ | [ ** Centrality** ] ( src/centrality/algorithms.rs ) | - ✓ Degree centrality<br >- ✓ Closeness centrality<br >- ✓ Betweenness centrality<br >- ✓ Eigenvector centrality<br >- ✓ PageRank<br >- ✓ Katz centrality<br >- ✓ Harmonic centrality | < small > - ☐ Tested<br >- ☐ Benchmarked</ small > | Centrality measures for graph analysis |
34+ | [ ** Minimum Spanning Tree** ] ( src/mst/algorithms.rs ) | - ✓ Borůvka’s algorithm<br >- ✓ Kruskal’s algorithm<br >- ✓ Prim’s algorithm | < small > - ☐ Tested<br >- ☐ Benchmarked</ small > | MST algorithms for undirected graphs |
35+ | ** Remaining Modules** | - ☐ Connected components<br >- ☐ Clustering, partitioning, and community detection<br >- ☐ Graph matching<br >- ☐ Graph visualization | Planned | Future work: additional graph algorithms |
3636
3737## Installation
3838
0 commit comments