A stack is a Linear Abstract Data Type (ADT) that follows the LIFO(Last in first out) property. There are two operation which can be performed on stack 1). PUSH 2). POP 1). PUSH operation of Stack PUSH operation of the stack is used to add an item to a stack at the top. We can … Read more
A stack is a fundamental data structure that follows the Last In, First Out (LIFO) principle, meaning the last element added to the stack will be the first one to be removed. It’s like a stack of plates, you add to the top and take from the top. This post will explore how to implement … Read more
Stack can be implemented by both array and linked list. There is some limitation or you can say that drawback in stack implementation using an array is that the array must be declared with some fixed size. In case if the size of the array becomes small to perform the required operation so this is … Read more
A stack is a linear data structure in which the elements are added and removed only from one end, which is called the TOP. Hence, a stack is also called a LIFO (Last-In-First-Out) or FILO(First In Last Out) data structure, which means the element that was inserted last is the first one to be taken … Read more
Dijkstra’s algorithm, given by a brilliant Dutch computer scientist and software engineer Dr. Edsger Dijkstra in 1959. Dijkstra’s algorithm is a greedy algorithm that solves the single-source shortest path problem for a directed and undirected graph that has non-negative edge weight. For Graph G = (V, E)w (u, v) ≥ 0 for each edge (u, … Read more
Kruskal’s Algorithm follows the Greedy Algorithm to construct a Minimum Spanning Tree for a connected, weighted, and undirected graph. This algorithm treats the graph as a forest and its vertices as an individual tree. The aim of this algorithm is to find a subset of the edges that forms a tree that includes every vertex … Read more
Prim’s algorithm uses the greedy approach to find a minimum cost spanning tree for a connected weighted undirected graph. The algorithm builds a tree that includes all vertex and a subset of the edges in such a way that the sum of all the edges weight in the tree is minimum. The major approach for … Read more
What is Spanning Tree? A spanning tree of a graph G is a subgraph of G that is a tree that includes all of the vertices of G and a minimum number of edges. A spanning tree does not contain any cycles and all the vertices should be connected. For every connected and undirected graph … Read more
Depth First Search (DFS) Depth First Search (DFS) algorithm traverses a graph in a depthward motion and uses a stack data structure to remember to get the next vertex to start a search when a dead end occurs in any iteration. Breadth First Search (BFS) Difference between BFS and DFS Breadth-First Search (BFS) Depth First … Read more