algorithmproblemruntimeNotesDFS to find path in a directed graphFind path in a directed graphNot shortestDFS to find path in an undirected graphFind path in undirected graphNot shortestDFS to find connected components in an undirected graphFind connected components in a undirected graphBFSFind path in undirected graph/Find path in a directed graphShortest unweightedDijkstra’s algorithmFind path in undirected graph/Find path in a directed graphshortest weighted, positive weights only, from sourceBellman-Ford algorithmFind path in undirected graph/Find path in a directed graphshortest weighted, from source, detects negative cyclesFloyd-Warshall algorithmFind path in undirected graph/Find path in a directed graphshortest weighted, all nodes, detects negative cyclesDFS for finding strongly connected componentsFind strongly connected components for an undirected graphOutputs them with topologically sortKruskal’s algorithmMSTPrim’s algorithmMSTFord-Fulkerson Algorithmmax flow being the max flowInteger weightsEdmonds-Karp algorithmmax flow2-SAT algorithm using SCC2-SAT