How prabhas-koppireddy/striversgraphseries works
This repository is a collection of graph-algorithm implementations, with C++ and Java variants and separate folders for several algorithm families. The principal conceptual workflow is to apply a graph algorithm to a graph and obtain a traversal, classification, connectivity result, or path/tree result. The tree identifies the implementations but provides no README or source excerpts, so it does not establish runtime entry points, calls, or data flow; those relationships are therefore not drawn.
Components 34
Graph Representations
- C++ Adjacency List
C++AdjacencyListRepresentation - C++ Adjacency Matrix
C++AdjacencyMatrixRepresentation - Java Adjacency List
JavaAdjacenyListRepresentation - Java Adjacency Matrix
JavaAdjacenyMatrixRepresentation
Traversal and Ordering
- BFS C++
BfsCpp - BFS Java
BfsJava - Graph BFS Java
bfsGraphJava - DFS C++
DfsCpp - DFS Java
DfsJava - Topological Sort C++
topoSortCpp - Topological BFS C++
topoSortCppBFS - Topological Sort Java
topoSortJava - Topological BFS Java
topoSortJavaBfs
Graph Properties
- Directed Cycle BFS C++
checkCycleDGBFSCpp - Directed Cycle BFS Java
checkCycleDGBFSJava - Directed Cycle DFS C++
cycleCheckDGDfs - Directed Cycle DFS Java
cycleCheckDGDfsJava - Undirected Cycle BFS C++
cycleCheckUGBfs - Undirected Cycle BFS Java
cycleCheckUGBfsJava - Undirected Cycle DFS C++
cycleCheckUGDfs - Undirected Cycle DFS Java
cycleCheckUGDfsJava
Connectivity and Coloring
- Articulation Points C++
articulationCpp - Articulation Points Java
articulationJava - Bridges C++
bridgesCpp - Bridges Java
bridgesJava - Bipartite BFS C++
bipartiteGraphCppBfs - Bipartite DFS C++
bipartiteGraphCppDfs - Bipartite BFS Java
bipartiteGraphJavaBfs - Bipartite DFS Java
bipartiteGraphJavaDfs - Kosaraju C++
kosarajuCpp - Kosaraju Java
kosaRajuJava - M-Coloring C++
mcoloringgraphCpp - M-Coloring Java
mcoloringgraphJava
Spanning Trees and Paths
- Kruskal C++
KruskalAlgorithmCpp