Python Data Structure

Python Data Structure and Algorithm Tutorial – Bellman Ford’s Algorithm

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 …

Python Data Structure and Algorithm Tutorial – Adjacency Matrix

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 …

Python Data Structure and Algorithm Tutorial – Strongly Connected Components

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 …

Python Data Structure and Algorithm Tutorial – Spanning Tree and Minimum Spanning Tree

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 …

Python Data Structure and Algorithm Tutorial – Deletion From a Red-Black Tree

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 …