Graph algorithms covering traversal, shortest paths, minimum spanning trees, and advanced topics.
- Graph representations (adjacency list, matrix)
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Shortest path algorithms (Dijkstra, Bellman-Ford)
- Minimum Spanning Tree (MST) - Kruskal's, Prim's
- Cycle detection (directed & undirected)
- Topological sorting
- Bipartite graph checking
- Articulation points and bridges
- Connected components
- graphs_basics - Graph fundamentals
- graphs_build_adjacency_list_matrix - Graph representations
- graph_bipartie - Bipartite graph detection
- graph_check_biparte - Check if bipartite
- biprtiteGraph - Bipartite graph
- graph_edgestobipartie - Edges to make bipartite
- coloringGraph - Graph coloring
- graph_cycledetectiondirectedgraph - Cycle in directed graph
- graphs_cycleindirectedgraph - Cycle detection (directed)
- graph_cycle_undirected_dfs - Cycle in undirected graph
- cycleInGraph - Cycle in graph
- graph_cycle_bell_men_ford - Negative cycle (Bellman-Ford)
- graphs_bellmanford - Bellman-Ford algorithm
- graph_kruskal - Kruskal's MST algorithm
- graph_prims_mst - Prim's MST algorithm
- graph_connecting_island_mst - Connecting islands MST
- graph_construction_cost_mst - Construction cost MST
- graph_damagedroad_mst - Damaged road MST
- graph_damagedroads_prims_mst - Damaged roads Prim's
- graph_mstedges - MST edges
- CommutableIslands - Commutable islands MST
- graph_toplogical_sort - Topological sort
- graph_topo_sort - Topological sorting
- topologicalSort2 - Topological sort variant 2
- topologySort - Topology sort
- graphs_course_problem - Course prerequisite problem
- PossibilityOfFinshing - Possibility of finishing courses
- graphs_articulation_point - Find articulation points
- graphs_articulation_point_dfs - Articulation points DFS
- graphs_bridges_dfs - Find bridges in graph
- graphs_diameterofbridge - Diameter of bridge
- graphs_count_islands - Island counting
- graph_count_islands2 - Count islands variant
- NoOfislands - Number of islands
- graphs_rottenorange - Rotten oranges (multi-source BFS)
- rottenOrange - Rotten orange problem
- dijkstra - Dijkstra's algorithm
- graph_short_distance_path - Shortest distance path
- graph_lenghtofshortpath - Length of shortest path
- graph_min_distance_undire - Min distance undirected
- graphs_multiplesourcesdistance - Multiple sources distance
- MultiSourceLevel - Multi-source level
- DistanceBwNodes - Distance between nodes
- graph_pathindirectedgraph - Path in directed graph
- PathInDirectedGraph - Path in directed graph
- graph_get_path_parenttable - Get path using parent table
- graph_valid_path - Valid path checking
- graph_dfs_connectiedtowns - Connected towns DFS
- graph_dfs_ifconnected - Check if connected
- graph_count_components - Count connected components
- checkDistintionformSource - Check distinction from source
- graphs_disc_end_time_dfs - Discovery/end time DFS
- graph_ifnodevisited - Check if node visited
- graph_construct_roads - Construct roads
- graph_petrolbunkblast - Petrol bunk blast
- graph_batchs2 - Batches problem 2
- graphs_batchs - Batches problem
- AggressiveCows - Aggressive cows (binary search on graph)
- AggresiveCows2 - Aggressive cows variant
- ShaggyandDistances - Shaggy and distances
- trie_arrays - Trie with arrays
- unorderedmaps - Unordered maps in graphs
- SocketProgramming - Socket programming
- Choose the right representation for the problem
- DFS for connectivity, paths, cycles
- BFS for shortest paths in unweighted graphs
- Use visited array to avoid infinite loops
- Practice both recursive and iterative DFS