Graph using adjacency list in Java
$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
New contributor
$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
New contributor
$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
New contributor
$endgroup$
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
java graph
New contributor
New contributor
edited 9 hours ago
mdfst13
17.9k62157
17.9k62157
New contributor
asked 11 hours ago
Aniket SaxenaAniket Saxena
62
62
New contributor
New contributor
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Aniket Saxena is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216010%2fgraph-using-adjacency-list-in-java%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Aniket Saxena is a new contributor. Be nice, and check out our Code of Conduct.
Aniket Saxena is a new contributor. Be nice, and check out our Code of Conduct.
Aniket Saxena is a new contributor. Be nice, and check out our Code of Conduct.
Aniket Saxena is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216010%2fgraph-using-adjacency-list-in-java%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown