algorithms Directory Reference

Files
	bfs.h
	Implements breadth-first search (BFS) algorithms for graph traversal and pathfinding.
	dfs.h
	Implements depth-first search (DFS) algorithms for graph traversal and pathfinding.
	dijkstra.h
	kruskal.h
	Implements Kruskal's algorithm to compute the Minimum Spanning Tree (MST) of a weighted undirected graph.
	prim.h
	Implements Prim's algorithm to compute the Minimum Spanning Tree (MST) of a weighted undirected graph.
	tarjan.h
	Implements Tarjan's algorithm for finding strongly connected components (SCCs) in a directed graph.