WIP

Author: habedi

README.md

@@ -23,14 +23,14 @@ set of ready-to-use algorithms for graph analysis and mining.
 
 ## Features
 
-| Module                                    | Feature                                                                                                                                                                                     |
-|-------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
-| [**Graphs**](src/graph/types.rs)          | - ✓ Directed and undirected graphs<br>- ✓ Weighted and unweighted graphs                                                                                                                    |
-| [**IO**](src/graph/io.rs)                 | - ✓ Edge list<br>- ✓ Adjacency list<br>- ☐ GraphML<br>- ☐ GML<br>- ☐ JSON                                                                                                                   |
-| [**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                            |
-| [**Graph Traversal**](src/traversal/)     | - ✓ Breadth-first search<br>- ✓ Depth-first search<br>- ✓ Iterative deepening DFS<br>- ✓ Bidirectional search                                                                               |
-| [**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 |
-| **Remaining Modules**                     | - ☐ Minimum spanning tree<br>- ☐ Connected components<br>- ☐ Clustering, partitioning, and community detection<br>- ☐ Centrality<br>- ☐ Graph matching<br>- ☐ Graph visualization           |
+| Module                                    | Feature                                                                                                                                                                                     | Status              | Notes                                                                   |
+|-------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------|-------------------------------------------------------------------------|
+| [**Graphs**](src/graph/types.rs)          | - ✓ Directed and undirected graphs<br>- ✓ Weighted and unweighted graphs                                                                                                                    | Tested, Benchmarked | Core graph types supporting various graph models                        |
+| [**IO**](src/graph/io.rs)                 | - ✓ Edge list<br>- ✓ Adjacency list<br>- ☐ GraphML<br>- ☐ GML<br>- ☐ JSON                                                                                                                   | Tested              | I/O routines for reading/writing graphs in multiple formats             |
+| [**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, Benchmarked | Provides generators for common random and structured graph models       |
+| [**Graph Traversal**](src/traversal/)     | - ✓ Breadth-first search<br>- ✓ Depth-first search<br>- ✓ Iterative deepening DFS<br>- ✓ Bidirectional search                                                                               | Tested              | Traversal algorithms for exploring graph structures                     |
+| [**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, Benchmarked | Algorithms for computing shortest paths across various graph types      |
+| **Remaining Modules**                     | - ☐ Minimum spanning tree<br>- ☐ Connected components<br>- ☐ Clustering, partitioning, and community detection<br>- ☐ Centrality<br>- ☐ Graph matching<br>- ☐ Graph visualization           | Planned             | Future work: additional graph algorithms for analysis and visualization |
 
 ## Installation