Start Here
About
▼
▲
Full Archive
The high level overview of all the articles on the site.
About Baeldung
About Baeldung.
Graph Theory
Graphs
DFS (4)
Connected Graphs and Components (4)
Cyclic Graphs (4)
Acyclic Graphs (3)
NP-Complete (2)
BFS (2)
>> Vertex Coloring in Graphs
>> Menger’s Theorem
>> What Is the K-Core of a Graph?
>> Network Flow: Dinic’s Algorithm
>> Finding Strongly Connected Components: Tarjan’s Algorithm
>> Image Processing: Graph-based Segmentation
>> Dominating Sets and Domination Numbers in Graph Theory
>> The Havel-Hakimi Algorithm
>> Node Degrees
>> Graph Theory: What Is Vertex Coloring?
>> What Are Tournament Graphs?
>> What Are Planar Graphs?
>> Finding Strongly Connected Components: Kosaraju’s Algorithm
>> Eccentricity, Radius, Diameter, Center, and Periphery
>> What Are Bridges in a Graph?
>> Practical Applications of Directed Acyclic Graphs
>> Finding the Shortest Cycle in an Undirected Graph
>> Graph Theory: Path vs. Cycle vs. Circuit
>> Graph Adjacency and Incidence
>> Graph Density
>> Induced Subgraphs
>> Weighted vs. Unweighted Graphs
>> Iterative Deepening vs. Depth-First Search
>> Finding Maximum Size Square in a Matrix Filled With Ones
>> Appointment Scheduling Algorithm
>> Obtaining the Path in the Uniform Cost Search Algorithm
>> Finding the Lowest Common Ancestor in a Directed Acyclic Graph
>> Minimum Cut on a Graph Using a Maximum Flow Algorithm
>> What Is an Augmenting Path?
>> Time and Space Complexity of Adjacency Matrix and List
>> Determine Whether Two Nodes in a Graph Are Connected
>> Graphs: Sparse vs Dense
>> Detecting Cycles in a Directed Graph
>> Topological Sort of Directed Acyclic Graph
>> How to Build a Knowledge Graph?
>> Finding Articulation Points of a Graph
>> What Is an Incident Edge?
>> Determine Maximum Number of Edges in a Directed Graph
>> How to Find If a Graph Is Bipartite?
>> What Is the Difference Between a Directed and an Undirected Graph
>> Shortest Path to Certain Nodes in a Graph
>> Determining Whether a Directed or Undirected Graph Is a Tree
>> Finding the Maximum-Minimum Capacity for a Node in a Graph
>> Connected Components in a Graph
>> Cycles in an Undirected Graph
>> Graph Data Structures
↑ Back to Top