DataStructure and Algorithms

In this tutorial we shall learn about Hamiltonian graph. Definition: A graph that contains Hamiltonian circuit is called as Hamiltonian graph.…

Definition: A graph having Euler Path is called as Euler graph.  Sometimes Euler path is also called as Euler Circuit. So, what is Euler path…

Introduction to Isomorphic Graph and understanding with example In this chapter we shall learn about Isomorphic Graph with example.…

In this tutorial we shall learn about 2 Colour Graph Problem In general graph colouring or edge colouring problem we need to assign colour to…

In this tutorial we shall learn about bipartite graph. Definition: A graph G(V, E) is called as bipartite graph if all the vertices (V) can be…

In previous chapter we learnt about graph traversal in general. In this chapter we shall learn how to do graph traversal using Stack and…

In the previous chapter we learnt about tree traversal. In this chapter we shall learn about graph traversal. Graph traversal can be done in 2…

In this chapter we shall learn about: 3.1 Introduction 3.2 Representation in Linked List 3.3 Now why do we use Linked List to represent…

In this chapter we shall learn about: 2.1 Introduction 2.2 Understanding of Graph Representation adjacency matrix with an example 2.3…

In this chapter we shall learn about: 1.1 Graph Definition 1.2 Types of graph 1.3 Usage of graph 1.1 Graph Definition Graph like trees is a…