artem.didytschuk/breitensuche
1
0
Fork 0
forked from IF-LK-2020/breitensuche
Code Issues Pull Requests Releases Wiki Activity

Error Fix

Browse Source
This commit is contained in:
Artem Didytschuk
2021-01-18 17:43:58 +01:00
parent b1a8191637
commit ceeed0e97a
2 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
Breitensuche.class
View File

Binary file not shown.

9
Breitensuche.java
View File

@@ -109,18 +109,19 @@ public class Breitensuche {
// Nutze dazu die Hilfsmethode getVertexFromListByID, um aus
// Liste der Nachbarknoten denjenigen, der alphabetisch als
// erstes kommt herauszusuchen.
if(g.getVertex("Köln").getID().equals(pVertexID)){
if(g.getVertex("Düsseldorf").getID().equals(pVertexID)){
System.out.println("Köln gefunden");
return true;
} else {
g.getVertex("Köln").setMark(true);
searchQueue.enqueue(g.getVertex("Köln"));
g.getVertex("Düsseldorf").setMark(true);
searchQueue.enqueue(g.getVertex("Düsseldorf"));
while(!searchQueue.isEmpty()){
Vertex v = searchQueue.front();
List<Vertex> cngbrs=copyList(g.getNeighbours(v));
cngbrs.toFirst();
while(cngbrs.hasAccess()){
Vertex vs = getVertexFromListByID(cngbrs);
cngbrs.toFirst();
if(!vs.isMarked()){
System.out.println(vs.getID());
if(vs.getID().equals(pVertexID)){
@@ -158,9 +159,9 @@ public class Breitensuche {
while(!searchQueue.isEmpty()){
Vertex v = searchQueue.front();
List<Vertex> cngbrs=copyList(g.getNeighbours(v));
cngbrs.toFirst();
while(cngbrs.hasAccess()){
Vertex vs = getVertexFromListByWeight(v,cngbrs);
cngbrs.toFirst();
if(!vs.isMarked()){
System.out.println(vs.getID());
if(vs.getID().equals(pVertexID)){