This project implements and compares two fundamental graph traversal algorithms - Breadth-First Search (BFS) and Depth-First Search (DFS) - for finding paths between nodes in a weighted graph. The ...

About I have calculated an "influence score" on an unweighted and weighted graph. I used BFS algorithm for the unweighted graph and Dijkstra's algorithm for the weighted graph.

* For simplicity we dont consider MST for directed graphs. For example, if we want a member of our graph product line to implement Vertex Numbering, we could use either directed or undirected graphs, ...