Graph data structure tutorial 9. Euler 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…
Graph data structure tutorial 8. Isomorphic Graph
Introduction to Isomorphic Graph and understanding with example In this chapter we shall learn about Isomorphic Graph with example.…
Graph data structure tutorial 7. Graph colouring problem
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…
Graph data structure tutorial 6. Bipartite graph
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…
Graph data structure tutorial 5. Graph Traversal using Stack and Queue
In previous chapter we learnt about graph traversal in general. In this chapter we shall learn how to do graph traversal using Stack and…
Graph data structure tutorial 4. Graph Traversal
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…
Graph data structure tutorial 3. Graph Representation Adjacency List
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…
Graph data structure tutorial 2. Graph Representation Adjacency Matrix
In this chapter we shall learn about: 2.1 Introduction 2.2 Understanding of Graph Representation adjacency matrix with an example 2.3…
Graph data structure tutorial 1. Graph Introduction
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…
Tree data structure tutorial 14. Fenwick trees and implementation
In this tutorial we shall learn to perform 1. Get range sum 2. Update range by using Fenwick tree. Problem Statement: Given an array you need…