How to connect 2 vertexes in an Adjacency List?











up vote
0
down vote

favorite












I'm trying to learn different Data Structures and I'm currently struggling on Graphs.



I am trying to implement an Adjacency List using a Map of Linked Lists. This lets me be able to search up the name of the vertex and see all its connections quickly.



But I am having trouble actually adding any connections. What I'm currently doing is



   public void add(V vertexName) {
if (!contains(vertexName)) {
ArrayList<V> array = new ArrayList<>();
adjList.put(vertexName,array);
}

}

public void connect(V start, V destination) {
if (!contains(start) || !contains(destination))
throw new NoSuchElementException();
adjList.get(start).add(destination); //adds destination to starts arraylist

}

System.out.print(adjList.toString);


But, for example, if I add 12, 10, and 20 to my list and then connect 20 and 12, I still just get:



12

10

20


instead of



12

10

20 - > 12


Any tips would be much appreciated. If it helps, adjList is a



Map<V,ArrayList<V>> adjList;


And i'm just trying to start off with a directed unweighted Graph to make things easier










share|improve this question









New contributor




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




















  • Are you sure it's not to do with how you're displaying it?
    – immibis
    Nov 21 at 3:48










  • Shouldn't it print out correctly if I just simply print out each ArrayList using the toString method?
    – Jesus Epps
    Nov 21 at 3:52










  • Better show your complete code, including initialisation and printing.
    – Ricky Mo
    Nov 21 at 3:55










  • Can you show the code which prints unexpected result?
    – talex
    Nov 21 at 4:04










  • I've added all relevant code.
    – Jesus Epps
    Nov 21 at 4:08















up vote
0
down vote

favorite












I'm trying to learn different Data Structures and I'm currently struggling on Graphs.



I am trying to implement an Adjacency List using a Map of Linked Lists. This lets me be able to search up the name of the vertex and see all its connections quickly.



But I am having trouble actually adding any connections. What I'm currently doing is



   public void add(V vertexName) {
if (!contains(vertexName)) {
ArrayList<V> array = new ArrayList<>();
adjList.put(vertexName,array);
}

}

public void connect(V start, V destination) {
if (!contains(start) || !contains(destination))
throw new NoSuchElementException();
adjList.get(start).add(destination); //adds destination to starts arraylist

}

System.out.print(adjList.toString);


But, for example, if I add 12, 10, and 20 to my list and then connect 20 and 12, I still just get:



12

10

20


instead of



12

10

20 - > 12


Any tips would be much appreciated. If it helps, adjList is a



Map<V,ArrayList<V>> adjList;


And i'm just trying to start off with a directed unweighted Graph to make things easier










share|improve this question









New contributor




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




















  • Are you sure it's not to do with how you're displaying it?
    – immibis
    Nov 21 at 3:48










  • Shouldn't it print out correctly if I just simply print out each ArrayList using the toString method?
    – Jesus Epps
    Nov 21 at 3:52










  • Better show your complete code, including initialisation and printing.
    – Ricky Mo
    Nov 21 at 3:55










  • Can you show the code which prints unexpected result?
    – talex
    Nov 21 at 4:04










  • I've added all relevant code.
    – Jesus Epps
    Nov 21 at 4:08













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I'm trying to learn different Data Structures and I'm currently struggling on Graphs.



I am trying to implement an Adjacency List using a Map of Linked Lists. This lets me be able to search up the name of the vertex and see all its connections quickly.



But I am having trouble actually adding any connections. What I'm currently doing is



   public void add(V vertexName) {
if (!contains(vertexName)) {
ArrayList<V> array = new ArrayList<>();
adjList.put(vertexName,array);
}

}

public void connect(V start, V destination) {
if (!contains(start) || !contains(destination))
throw new NoSuchElementException();
adjList.get(start).add(destination); //adds destination to starts arraylist

}

System.out.print(adjList.toString);


But, for example, if I add 12, 10, and 20 to my list and then connect 20 and 12, I still just get:



12

10

20


instead of



12

10

20 - > 12


Any tips would be much appreciated. If it helps, adjList is a



Map<V,ArrayList<V>> adjList;


And i'm just trying to start off with a directed unweighted Graph to make things easier










share|improve this question









New contributor




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











I'm trying to learn different Data Structures and I'm currently struggling on Graphs.



I am trying to implement an Adjacency List using a Map of Linked Lists. This lets me be able to search up the name of the vertex and see all its connections quickly.



But I am having trouble actually adding any connections. What I'm currently doing is



   public void add(V vertexName) {
if (!contains(vertexName)) {
ArrayList<V> array = new ArrayList<>();
adjList.put(vertexName,array);
}

}

public void connect(V start, V destination) {
if (!contains(start) || !contains(destination))
throw new NoSuchElementException();
adjList.get(start).add(destination); //adds destination to starts arraylist

}

System.out.print(adjList.toString);


But, for example, if I add 12, 10, and 20 to my list and then connect 20 and 12, I still just get:



12

10

20


instead of



12

10

20 - > 12


Any tips would be much appreciated. If it helps, adjList is a



Map<V,ArrayList<V>> adjList;


And i'm just trying to start off with a directed unweighted Graph to make things easier







java






share|improve this question









New contributor




Jesus Epps 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









New contributor




Jesus Epps 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




share|improve this question








edited Nov 21 at 4:08





















New contributor




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









asked Nov 21 at 3:44









Jesus Epps

13




13




New contributor




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





New contributor





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






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












  • Are you sure it's not to do with how you're displaying it?
    – immibis
    Nov 21 at 3:48










  • Shouldn't it print out correctly if I just simply print out each ArrayList using the toString method?
    – Jesus Epps
    Nov 21 at 3:52










  • Better show your complete code, including initialisation and printing.
    – Ricky Mo
    Nov 21 at 3:55










  • Can you show the code which prints unexpected result?
    – talex
    Nov 21 at 4:04










  • I've added all relevant code.
    – Jesus Epps
    Nov 21 at 4:08


















  • Are you sure it's not to do with how you're displaying it?
    – immibis
    Nov 21 at 3:48










  • Shouldn't it print out correctly if I just simply print out each ArrayList using the toString method?
    – Jesus Epps
    Nov 21 at 3:52










  • Better show your complete code, including initialisation and printing.
    – Ricky Mo
    Nov 21 at 3:55










  • Can you show the code which prints unexpected result?
    – talex
    Nov 21 at 4:04










  • I've added all relevant code.
    – Jesus Epps
    Nov 21 at 4:08
















Are you sure it's not to do with how you're displaying it?
– immibis
Nov 21 at 3:48




Are you sure it's not to do with how you're displaying it?
– immibis
Nov 21 at 3:48












Shouldn't it print out correctly if I just simply print out each ArrayList using the toString method?
– Jesus Epps
Nov 21 at 3:52




Shouldn't it print out correctly if I just simply print out each ArrayList using the toString method?
– Jesus Epps
Nov 21 at 3:52












Better show your complete code, including initialisation and printing.
– Ricky Mo
Nov 21 at 3:55




Better show your complete code, including initialisation and printing.
– Ricky Mo
Nov 21 at 3:55












Can you show the code which prints unexpected result?
– talex
Nov 21 at 4:04




Can you show the code which prints unexpected result?
– talex
Nov 21 at 4:04












I've added all relevant code.
– Jesus Epps
Nov 21 at 4:08




I've added all relevant code.
– Jesus Epps
Nov 21 at 4:08

















active

oldest

votes











Your Answer






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: "1"
};
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',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
});


}
});






Jesus Epps is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53404966%2fhow-to-connect-2-vertexes-in-an-adjacency-list%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes








Jesus Epps is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















Jesus Epps is a new contributor. Be nice, and check out our Code of Conduct.













Jesus Epps is a new contributor. Be nice, and check out our Code of Conduct.












Jesus Epps is a new contributor. Be nice, and check out our Code of Conduct.















 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53404966%2fhow-to-connect-2-vertexes-in-an-adjacency-list%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Berounka

Sphinx de Gizeh

Different font size/position of beamer's navigation symbols template's content depending on regular/plain...