[Lisp-cn] lisp_Iterative-deepning depth-first search问题

[yxc]

想请教䞀䞪问题
现圚写了䞀䞪凜数䞀䞪深床䌘先遍历䞀䞪广床䌘先遍历

(defun dfs (tree) 深床
(cond ((null tree) nil)
((atom tree) (cons tree nil))
(t (append (dfs (car tree))
(dfs (cdr tree))))))

Example: (dfs ‘((a (b)) c (d)) should return: (a b c d)


(defun bfs (tree)广床
(cond ((null tree) nil)
((atom (car tree)) (cons (car tree) (bfs (cdr tree))))
(t (bfs (append (cdr tree) (car tree))))))

Example: (bfs ‘((a (b)) c (d))) should return: (c a d b)

想写䞀䞪Iterative-deepning depth-first search 反倍深床遍历
蟓出应该是Example: (dfid ‘((a (b)) c(d))) should return: (c a c d a b c d)

需芁写䞀䞪计算深床的蟅助凜数

只可以䜿甚
numbers, symbols, variables
t , nil
defun, let, quote, ',
arithmetic/comparison operators : ,<=,>=,<,>,
boolean operators : and or not
List manipulation : first rest car cdr cons list append, null,
atomconditional forms
条件: if, cond,

十分感谢🙏

[yxc]

已想出

圚 2015幎5月11日星期䞀 UTC+9䞋午6:30:07yxc写道

Post by yxc
想请教䞀䞪问题
现圚写了䞀䞪凜数䞀䞪深床䌘先遍历䞀䞪广床䌘先遍历
(defun dfs (tree) 深床
(cond ((null tree) nil)
((atom tree) (cons tree nil))
(t (append (dfs (car tree))
(dfs (cdr tree))))))
Example: (dfs ‘((a (b)) c (d)) should return: (a b c d)
(defun bfs (tree)广床
(cond ((null tree) nil)
((atom (car tree)) (cons (car tree) (bfs (cdr tree))))
(t (bfs (append (cdr tree) (car tree))))))
Example: (bfs ‘((a (b)) c (d))) should return: (c a d b)
想写䞀䞪Iterative-deepning depth-first search 反倍深床遍历
蟓出应该是Example: (dfid ‘((a (b)) c(d))) should return: (c a c d a b c d)
需芁写䞀䞪计算深床的蟅助凜数
只可以䜿甚
numbers, symbols, variables
t , nil
defun, let, quote, ',
arithmetic/comparison operators : ,<=,>=,<,>,
boolean operators : and or not
List manipulation : first rest car cdr cons list append, null,
atomconditional forms
条件: if, cond,
十分感谢🙏

[Xiaofeng Yang]

赞~

Best regards,
Xiaofeng Yang

Post by yxc
已想出
圚 2015幎5月11日星期䞀 UTC+9䞋午6:30:07yxc写道

Post by yxc
想请教䞀䞪问题
现圚写了䞀䞪凜数䞀䞪深床䌘先遍历䞀䞪广床䌘先遍历
(defun dfs (tree) 深床
(cond ((null tree) nil)
((atom tree) (cons tree nil))
(t (append (dfs (car tree))
(dfs (cdr tree))))))
Example: (dfs ‘((a (b)) c (d)) should return: (a b c d)
(defun bfs (tree)广床
(cond ((null tree) nil)
((atom (car tree)) (cons (car tree) (bfs (cdr tree))))
(t (bfs (append (cdr tree) (car tree))))))
Example: (bfs ‘((a (b)) c (d))) should return: (c a d b)
想写䞀䞪Iterative-deepning depth-first search 反倍深床遍历
蟓出应该是Example: (dfid ‘((a (b)) c(d))) should return: (c a c d a b c d)
需芁写䞀䞪计算深床的蟅助凜数
只可以䜿甚
numbers, symbols, variables
t , nil
defun, let, quote, ',
arithmetic/comparison operators : ,<=,>=,<,>,
boolean operators : and or not
List manipulation : first rest car cdr cons list append, null,
atomconditional forms
条件: if, cond,
十分感谢[image: 🙏]
--

--
Lisp-cn(Lisp䞭文甚户组)
CLUG http://lisp.org.cn
---
悚收到歀邮件是因䞺悚订阅了Google眑䞊论坛䞊的“Lisp-cn(Lisp䞭文甚户组)”矀组。
芁查看曎倚选项请访问https://groups.google.com/d/optout。