cmpl-output.lisp

;;; Safety = 3, Speed = 1, Space = 1, Float = 1, Interruptible = 0
;;; Compilation speed = 1, Debug = 2, Fixnum safety = 3
;;; Source level debugging is on
;;; Source file recording is  on
;;; Cross referencing is on
; (TOP-LEVEL-FORM 0)
; (TOP-LEVEL-FORM 1)
; Loading text file /home/jakub/.lisp-loading/graphs-loading.lisp
;  Loading text file /home/jakub/.lisp-loading/loading.lisp
; (TOP-LEVEL-FORM 2)
; Loading text file /home/jakub/Projects/algmat/graphs/edge.lisp
;  Loading text file /home/jakub/.lisp-loading/graphs-loading.lisp
;   Loading text file /home/jakub/.lisp-loading/loading.lisp

#P"/home/jakub/.lisp-loading/graphs-loading.lisp" 
;  Loading text file /home/jakub/Projects/algmat/graphs/help-classes.lisp

#<STANDARD-CLASS VISITABLE-OBJECT 200FD82B> 
#<STANDARD-METHOD VISIT NIL (VISITABLE-OBJECT) 20105947> 
#<STANDARD-METHOD UNVISIT NIL (VISITABLE-OBJECT) 20091F87> 
#<STANDARD-CLASS PRIZED-OBJECT 2009539B> 
NIL 
;  Loading text file /home/jakub/Projects/algmat/graphs/node.lisp

#<STANDARD-CLASS NODE 200A7A97> 
NODEP 
#<STANDARD-METHOD MAKE-NODE NIL (STRING) 200AB2B3> 
#<STANDARD-METHOD NODE-EQUAL-P NIL (NODE NODE) 200AE107> 
#<STANDARD-METHOD FIND-NODE NIL (NODE T) 200B0703> 
#<STANDARD-METHOD PRINT-OBJECT NIL (NODE T) 200B284B> 
NIL 
#<STANDARD-CLASS EDGE 200B50C7> 
EDGEP 
#<STANDARD-METHOD MAKE-EDGE NIL (NODE NODE) 200BC35F> 
#<STANDARD-METHOD MAKE-EDGE NIL (STRING STRING) 200BFDCB> 
#<STANDARD-METHOD EDGE-EQUAL-P NIL (EDGE EDGE) 200C22A3> 
#<STANDARD-METHOD EDGE-WEAK-EQUAL-P NIL (EDGE EDGE) 200C610F> 
#<STANDARD-METHOD EDGE-FREE-EQUAL-P NIL (EDGE EDGE) 200C9F3F> 
#<STANDARD-METHOD HAVE-COMMON-NODE-P NIL (EDGE EDGE) 200D0C5B> 
#<STANDARD-METHOD SWITCH NIL (EDGE) 200D369B> 
#<STANDARD-METHOD SWITCHF NIL (EDGE) 200D77AF> 
#<STANDARD-METHOD SWITCH-IF-NEEDED NIL (EDGE NODE) 200DA36F> 
#<STANDARD-METHOD FIND-EDGE NIL (EDGE T) 200DCB1B> 
#<STANDARD-METHOD EDGE-TO-STRING NIL (EDGE) 200DEEE7> 
#<STANDARD-METHOD PRINT-OBJECT NIL (EDGE T) 200E567B> 
#<STANDARD-METHOD LOOPP NIL (EDGE) 200EB4A7> 
#<STANDARD-METHOD COPY NIL (EDGE) 200F62B3> 
#<STANDARD-CLASS UNDIRECTED-EDGE 200F6817> 
#<STANDARD-CLASS DIRECTED-EDGE 200F902F> 
#<STANDARD-METHOD EDGE-EQUAL-P NIL (DIRECTED-EDGE DIRECTED-EDGE) 200FA66B> 
#<STANDARD-METHOD EDGE-WEAK-EQUAL-P NIL (DIRECTED-EDGE DIRECTED-EDGE) 200FDD7B> 
#<STANDARD-METHOD EDGE-TO-SRING NIL (DIRECTED-EDGE) 200FF9E3> 
#<STANDARD-CLASS VISITABLE-EDGE 20100FE7> 
#<STANDARD-CLASS VISITABLE-UNDIRECTED-EDGE 20102887> 
#<STANDARD-CLASS VISITABLE-DIRECTED-EDGE 201054B3> 
#<STANDARD-METHOD SWITCH NIL (VISITABLE-EDGE) 20094663> 
#<STANDARD-METHOD EDGE-EQUAL-P NIL (VISITABLE-EDGE VISITABLE-EDGE) 20098337> 
#<STANDARD-METHOD EDGE-TO-STRING NIL (VISITABLE-EDGE) 2009C887> 
#<STANDARD-METHOD COPY NIL (VISITABLE-EDGE) 2009F16F> 
#<STANDARD-CLASS PRIZED-EDGE 200A2087> 
#<STANDARD-CLASS PRIZED-UNDIRECTED-EDGE 200A43BF> 
#<STANDARD-CLASS PRIZED-DIRECTED-EDGE 200A71FB> 
#<STANDARD-METHOD SWITCH NIL (PRIZED-EDGE) 200A9DC3> 
#<STANDARD-METHOD EDGE-EQUAL-P NIL (PRIZED-EDGE PRIZED-EDGE) 200B0503> 
#<STANDARD-METHOD EDGE-TO-STRING NIL (PRIZED-EDGE) 200B3C2F> 
#<STANDARD-METHOD COPY NIL (PRIZED-EDGE) 200B76DF> 
#<STANDARD-CLASS VISITABLE-PRIZED-EDGE 200BE143> 
#<STANDARD-CLASS VISITABLE-PRIZED-UNDIRECTED-EDGE 200C49D3> 
#<STANDARD-CLASS VISITABLE-PRIZED-DIRECTED-EDGE 200D0013> 
; (TOP-LEVEL-FORM 2)
; (DEFCLASS GRAPH)
; (METHOD CHECK-NODE (GRAPH T))
; (METHOD CHECK-NODES (GRAPH T))
; (METHOD NODE-OF-GRAPH-P (GRAPH NODE))
; (METHOD ADD-NODE (GRAPH NODE))
; (METHOD ADD-NODE (GRAPH STRING))
; (METHOD SET-NODES (GRAPH T))
; (METHOD DELETE-NODE (GRAPH NODE))
; (METHOD GET-NODE (GRAPH STRING))
; (METHOD DEGREE (GRAPH NODE))
; (METHOD DEGREE+ (GRAPH NODE))
; (METHOD DEGREE- (GRAPH NODE))
; (METHOD CHECK-EDGE (GRAPH T))
; (METHOD CHECK-EDGES (GRAPH T))
; (METHOD MAKE-GRAPH-EDGE (GRAPH NODE NODE))
; (METHOD MAKE-GRAPH-EDGE (GRAPH STRING STRING))
; (METHOD EDGE-OF-GRAPH-P (GRAPH EDGE))
; (METHOD ADD-EDGE (GRAPH EDGE))
; (METHOD SET-EDGES (GRAPH T))
; (METHOD DELETE-EDGE (GRAPH EDGE))
; (METHOD EDGE-OF-NODE-P (EDGE NODE))
; (METHOD EDGES-OF-NODE (GRAPH NODE))
; (METHOD EDGE-FROM-NODE-P (EDGE NODE))
; (METHOD EDGES-FROM-NODE (GRAPH NODE))
; (METHOD EDGE-TO-NODE-P (EDGE NODE))
; (METHOD EDGES-TO-NODE (GRAPH NODE))
; (METHOD GET-EDGE (GRAPH STRING STRING))
; (METHOD COPY (GRAPH))
; (METHOD PRINT-OBJECT (GRAPH T))
; (METHOD LIST-OF-NEIGHBOURS (GRAPH))
; (METHOD MATRIX-OF-NEIGHBOURS (GRAPH))
; (METHOD PRINT-MATRIX-OF-NEIGHBOURS (GRAPH))
; (DEFCLASS UNDIRECTED-GRAPH)
; (DEFCLASS DIRECTED-GRAPH)
; (METHOD EDGE-FROM-NODE-P (DIRECTED-EDGE NODE))
; (METHOD EDGE-TO-NODE-P (DIRECTED-EDGE NODE))
; (METHOD MATRIX-OF-NEIGHBOURS (DIRECTED-GRAPH))

---- Press Space to continue ----