Question

Write a program in Java; provide an example of output

Problem Given the vertex pairs associated to the edges of a graph, construct an adjacency matrix for the graph. (Produce a version that works when loops, multiple edges, or directed edges are present.)

Answer 1

Java code:

import java.util.Scanner;

public class Main

{

private final int vertex;

private int[][] matrix;

public Main(int v)

{

vertex=v;

matrix = new int[vertex+1][vertex+1];

}

public void createEdge(int t,int f,int e)

{

try

{

matrix[t][f]=e;

}

catch (ArrayIndexOutOfBoundsException index)

{

System.out.println("The vertices doesn't exists");

}

}

public int getEdge(int t,int f)

{

try

{

return matrix[t][f];

}

catch (ArrayIndexOutOfBoundsException index)

{

System.out.println("The vertices does not exists");

}

return -1;

}

public static void main(String args[])

{

int v,e,c=1,t=0,f=0;

Scanner sc= new Scanner(System.in);

Main g;

System.out.println("Enter number of vertices: ");

v = sc.nextInt();

System.out.println("Enter the number of edges: ");

e = sc.nextInt();

g=new Main(v);

System.out.println("Enter the edges: <to> <from>");

while(c<=e)

{

t= sc.nextInt();

f=sc.nextInt();

g.createEdge(t,f,1);

c++;

}

System.out.println("The adjacency matrix for graph is: ");

System.out.print(" ");

for(int i=1;i<=v;i++)

System.out.print(i + " ");

System.out.println();

for (int i=1;i<=v;i++)

{

System.out.print(i + " ");

for (int j = 1; j <= v; j++)

System.out.print(g.getEdge(i, j) + " ");

System.out.println();

}

}

}

java version 1.8.0 31" Java (TM) SE Runtime Environment (build 1.8.0 31-b13) Java HotSpot (TM) 64-Bit Server VM (build 25.31-b07, mixed mode) javac -classpath .:/run dir/junit-4.12.jar:/run dir/hamcrest-core-1.3.ja r:/run dir/json-simple-1.1.1.jar -d . Main.java java -classpath .:/run dir/junit-4.12.jar:/run dir/hamcrest-core-1.3.jar :/run dir/json-simple-1.1.1.jar Main Enter number of vertices: Enter the number of edges: 7 Enter the edges: <to> <from> 3 4 3 5 2 4 The adjacency matrix for graph 13: 1 2 3 4 5 110 0 1 0 2 0011 0 3 0 0 0 11 4 0 0 00 1 5 000 0 0

if you like the answer please provide a thumbs up.