数据结构之基于深度优先搜索，输出无向图中给定的两个顶点之间的所有路径

#include <iostream>


using namespace std;


struct StackNode
{
int data;
StackNode *next;
};


void push(StackNode *&S,int e)
{
StackNode *p=new StackNode;
p->data=e;
p->next=S;
S=p;
}


int pop(StackNode *&S)
{
int e=S->data;

StackNode *p=S;
S=S->next;
delete p;