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 ");
}
}
//----------------------------------------------------------------------------------------------
}
flowchart
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.
You just have to know the symbols of flowchart and make the graphical representation of algorithm
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'.
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.
parallel edges
Find directed graph that has the adjacency matrix Find directed graph that has the adjacency matrix
If your graph is undirected, then its adjacency matrix will be symmetric. Faizan
An adjacency matrix is a matrix showing which vertices of a graph are adjacent to which other vertices.
adjacency matrix- since the edges are the relationship between two vertices ,the graph can be represented by a 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 are that you can see the arc lengths disadvantages some times it doesn't work because of insufficient vertices's or arcs.
An algorithm is a series of steps leading to a result. A flowchart can be a graphical representation of the algorithm.
It is a representation of an algorithm.
flowchart
no, the correct matrix to use is PQRS P1010 Q0101 R1100 S0010
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.