1
0
forked from burkart/GUI

Compare commits

2 Commits

Author SHA1 Message Date
b9dea20e2b Merge commit '95f98e3f4cf5dce1b50b05437dbac12a0f4075bb' 2023-04-25 10:52:44 +02:00
e6d03f5e9c Readme geändert 2023-04-25 10:52:04 +02:00
4 changed files with 2 additions and 51 deletions

View File

@@ -68,48 +68,4 @@ class ARBEIT
System. out. println ("Breitensuche"); System. out. println ("Breitensuche");
g. BreitenSuche ("M"); g. BreitenSuche ("M");
} }
void AusführenIrrgarten() {
GRAPH_MATRIX g;
g = new GRAPH_MATRIX (14);
g. KnotenEinfuegen ("St");
g. KnotenEinfuegen ("A");
g. KnotenEinfuegen ("B");
g. KnotenEinfuegen ("C");
g. KnotenEinfuegen ("D");
g. KnotenEinfuegen ("E");
g. KnotenEinfuegen ("F");
g. KnotenEinfuegen ("G");
g. KnotenEinfuegen ("H");
g. KnotenEinfuegen ("I");
g. KnotenEinfuegen ("J");
g. KnotenEinfuegen ("K");
g. KnotenEinfuegen ("L");
g. KnotenEinfuegen ("M");
g. KnotenEinfuegen ("N");
g. KnotenEinfuegen ("O");
g. KnotenEinfuegen ("P");
g. KanteEinfuegen ("St", "A", 1);
g. KanteEinfuegen ("A", "B", 1);
g. KanteEinfuegen ("A", "D", 192);
g. KanteEinfuegen ("B", "C", 116);
g. KanteEinfuegen ("B", "I", 166);
g. KanteEinfuegen ("D", "G", 98);
g. KanteEinfuegen ("D", "E", 64);
g. KanteEinfuegen ("E", "F", 163);
g. KanteEinfuegen ("E", "J", 117);
g. KanteEinfuegen ("I", "H", 60);
g. KanteEinfuegen ("I", "P", 59);
g. KanteEinfuegen ("P", "O", 165);
g. KanteEinfuegen ("P", "N", 126);
g. KanteEinfuegen ("N", "L", 103);
g. KanteEinfuegen ("N", "M", 53);
g. KanteEinfuegen ("M", "K", 127);
g. KanteEinfuegen ("M", "J", 72);
g. KanteEinfuegen ("J", "Zi", 72);
g.BreitenSuche("St");
}
} }

View File

@@ -2,7 +2,7 @@ import Liste. *;
/** /**
* Verwaltet einen Graphen mit Hilfe einer Adjazenzmatrix. * Verwaltet einen Graphen mit Hilfe einer Adjazenzmatrix.
* *
* @author Albert * @author Albert Wiedemann
* @version 1.0 * @version 1.0
*/ */
class GRAPH_MATRIX class GRAPH_MATRIX
@@ -178,7 +178,6 @@ class GRAPH_MATRIX
if ((matrix [aktKnoten] [k] > 0) && (! besucht [k]) && (! offeneKnoten. Enthaelt (info))) if ((matrix [aktKnoten] [k] > 0) && (! besucht [k]) && (! offeneKnoten. Enthaelt (info)))
{ {
offeneKnoten. HintenEinfuegen (info); offeneKnoten. HintenEinfuegen (info);
} }
} }
info = (KNOTENINFO) offeneKnoten. AnfangEntfernen (); info = (KNOTENINFO) offeneKnoten. AnfangEntfernen ();
@@ -193,6 +192,4 @@ class GRAPH_MATRIX
} while (aktKnoten >= 0); } while (aktKnoten >= 0);
} }
} }
} }

View File

@@ -16,6 +16,4 @@ public interface DATENELEMENT
* return true, wernn dei Schlüsselwerte gleich sind * return true, wernn dei Schlüsselwerte gleich sind
*/ */
boolean SchluesselIstGleich (DATENELEMENT d); boolean SchluesselIstGleich (DATENELEMENT d);
String BezeichnungGeben();
} }

View File

@@ -1,5 +1,5 @@
------------------------------------------------------------------------ ------------------------------------------------------------------------
Testedit:This is the project README file. Here, you should describe your project. Hallo zusammen! This is the project README file. Here, you should describe your project.
Tell the reader (someone who does not know anything about this project) Tell the reader (someone who does not know anything about this project)
all he/she needs to know. The comments should usually include at least: all he/she needs to know. The comments should usually include at least:
------------------------------------------------------------------------ ------------------------------------------------------------------------