Topological Sorting
Topological sorting is an algorithmic technique that produces a linear ordering of the vertices of a directed acyclic graph (DAG) such that for every directed edge from vertex u to vertex v, u appears before v in the ordering.
7 resources across 1 library
Glossary Terms(7)
Bellman-Ford Algorithm
The Bellman-Ford algorithm is a graph algorithm that computes the shortest paths from a single source vertex to all other vertices in a weighted graph, correct…
Floyd-Warshall Algorithm
The Floyd-Warshall algorithm is a dynamic-programming algorithm that computes the shortest paths between all pairs of vertices in a weighted graph, including g…
Topological Sorting
Topological sorting is an algorithmic technique that produces a linear ordering of the vertices of a directed acyclic graph (DAG) such that for every directed…
Strongly Connected Components
Strongly connected components (SCCs) are maximal subsets of vertices in a directed graph such that every vertex in the subset is reachable from every other ver…
Articulation Points
An articulation point (or cut vertex) is a vertex in an undirected graph whose removal increases the number of connected components, meaning the vertex is crit…
Eulerian Path
An Eulerian path is a walk through a graph that visits every edge exactly once, and an Eulerian circuit is an Eulerian path that additionally starts and ends a…
Hamiltonian Path
A Hamiltonian path is a path through a graph that visits every vertex exactly once, and a Hamiltonian cycle is a Hamiltonian path that additionally returns to…