求有向圖兩點間全部簡單路徑

ALGraph G; char way[G.vexnum]; way[0] = G.vertices[u].data; Status Findway_on_DG(ALGraph G,int u,int v,int found){ //在以鄰接表存儲的有向圖G中輸出從編號爲u的頂點到編號爲v的頂點的全部簡單路徑 //前found個頂點是已經肯定的頂點，初始調用Findway_on_D

>>阅读原文<<