answersLogoWhite

0


Best Answer

To Find the number in that matrix and check that number adjacency elements...

import java.util.Scanner;

public class FindAdjacencyMatrix {

public static int[][] array1 = new int[30][30];

public static int i,j,num,m,n;

public static void main(String args[]) {

Scanner input = new Scanner(System.in);

//-------------------------------------------------------------------------------------------------

System.out.println("Enter the m ,n matrix");

m = input.nextInt();

n = input.nextInt();

//-------------------------------------------------------------------------------------------------

System.out.println("Enter the matrix Element one by one:");

for(i = 0; i < m; i++) {

for(j = 0; j < n; j++) {

array1[i][j] = input.nextInt();

}

}

System.out.println("The Given Matrix is :");

for(i = 0; i < m; i++) {

for(j = 0; j < n; j++) {

System.out.print(" "+array1[i][j]);

}

System.out.print("\n");

}

//-------------------------------------------------------------------------------------------------

System.out.println("Find The Adjacency Elements for Given Number : ");

System.out.println("Enter The Number : ");

num = input.nextInt();

for(i = 0; i < m; i++) {

for(j = 0; j < n; j++) {

if(num == array1[i][j]) {

System.out.println("Element is Found :"+num);

findAdjacency(num,i,j);

break;

}

}

}

//--------------------------------------------------------------------------------------

}

private static void findAdjacency(int elem,int row,int col) {

try {

if( array1[row][col-1]!=-1) {

System.out.println("Left Adjacency : "+array1[row][col-1]);

}

} catch(Exception e){

System.out.println(" Exception Throwing ");

}

try{

if(array1[row][col+1]!= -1) {

System.out.println("Right Adjacency : "+array1[row][col+1]);

}

}catch(Exception e){

System.out.println(" Exception Throwing ");

}

try {

if(array1[row-1][col]!= -1) {

System.out.println("Top Adjacency : "+array1[row-1][col]);

}

} catch(Exception e){

System.out.println(" Exception Throwing ");

}

try {

if(array1[row+1][col]!= -1) {

System.out.println("Botto Adjacency : "+array1[row+1][col]);

}

} catch(Exception e){

System.out.println(" Exception Throwing ");

}

}

//----------------------------------------------------------------------------------------------

}

User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Algorithm for adjacency matrix representation
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

what provides a representation of patterns that an algorithm comprises?

flowchart


What is a fast-transpose algorithm for sparse matrices?

A fast-transpose is a computer algorithm that quickly transposes a sparse matrix using a relatively small amount of memory. Using arrays normally to record a sparse matrix uses up a lot of memory since many of the matrix's values are zero. In addition, using the normal transpose algorithm to transpose this matrix will take O(cols*elements) amount of time. The fast-transpose algorithm only uses a little memory to record the matrix and takes only O(cols+elements) amount of time, which is efficient considering the number of elements equals cols*rows.


How do you do calculation on programming flowcharts?

You just have to know the symbols of flowchart and make the graphical representation of algorithm


What is the difference between algorithm and flowcharts?

They both are same. Both of them mean a set of instructions. but, an algorithm is a simple flow of instructions whereas in a flowchart the instructions are represented pictorially, and as the name suggest it is a 'flow chart'.


Advantages of algorithm over flowchart?

what are the advantages of algorithm over flowchart algorithm is a step by step procedure of a particular program either in pure english programming language or in english programming style. while a flowchart is a pictorial representation of an algorithm. why algorithm is better? the answer is very simple, as algorithm are concise and compact. it gives the basic idea behind the program. why flowchart is better? the answer to it is...being graphical it is easy to understand th methodology of program and can be reviewed as well as corrected easily.

Related questions

An adjacency matrix representation of a graph cannot contain information of?

parallel edges


Find directed graph that has the adjacency matrix?

Find directed graph that has the adjacency matrix Find directed graph that has the adjacency matrix


When you call adjacency matrix in symmetric matrix?

If your graph is undirected, then its adjacency matrix will be symmetric. Faizan


What is an adjacency matrix?

An adjacency matrix is a matrix showing which vertices of a graph are adjacent to which other vertices.


Write adjacency and incidence matrix for all the graphs developed?

adjacency matrix- since the edges are the relationship between two vertices ,the graph can be represented by a matrix,


What is Adjacency Matrix?

Adjacency matric is static implementation of Grah.It consist of M*M order matrix. the return type pf matrix is boolewn.If there is an edge b\w two vertices then we place 1 in the matrix i,j index.If there is no edge b\w two vertices then we place 0 in the matrix i,j index. thanks


Advantages and disadvantages of using adjacency list over adjacency matrix?

Advantages are that you can see the arc lengths disadvantages some times it doesn't work because of insufficient vertices's or arcs.


How algorithm is different from flowchart?

An algorithm is a series of steps leading to a result. A flowchart can be a graphical representation of the algorithm.


What does a flow chart drawing show?

It is a representation of an algorithm.


what provides a representation of patterns that an algorithm comprises?

flowchart


What is the answers to The adjacency matrix of a node graph is given below. How many direct connection paths exist in the graph that is represented by this matrix PQRS P1010 Q0101 R1100 S0001?

no, the correct matrix to use is PQRS P1010 Q0101 R1100 S0010


How does one read data from a text file and create an adjacency matrix with the data in matlab?

You can read data from a text file in a few different ways, but generally you use the "textread" function. The syntax is: C = textread('file','format') where C will be your new text matrix, file is your text file within your matlab directory, and format will depend on the type of data it is (see related link for more). Can't help with the adjacency matrix, sorry.