gongshi wrote:
If you expect someone will do it for you, I think you probably expect too much...

If you wait, then you waste your own time...

Sorry to tell you the truth...

haoshuoqi wrote:
我是第一次在这里发贴也是个java初学者。如有不对之处望大家指出。
我的想法是：
首先从一个结点开始，依次将此结点所有的邻接结点压栈
while(栈不为空）
{
a=pop( );
if(a有邻接结点）
{
再将所有邻接结点压栈；
}
else
{
输出结点a的数据;
}
}

gongshi wrote:
Write recursive 深度优先算法 first, and make it work as required.

Then figure out how to change it to non-recursion.

This would be my strategy to do such things.

If you understand the first one thoroughly, then the second would be easy too.

If you don't, then you need to read a book, most books will tell you how to understand/do it.