stack.cpp

BFS、DFS、有向图、无向图中的各种算法的实现

#include "stdafx.h"
#include "stack.h"
stack::stack()
{
	pbottom = ptop = NULL;	
}
void stack::Push(int mark)
{
	StackNode* p = new StackNode;
	p->mark = mark;
	p->pnext = NULL;
	if(pbottom == NULL)
		pbottom = ptop = p;
	else{
		ptop->pnext = p;
		ptop = p;
	}
}
BOOL stack::FindInStack(int mark)
{
	if(pbottom == NULL)return FALSE;
	else{
		for(StackNode* p = pbottom;p;p = p->pnext)
			if(mark == p->mark)return TRUE;
		return FALSE;
	}
}