Preconditioning - What it is ? Preconditioning is preprocessing step. It would reduce future computation. Preconditioning is particularly useful in problems having several instances involved. Accordin [...]
Connected Components Connected Components in laymen is something that is connected all along. For example, all the states in the country are connected somehow. We can reach from one state to any other [...]
Topological sort is applicable on directed acyclic graphs only. So let us first understand what we mean by the directed acyclic graph. Directed Acyclic Graph A graph is called a Directed Acyclic Graph [...]
DFS vs BFS: DFS vs BFS: DFS stands for Depth-first search. The algorithm starts at the root node and investigates each branch before backtracking. When a dead-end comes in any iteration, it employs a [...]
Breadth First Search: Explained Breadth first search is as widely used as Depth-first search in problem-solving. Concept of Breadth First Search (BFS) algorithm is used in many applications. Prim’s al [...]
Depth First Search is a very useful way of graph traversal in many computer science applications. It uses a stack to traverse the graph. Working Mechanism of Depth First Search In graph traversal tree [...]
Graph Representation Methods Graph representation can be done in using many different ways. We will discuss here two commonly used representations. Adjacency Matrix RepresentationAdjacency List Repres [...]