mirror of
https://codeberg.org/qg-info-unterricht/zpg-graphentester.git
synced 2026-03-25 04:58:24 +01:00
Fetch Upstream v7.4 - 01/2025
This commit is contained in:
parent
09967a1c1b
commit
667bc4638b
68 changed files with 2772 additions and 2770 deletions
|
|
@ -10,7 +10,7 @@ import graph.*;
|
|||
* Dieser Algorithmus nummeriert alle Knoten des Graphen.
|
||||
* Algorithmus: Tiefensuche rekursiv
|
||||
*
|
||||
* @version 1.0 from 10.12.2020
|
||||
* @version 7.1 from 12.02.2025
|
||||
* @author Thomas Schaller
|
||||
*/
|
||||
|
||||
|
|
@ -24,14 +24,14 @@ public class GraphAlgo_TiefensucheRek extends GraphAlgo {
|
|||
|
||||
|
||||
// Anfang Methoden
|
||||
public void fuehreAlgorithmusAus() {
|
||||
public void fuehreAlgorithmusAus() throws InterruptedException {
|
||||
if (g.getAnzahlKnoten()==0) {
|
||||
return;
|
||||
}
|
||||
nummeriere(getStartKnoten(), 0);
|
||||
} // end
|
||||
|
||||
private int nummeriere(Knoten k, int nr) {
|
||||
private int nummeriere(Knoten k, int nr) throws InterruptedException {
|
||||
// Abbruchbedingung
|
||||
if(k.isBesucht()) {
|
||||
info("Untersuche "+g.getKnoteninfo(k,false)+" => ist schon besucht");
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue