Adjaceny Matric Implementation for Graph in JAVA.

AdjMatGraph.java

package com.demo.advjava;

public class GraphImplementationAdjMat {

	int[][] graph;

	public GraphImplementationAdjMat(int vertices) {
		graph = new int[vertices][vertices];
	}

	public void addEdge(int vertexOne, int vertexTwo) {
		graph[vertexOne][vertexTwo] = 1;
		graph[vertexTwo][vertexOne] = 1;
	}

	public void printGraph() {
		int i, j;
		for (i = 0; i < graph.length; i++) {
			for (j = 0; j < graph.length; j++) {
				System.out.print(graph[i][j] + " ");
			}
			System.out.println();
		}
	}

	public static void main(String[] args) {
		GraphImplementationAdjMat gmat = new GraphImplementationAdjMat(Integer.parseInt(args[0]));

		// Graph structure

		// 0--1
		// | /|
		// |/ |
		// 2--3--4
		//

		gmat.addEdge(0, 1);
		gmat.addEdge(0, 2);
		gmat.addEdge(2, 3);
		gmat.addEdge(1, 3);
		gmat.addEdge(3, 4);
		gmat.printGraph();
	}

}