Implementing Generic Graph in Java

Last Updated : 20 Apr, 2024

We can also use them to code for Graph in Java. The Graph class is implemented using HashMap in Java. As we know HashMap contains a key and a value, we represent nodes as keys and their adjacency list in values in the graph.

Illustration: An undirected and unweighted graph with 5 vertices.

Adjacency Matrix is as follows:

Adjacency List is as follows:

Approach:

Just unlikely in C++, we use <> to specify parameter types in generic class creation.

Syntax: To create objects of a generic class

BaseType <Type> obj = new BaseType <Type>()

Note: In Parameter type, we cannot use primitives like 'int', 'char', or 'double'.

Example

Java

// Java program to implement Graph
// with the help of Generics

import java.util.*;

class Graph<T> {

    // We use Hashmap to store the edges in the graph
    private Map<T, List<T> > map = new HashMap<>();

    // This function adds a new vertex to the graph
    public void addVertex(T s)
    {
        map.put(s, new LinkedList<T>());
    }

    // This function adds the edge
    // between source to destination
    public void addEdge(T source, T destination,
                        boolean bidirectional)
    {

        if (!map.containsKey(source))
            addVertex(source);

        if (!map.containsKey(destination))
            addVertex(destination);

        map.get(source).add(destination);
        if (bidirectional == true) {
            map.get(destination).add(source);
        }
    }

    // This function gives the count of vertices
    public void getVertexCount()
    {
        System.out.println("The graph has "
                           + map.keySet().size()
                           + " vertex");
    }

    // This function gives the count of edges
    public void getEdgesCount(boolean bidirection)
    {
        int count = 0;
        for (T v : map.keySet()) {
            count += map.get(v).size();
        }
        if (bidirection == true) {
            count = count / 2;
        }
        System.out.println("The graph has " + count
                           + " edges.");
    }

    // This function gives whether
    // a vertex is present or not.
    public void hasVertex(T s)
    {
        if (map.containsKey(s)) {
            System.out.println("The graph contains " + s
                               + " as a vertex.");
        }
        else {
            System.out.println("The graph does not contain "
                               + s + " as a vertex.");
        }
    }

    // This function gives whether an edge is present or
    // not.
    public void hasEdge(T s, T d)
    {
        if (map.get(s).contains(d)) {
            System.out.println(
                "The graph has an edge between " + s
                + " and " + d + ".");
        }
        else {
            System.out.println(
                "The graph has no edge between " + s
                + " and " + d + ".");
        }
    }
  
      public void neighbours(T s)
    {
        if(!map.containsKey(s)) 
        return ;
        System.out.println("The neighbours of "+s+" are");
        for(T w:map.get(s))
         System.out.print(w+",");
    }

    // Prints the adjancency list of each vertex.
    @Override public String toString()
    {
        StringBuilder builder = new StringBuilder();

        for (T v : map.keySet()) {
            builder.append(v.toString() + ": ");
            for (T w : map.get(v)) {
                builder.append(w.toString() + " ");
            }
            builder.append("\n");
        }

        return (builder.toString());
    }
}

// Driver Code
public class Main {

    public static void main(String args[])
    {

        // Object of graph is created.
        Graph<Integer> g = new Graph<Integer>();

        // edges are added.
        // Since the graph is bidirectional,
        // so boolean bidirectional is passed as true.
        g.addEdge(0, 1, true);
        g.addEdge(0, 4, true);
        g.addEdge(1, 2, true);
        g.addEdge(1, 3, true);
        g.addEdge(1, 4, true);
        g.addEdge(2, 3, true);
        g.addEdge(3, 4, true);

        // Printing the graph
        System.out.println("Graph:\n" + g.toString());

        // Gives the no of vertices in the graph.
        g.getVertexCount();

        // Gives the no of edges in the graph.
        g.getEdgesCount(true);

        // Tells whether the edge is present or not.
        g.hasEdge(3, 4);

        // Tells whether vertex is present or not
        g.hasVertex(5);
               g.neighbours(1);

    }
}

JavaScript

class Graph {
    constructor() {
        this.map = new Map();
    }

    addVertex(vertex) {
        this.map.set(vertex, []);
    }

    addEdge(source, destination, bidirectional) {
        if (!this.map.has(source)) {
            this.addVertex(source);
        }

        if (!this.map.has(destination)) {
            this.addVertex(destination);
        }

        this.map.get(source).push(destination);

        if (bidirectional) {
            this.map.get(destination).push(source);
        }
    }

    getVertexCount() {
        console.log(`The graph has ${this.map.size} vertex`);
    }

    getEdgesCount(bidirectional) {
        let count = 0;
        for (const edges of this.map.values()) {
            count += edges.length;
        }
        if (bidirectional) {
            count /= 2;
        }
        console.log(`The graph has ${count} edges.`);
    }

    hasVertex(vertex) {
        if (this.map.has(vertex)) {
            console.log(`The graph contains ${vertex} as a vertex.`);
        } else {
            console.log(`The graph does not contain ${vertex} as a vertex.`);
        }
    }

    hasEdge(source, destination) {
        if (this.map.has(source) && this.map.get(source).includes(destination)) {
            console.log(`The graph has an edge between ${source} and ${destination}.`);
        } else {
            console.log(`The graph has no edge between ${source} and ${destination}.`);
        }
    }

    neighbours(vertex) {
        if (!this.map.has(vertex)) return;
        console.log(`The neighbours of ${vertex} are ${this.map.get(vertex).join(", ")}`);
    }

    toString() {
        let result = "";
        for (const [vertex, edges] of this.map.entries()) {
            result += `${vertex}: ${edges.join(" ")}\n`;
        }
        return result;
    }
}

// Driver code
const g = new Graph();

g.addEdge(0, 1, true);
g.addEdge(0, 4, true);
g.addEdge(1, 2, true);
g.addEdge(1, 3, true);
g.addEdge(1, 4, true);
g.addEdge(2, 3, true);
g.addEdge(3, 4, true);

console.log("Graph:");
console.log(g.toString());

g.getVertexCount();
g.getEdgesCount(true);
g.hasEdge(3, 4);
g.hasVertex(5);
g.neighbours(1);

Output

Graph:
0: 1 4 
1: 0 2 3 4 
2: 1 3 
3: 1 2 4 
4: 0 1 3 

The graph has 5 vertex
The graph has 7 edges.
The graph has an edge between 3 and 4.
The graph does not contain 5 as a vertex.
The neighbours of...

Java Program to Implement of Gabow Scaling Algorithm

ritz7

Improve

Article Tags :

Practice Tags :

Implementing Generic Graph in Java

Approach:

Similar Reads

Thank You!

What kind of Experience do you want to share?