WIP

Author: habedi

README.md

@@ -33,7 +33,7 @@ ready-to-use algorithms for network analysis and graph mining tasks.
 | [**Core/Paths**](src/core/paths.rs)                  | - ✓ 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 paths algorithms                                 |
 | [**Traversal**](src/traversal/)                      | - ✓ Breadth-first search<br>- ✓ Depth-first search<br>- ✓ Iterative deepening DFS<br>- ✓ Bidirectional search                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              | - ☐ Tested<br>- ☐ Benchmarked | Graph traversal algorithms                                |
 | [**Centrality**](src/centrality/algorithms.rs)       | - ✓ Degree centrality<br>- ✓ Closeness centrality<br>- ✓ Betweenness centrality<br>- ✓ Eigenvector centrality<br>- ✓ PageRank<br>- ✓ Katz centrality<br>- ✓ Harmonic centrality<br>- ✓ Local/global reaching centrality<br>- ✓ VoteRank<br>- ✓ Laplacian centrality                                                                                                                                                                                                                                                                                                                                        | - ☐ Tested<br>- ☐ Benchmarked | Centrality measures                                       |
-| [**Links**](src/links/algorithms.rs)                 | - ✓ Resource Allocation Index<br>- ✓ Jaccard Coefficient<br>- ✓ Adamic–Adar Index<br>- ✓ Preferential Attachment<br>- ✓ CN Soundarajan–Hopcroft<br>- ✓ RA Index Soundarajan–Hopcroft<br>- ✓ Within–Inter Cluster Ratio<br>- ✓ Common Neighbor Centrality                                                                                                                                                                                                                                                                                                                                                   | - ☐ Tested<br>- ☐ Benchmarked | Link prediction algorithms                                |
+| [**Links**](src/links/algorithms.rs)                 | - ✓ Resource allocation index<br>- ✓ Jaccard coefficient<br>- ✓ Adamic–Adar index<br>- ✓ Preferential attachment<br>- ✓ CN Soundarajan–Hopcroft<br>- ✓ RA Index Soundarajan–Hopcroft<br>- ✓ Within–inter cluster ratio<br>- ✓ Common neighbor centrality                                                                                                                                                                                                                                                                                                                                                   | - ☐ Tested<br>- ☐ Benchmarked | Link prediction algorithms                                |
 | [**MST**](src/mst/algorithms.rs)                     | - ✓ Borůvka’s algorithm<br>- ✓ Kruskal’s algorithm<br>- ✓ Prim’s algorithm                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                 | - ☐ Tested<br>- ☐ Benchmarked | Minimum spanning tree algorithms                          |
 | [**Community**](src/community/algorithms.rs)         | - ✓ Label Propagation<br>- ✓ Louvain Method<br>- ✓ Girvan–Newman algorithm<br>- ✓ Spectral Clustering<br>- ✓ Personalized PageRank<br>- ✓ Infomap<br>- ✓ Connected components                                                                                                                                                                                                                                                                                                                                                                                                                              | - ☐ Tested<br>- ☐ Benchmarked | Community detection and clustering algorithms             |
 | [**Approximation**](src/approximation/algorithms.rs) | - ✓ Local node connectivity (BFS-based)<br>- ✓ Maximum independent set (greedy with neighbor caching)<br>- ✓ Maximum clique (greedy heuristic)<br>- ✓ Clique removal<br>- ✓ Large clique size<br>- ✓ Average clustering coefficient<br>- ✓ Densest subgraph (greedy peeling)<br>- ✓ Diameter lower bound<br>- ✓ Minimum weighted vertex cover (greedy re‑evaluated)<br>- ✓ Minimum maximal matching (greedy)<br>- ✓ Approximate Ramsey R2<br>- ✓ TSP approximations (greedy, simulated annealing, threshold accepting, Christofides placeholder)<br>- ✓ Treewidth decompositions (min degree, min fill-in) | - ☐ Tested<br>- ☐ Benchmarked | Approximations and heuristic methods for NP‑hard problems |