Trees

Depth First Search¶ Depth First Search is one of the main graph algorithms. Depth First Search finds the lexicographical first path in the graph f...

Breadth-first search¶ Breadth first search is one of the basic and essential searching algorithms on graphs. As a result of how the algorithm work...

You are given a directed or undirected weighted graph with   $n$  vertices and   $m$  edges. The weights of all edges are non-negative. You are also...

Floyd-Warshall Algorithm¶ Given a directed or an undirected weighted graph   $G$  with   $n$  vertices. The task is to find the length of the short...

Disjoint Set Union¶ This article discusses the data structure Disjoint Set Union or DSU. Often it is also called Union Find because of its two main o...