資源簡介
很多涉及圖上操作的算法都是以圖的遍歷操作為基礎的、是寫一個程序,演示在連通的無向圖上訪問全部節點的操作。
代碼片段和文件信息
#include
#include?
#include??
#include?
#include??
//定義全局變量//????
#define?TRUE???????1?????
#define?FALSE???????0?????
#define??OK?????????1?????
#define?ERROR???????0?????
#define?NULL????????0?????
#define?OVERFLOW?????-2?????
#define?MAXSIZE???????100?????
#define?stack_init_size??100?????
#define?stackincrement???10?????
???
typedef?char???selemtype;????
typedef?char???qelemtype;????
typedef?char???elemtype;????
typedef?int???status;?????
char???e;????
char???demon[MAXSIZE];?
//定義函數//
//棧的類型和基本操作//
typedef?struct????
??{????
??selemtype???*base;????
??selemtype???*top;????
??int?????stacksize;????
??}sqstack;?
???
status?initstack?(sqstack?&s)?{
s.base?=?(selemtype?*)malloc(stack_init_size?*?sizeof?
- 上一篇:進程調度和內存管理算法實現
- 下一篇:c++封裝libev
評論
共有 條評論