Bellman Ford’s Algorithm Bellman Ford algorithm helps us find the shortest path from a vertex to all other vertices of a weighted graph. It is similar to Dijkstra’s algorithm but it can work with graphs in which edges can have negative weights. Why would one ever have edges with negative weights in real life? Negative weight …
DFS Algorithm In this tutorial, you will learn what a DFS algortihm is. Also, you will find working examples of DFS algorithm in C, C++, Java and Python. Traversal means visiting all the nodes of a graph. Depth first traversal or Depth first Search is a recursive algorithm for searching all the vertices of a …
Adjacency List In this tutorial, you will learn what an adjacency list is. Also, you will find working examples of adjacency list in Python. An adjacency list represents a graph as an array of linked lists. The index of the array represents a vertex and each element in its linked list represents the other …
Adjacency Matrix In this tutorial, you will learn what an adjacency matrix is. Also, you will find working examples of adjacency matrix in Python. An adjacency matrix is a way of representing a graph G = {V, E} as a matrix of booleans. Adjacency matrix representation The size of the matrix is VxV where V is the number …
Strongly Connected Components In this tutorial, you will learn how strongly connected components are formed. Also, you will find working examples of kosararju’s algorithm in Python. A strongly connected component is the portion of a directed graph in which there is a path from each vertex to another vertex. It is applicable only on a directed …
Spanning Tree and Minimum Spanning Tree In this tutorial, you will learn about spanning tree and minimum spanning tree with help of examples and figures. Before we learn about spanning trees, we need to understand two graphs: undirected graphs and connected graphs. An undirected graph is a graph in which the edges do not point in …
Graph Data Structure In this tutorial, you will learn what a Graph Data Structure is. Also, you will find representations of a graph. A graph data structure is a collection of nodes that have data and are connected to other nodes. Let’s try to understand this through an example. On facebook, everything is a …
Deletion From a Red-Black Tree In this tutorial, you will learn how a node is deleted from a red-black tree is. Also, you will find working examples of deletions performed on a red-black tree in Python. Red-Black tree is a self-balancing binary search tree in which each node contains an extra bit for denoting …
Insertion in a Red-Black Tree In this tutorial, you will learn how a new node can be inserted into a red-black tree is. Also, you will find working examples of insertions performed on a red-black tree in C, C++, Java and Python. Red-Black tree is a self-balancing binary search tree in which each node …
Red-Black Tree In this tutorial, you will learn what a red-black tree is. Also, you will find working examples of various operations performed on a red-black tree in Python. Red-Black tree is a self-balancing binary search tree in which each node contains an extra bit for denoting the color of the node, either red …