erstes Beispiel - Labyrinth
(define
Graph
'( (1 (2 4))
(2 (1 3))
(3 (2 6))
(4 (1 5 7))
(5 (4 8))
(6 (3))
(7 (4))
(8 (5 9))
(9 (8))))
;;;==============================================================
;;; Labyrinth dazu :
;;; 1 - 2 - 3
;;; I I
;;; 4 - 5 6
;;; I I
;;; 7 8 - 9
;;;==============================================================
(Tiefensuche 1 9 Graph)
;;; Und das Ablaufprotokoll dazu:
(2 4) (1) ()
(1 3) (2 1) ((4))
(3) (2 1) ((4))
(2 6) (3 2 1) (() (4))
(6) (3 2 1) (() (4))
(3) (6 3 2 1) (() () (4))
() (6 3 2 1) (() () (4))
() (3 2 1) (() (4))
() (2 1) ((4))
(4) (1) ()
(1 5 7) (4 1) (())
(5 7) (4 1) (())
(4 8) (5 4 1) ((7) ())
(8) (5 4 1) ((7) ())
(5 9) (8 5 4 1) (() (7) ())
(9) (8 5 4 1) (() (7) ())
(1 4 5 8 9)