#data structures and algorithm

[techiemedotin]

Understanding the Heap Datastructure

Understanding the Heap Datastructure

Introduction

Heap(specifically binary heap) is a special data structure which can be viewed as a nearly complete binary tree. This post is mostly focused on understanding the heap datastructure

The first few impressions about heap after reading the above line:

The height of the binary tree would be minimum. For e.g.: if the tree has N nodes, the height would be logN.

The tree can also be stored…

View On WordPress

[techiemedotin]

Adding numbers using Linked Lists

Adding numbers using Linked Lists

Introduction

Adding numbers has always been fascinating and you may think it to be the easiest mathematical operation possible. But believe me many a times that becomes the toughest problem to solve. Let us discuss this in more detail. It is really easy to add two numbers stored in two memory locations. The ALU provides you the option to use the ADD feature and store it on the DATA bus.

This is…

View On WordPress

[techiemedotin]

Shortest Path Using Bellman Ford Algorithm

Shortest Path Using Bellman Ford Algorithm

Introduction

This post about Bellman Ford Algorithm is a continuation of the post Shortest Path Using Dijkstra’s Algorithm. While learning about the Dijkstra’s way, we learnt that it is really efficient an algorithm to find the single source shortest path in any graph provided it has no negative weight edges and no negative weight cycles.

The running time of the Dijkstra’s Algorithm is also…

View On WordPress

[techiemedotin]

Further Reading for Minimum Spanning Tree

Further Reading for Minimum Spanning Tree

Introduction

This is a supplement to the posts for Minimum Spanning Tree and their Analysis. Check out the other related articles in the following section.

Further Reading for Minimum Spanning Tree This section is meant to be read in conjunction to the post Minimum Spanning Tree – Prim’s Algorithm

It is easy to prove that the minimum spanning tree of a Graph is the union of minimum spanning trees…

View On WordPress

[techiemedotin]

Depth First Traversal

Introduction

This is the second post in the Graph Traversals – Online Classes.

I Recommend you to look at the first post Breadth First Traversal as it contains more explanation and details and I will keep this post smaller just around the depth first concept.

Depth First Traversal

The Idea In this traversal, we choose a start vertex and keep moving forward along the length of the graph until there…

View On WordPress

[techiemedotin]

Breadth First Traversal

Introduction

Dear Readers, these set of posts under Graph Traversals will make more sense if you have read the Graph Theory. Here is a quick brush up for the same. However, if you are familiar with Graph Theory and have a basic knowledge of what graphs are and how they are stored, you can dive into the traversals.

Later in the series we will discover that the Graph Traversals are widely used in…

View On WordPress

[techiemedotin]

Graph Operations

Introduction

With some basic concepts we learnt in the previous two articles listed here in Graph Theory, now we have enough tools to discuss some operations on any graph. In this article we will try to define some basic operations on the Graph.

Graph Operations – Extrating sub graphs

In this section we will discuss about various types of sub graphs we can extract from a given Graph.

Sub graph

Ge…

View On WordPress

[techiemedotin]

Tree Diameter

Introduction

A very interesting problem is to find the diameter of a tree. The challenge is not in coding the algorithm but in understanding the meaning of the problem. We will try to define the problem so that visualizing the solution becomes easy.

Defining the problem – Tree Diameter

Few confusions about the diameter must be avoided before we start.

The tree diameter is always the distance…

View On WordPress