Ttykuu

Unexpected behavior of the procedure `Area` on the object 'Polygon'

What are some good ways to treat frozen vegetables such that they behave like fresh vegetables when stir frying them?

How can mimic phobia be cured?

How to explain what's wrong with this application of the chain rule?

Quoting Keynes in a lecture

Does the Linux kernel need a file system to run?

How to say when an application is taking the half of your screen on a computer

Why is so much work done on numerical verification of the Riemann Hypothesis?

System.QueryException unexpected token

Did arcade monitors have same pixel aspect ratio as TV sets?

Plot of a tornado-shaped surface

What are the balance implications behind making invisible things auto-hide?

It grows, but water kills it

How should I respond when I lied about my education and the company finds out through background check?

What if a revenant (monster) gains fire resistance?

PTIJ: Haman's bad computer

Store Credit Card Information in Password Manager?

Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?

Solve the following system of equations - (3)

Using substitution ciphers to generate new alphabets in a novel

What is the English pronunciation of "pain au chocolat"?

How much character growth crosses the line into breaking the character

Do we have to expect a queue for the shuttle from Watford Junction to Harry Potter Studio?

Non-trope happy ending?

Graph using adjacency list in Java

Applying Dijkastra's algorithm on a graph of five nodesCoding and printing a graphGraph implementation adjacency list 1.0Minimum amount of edges that needs to be traversed to visit all vertices… or something like thatShortest path algorithm in 0-1-unoriented graphBreadth-first tree cuttingC++ Graph Class Implementation (adjacency list)Adjacency List Graph representation on pythonGraph represented by adjacency listFinding intersting path in a graph

0

$begingroup$

This is the main code. Here I'm joining vertices by edges.

node[] gra=new node[5];

 for (int i = 0; i < 5; i++)
 gra[i] = new node(i); //I'm allocating memory for all the vertices.

void add_edge(int to,int from) //to represent the vertice the edge is going and from is now self explanatory

 node new_vert=new node(to); 
 node temp=gra[from];
 while(temp.next!=null)
 temp=temp.next;
 temp.next=new_vert;

Now to do this operation I'm using this loop in main method.

for(int i=0;i<5;i++) //For simplicity I have taken 5 vertices
 
 int n=sc.nextInt(); //N is Number of edges from the vertices, for example in figure for vertex 0 the number of edges are 2.
 for(int j=0;j<n;j++)
 
 int to=sc.nextInt();
 obj.add_edge(to,i);
 
 

Is my implementation correct or efficient enough so that I can use this code for further use?

Feel free to ask if you don't understand the code; I will try to explain. I know I'm bad at explaining. And please forgive my English.

java graph

share|improve this question

edited 5 mins ago

mdfst13

17.9k62157

asked 2 hours ago

Aniket SaxenaAniket Saxena

11

New contributor

Aniket Saxena is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

0

$begingroup$

This is the main code. Here I'm joining vertices by edges.

node[] gra=new node[5];

 for (int i = 0; i < 5; i++)
 gra[i] = new node(i); //I'm allocating memory for all the vertices.

void add_edge(int to,int from) //to represent the vertice the edge is going and from is now self explanatory

 node new_vert=new node(to); 
 node temp=gra[from];
 while(temp.next!=null)
 temp=temp.next;
 temp.next=new_vert;

Now to do this operation I'm using this loop in main method.

for(int i=0;i<5;i++) //For simplicity I have taken 5 vertices
 
 int n=sc.nextInt(); //N is Number of edges from the vertices, for example in figure for vertex 0 the number of edges are 2.
 for(int j=0;j<n;j++)
 
 int to=sc.nextInt();
 obj.add_edge(to,i);
 
 

Is my implementation correct or efficient enough so that I can use this code for further use?

Feel free to ask if you don't understand the code; I will try to explain. I know I'm bad at explaining. And please forgive my English.

java graph

share|improve this question

edited 5 mins ago

mdfst13

17.9k62157

asked 2 hours ago

Aniket SaxenaAniket Saxena

11

New contributor

Aniket Saxena is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

This is the main code. Here I'm joining vertices by edges.

node[] gra=new node[5];

 for (int i = 0; i < 5; i++)
 gra[i] = new node(i); //I'm allocating memory for all the vertices.

void add_edge(int to,int from) //to represent the vertice the edge is going and from is now self explanatory

 node new_vert=new node(to); 
 node temp=gra[from];
 while(temp.next!=null)
 temp=temp.next;
 temp.next=new_vert;

Now to do this operation I'm using this loop in main method.

for(int i=0;i<5;i++) //For simplicity I have taken 5 vertices
 
 int n=sc.nextInt(); //N is Number of edges from the vertices, for example in figure for vertex 0 the number of edges are 2.
 for(int j=0;j<n;j++)
 
 int to=sc.nextInt();
 obj.add_edge(to,i);
 
 

Is my implementation correct or efficient enough so that I can use this code for further use?

Feel free to ask if you don't understand the code; I will try to explain. I know I'm bad at explaining. And please forgive my English.

java graph

share|improve this question

edited 5 mins ago

mdfst13

17.9k62157

asked 2 hours ago

Aniket SaxenaAniket Saxena

11

New contributor

Aniket Saxena is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

node[] gra=new node[5];

 for (int i = 0; i < 5; i++)
 gra[i] = new node(i); //I'm allocating memory for all the vertices.

void add_edge(int to,int from) //to represent the vertice the edge is going and from is now self explanatory

 node new_vert=new node(to); 
 node temp=gra[from];
 while(temp.next!=null)
 temp=temp.next;
 temp.next=new_vert;

for(int i=0;i<5;i++) //For simplicity I have taken 5 vertices
 
 int n=sc.nextInt(); //N is Number of edges from the vertices, for example in figure for vertex 0 the number of edges are 2.
 for(int j=0;j<n;j++)
 
 int to=sc.nextInt();
 obj.add_edge(to,i);
 
 

share|improve this question

edited 5 mins ago

mdfst13

17.9k62157

asked 2 hours ago

Aniket SaxenaAniket Saxena

11

New contributor

Aniket Saxena is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|improve this question

edited 5 mins ago

mdfst13

17.9k62157

asked 2 hours ago

Aniket SaxenaAniket Saxena

11

New contributor

Aniket Saxena is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

edited 5 mins ago

mdfst13

17.9k62157

edited 5 mins ago

mdfst13

17.9k62157

asked 2 hours ago

Aniket SaxenaAniket Saxena

11

New contributor

Aniket Saxena is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 2 hours ago

Aniket SaxenaAniket Saxena

11