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