グラフ表現

node [クラス]

  :super   propertied-object 

  :slots 		 arc-list 

:init n [メソッド]

:arc-list [メソッド]

:successors [メソッド]

:add-arc a [メソッド]

:remove-arc a [メソッド]

:remove-all-arcs [メソッド]

:unlink n [メソッド]

:add-neighbor n &optional a [メソッド]

:neighbors &optional args [メソッド]

arc [クラス]

  :super   propertied-object 

  :slots 		 from to 

:init from_ to_ [メソッド]

:from [メソッド]

:to [メソッド]

:prin1 &optional (strm t) &rest msgs [メソッド]

directed-graph [クラス]

  :super   propertied-object 

  :slots 		 nodes 

:init [メソッド]

:successors node &rest args [メソッド]

:node name [メソッド]

:nodes &optional arg [メソッド]

:add-node n [メソッド]

:remove-node n [メソッド]

:clear-nodes [メソッド]

:add-arc-from-to from to [メソッド]

:remove-arc arc [メソッド]

:adjacency-matrix [メソッド]

:adjacency-list [メソッド]

:write-to-dot fname &optional result-path (title output) [メソッド]

:write-to-pdf fname &optional result-path (title (string-right-trim .pdf fname)) [メソッド]

costed-arc [クラス]

  :super   arc 

  :slots 		 cost 

:init from to c [メソッド]

:cost [メソッド]

costed-graph [クラス]

  :super   directed-graph 

  :slots 		 nil 

:add-arc from to cost &key (both nil) [メソッド]

:add-arc-from-to from to cost &key (both nil) [メソッド]

:path-cost from arc to [メソッド]

graph [クラス]

  :super   costed-graph 

  :slots 		 start-state goal-state 

:goal-test gs [メソッド]

:path-cost from arc to [メソッド]

:start-state &optional arg [メソッド]

:goal-state &optional arg [メソッド]

:add-arc from to &key (both nil) [メソッド]

:add-arc-from-to from to &key (both nil) [メソッド]

arced-node [クラス]

  :super   node 

  :slots 		 nil 

:init &key name [メソッド]

:find-action n [メソッド]

:neighbor-action-alist [メソッド]

solver-node [クラス]

  :super   propertied-object 

  :slots 		 state cost parent action memorized-path 

:init st &key ((:cost c) 0) ((:parent p) nil) ((:action a) nil) [メソッド]

:path &optional (prev nil) [メソッド]

:expand prblm &rest args [メソッド]

:state &optional arg [メソッド]

:cost &optional arg [メソッド]

:parent &optional arg [メソッド]

:action &optional arg [メソッド]

solver [クラス]

  :super   propertied-object 

  :slots 		 nil 

:init [メソッド]

:solve prblm [メソッド]

:solve-by-name prblm s g &key (verbose nil) [メソッド]

graph-search-solver [クラス]

  :super   solver 

  :slots 		 open-list close-list 

:solve-init prblm [メソッド]

:find-node-in-close-list n [メソッド]

:solve prblm &key (verbose nil) [メソッド]

:add-to-open-list obj/list [メソッド]

:null-open-list? [メソッド]

:clear-open-list [メソッド]

:add-list-to-open-list lst [メソッド]

:add-object-to-open-list lst [メソッド]

:pop-from-open-list &key (debug) [メソッド]

:open-list &optional arg [メソッド]

:close-list &optional arg [メソッド]

breadth-first-graph-search-solver [クラス]

  :super   graph-search-solver 

  :slots 		 nil 

:init [メソッド]

:clear-open-list [メソッド]

:add-list-to-open-list lst [メソッド]

:add-object-to-open-list obj [メソッド]

:pop-from-open-list &key (debug) [メソッド]

depth-first-graph-search-solver [クラス]

  :super   graph-search-solver 

  :slots 		 nil 

:init [メソッド]

:clear-open-list [メソッド]

:add-list-to-open-list lst [メソッド]

:add-object-to-open-list obj [メソッド]

:pop-from-open-list &key (debug) [メソッド]

best-first-graph-search-solver [クラス]

  :super   graph-search-solver 

  :slots 		 aproblem 

:init p [メソッド]

:clear-open-list [メソッド]

:add-list-to-open-list lst [メソッド]

:add-object-to-open-list obj [メソッド]

:pop-from-open-list &key (debug nil) [メソッド]

:fn n p [メソッド]

a-graph-search-solver [クラス]

  :super   best-first-graph-search-solver 

  :slots 		 nil 

:init p [メソッド]

:fn n p &key (debug nil) [メソッド]

:gn n p [メソッド]

:hn n p [メソッド]