This contanis all the basic stuff , how to make graph by adjcency list as well as adjancey matrix , Bfs , Dfs , prims , kruskal algorithms , It conatins application of Dfs as well. Dijkstra’s implementation Tree traversal interative way all in one algo checking connected components Binary search tree Graph Coloring
Try Different algorithms which are not available in repo. Only use header file or c++ for contribution.