Bölüm 4.1 · SimülatörTopological Sort, SCC & Articulation Points? ← Bölüm 4.1 Topological Sort SCC Articulation Points Reset DAG KapatGraph Structure AlgorithmsExplore three graph-structure algorithms on small example graphs. Each button loads its own example graph and runs the algorithm on it.How to useTopological Sort: runs Kahn's algorithm on a directed acyclic graph. The badge on each vertex shows its position in the order.SCC: runs Kosaraju's algorithm on a directed graph; each strongly connected component gets its own color and dashed outline.Articulation Points: runs the DFS low-link method on an undirected graph; cut vertices are highlighted, DFS tree edges are drawn thicker.Reset: shows the DAG without any result.NotesTopological sort applies only to DAGs. Strongly connected components partition directed graphs into maximal mutually reachable groups. Articulation points are vertices whose removal increases the number of connected components in an undirected graph.AlgorithmIdeaTimeKahn (topological sort)Repeatedly remove a vertex with in-degree 0O(V + E)Kosaraju (SCC)DFS finish order, then DFS on the reversed graphO(V + E)Articulation pointsDFS with discovery time and low-link valuesO(V + E)A non-root vertex u is an articulation point if some DFS child v has low[v] ≥ disc[u]; the DFS root is one if it has more than one DFS child.