Missing Unit Tests for Graph Algorithms

[gowtham1412-p]

What would you like to share?

Some graph algorithms (e.g., BFS, DFS, Dijkstra, Bellman–Ford) do not have JUnit test coverage. Create test cases with small sample graphs and expected outputs.

Expected outcome:

Increased test coverage

More reliable algorithm correctness

Additional information

No response