[EVOL]: add graph dsa & metrics

[helabenkhalfallah]

dsa-toolbox/
├── graphs/                  # Graph-related algorithms, data structures
│   ├── graph-types/         # Graph types (General and Specialized)
│   │   ├── general-graphs/  # DAG, Undirected, Weighted, Cyclic, Bipartite
│   │   │   ├── Dag.js
│   │   │   ├── Undirected.js
│   │   │   ├── Weighted.js
│   │   │   ├── Cyclic.js
│   │   │   └── Bipartite.js
│   │   ├── specialized-graphs/  # Tasks, AST
│   │   │   ├── Tasks.js
│   │   │   └── Ast.js
│   ├── algorithms/          # Graph algorithms
│   │   ├── pathfinding-algorithms/ # Dijkstra's, Bellman-Ford, Floyd-Warshall
│   │   │   ├── Dijkstra.js
│   │   │   ├── BellmanFord.js
│   │   │   └── FloydWarshall.js
│   │   ├── graph-traversal-search-algorithms/ # BFS, DFS, Topological Sort, A* Search
│   │   │   ├── Bfs.js
│   │   │   ├── Dfs.js
│   │   │   ├── TopologicalSort.js
│   │   │   └── AStarSearch.js
│   │   ├── component-detection-algorithms/  # Kosaraju’s, Tarjan’s
│   │   │   ├── Kosaraju.js
│   │   │   └── Tarjan.js
│   │   ├── community-detection-algorithms/  # Louvain, Newman
│   │   │   ├── Louvain.js
│   │   │   └── Newman.js
│   │   ├── cycle-detection-algorithms/  # Cycle Detection (DFS or Tarjan)
│   │   │   ├── CycleDetection.js
│   ├── data-structures/      # Graph representations
│   │   ├── graph-representation/ # Adjacency List, Adjacency Matrix, Edge List
│   │   │   ├── AdjacencyList.js
│   │   │   ├── AdjacencyMatrix.js
│   │   │   └── EdgeList.js
│   ├── utils/                # Utility functions for graph analysis
│   │   ├── graph-utils/      # General graph utility functions
│   │   │   ├── Density.js    # Graph density calculation
│   │   │   ├── Sparsity.js   # Graph sparsity calculation
│   │   │   └── Centrality.js # Node centrality calculation
└── utils/                   # Other utility functions

More informations:
https://itnext.io/graph-theory-and-its-applications-what-can-graphs-do-for-your-software-9a746db6658c