Algorithm Category · Graphs

Graphs Suite.

BFS, DFS, Dijkstra shortest path, topological sorting, and minimum spanning trees.

Module Under Active Development

Graphs Visualizers Coming Soon

We are actively building the Graphs interactive laboratory with theGnaN Visual Learning Language (GVLL). Review the planned curriculum and algorithmic structures below.

Try Selection Sort (Live)

Curriculum Roadmap

Planned Graphs Modules (5)

In Production

#1Coming Soon

Breadth-First Search (BFS)

Queue-driven level-by-level graph exploration.

Time (Avg):O(V + E)

Time (Worst):O(V + E)

Space:O(V)

#2Coming Soon

Depth-First Search (DFS)

Recursive branch exploration and cycle detection.

Time (Avg):O(V + E)

Time (Worst):O(V + E)

Space:O(V)

#3Coming Soon

Dijkstra's Algorithm

Greedy shortest-path solver on non-negative weighted graphs.

Time (Avg):O((V + E) log V)

Time (Worst):O((V + E) log V)

Space:O(V)

#4Coming Soon

Topological Sort

Dependency resolution order in DAGs.

Time (Avg):O(V + E)

Time (Worst):O(V + E)

Space:O(V)

#5Coming Soon

Kruskal's MST Algorithm

Greedy edge selection with Disjoint Set Union.

Time (Avg):O(E log E)

Time (Worst):O(E log E)

Space:O(V + E)