11 2014 档案

最小生成树(普里姆算法)
摘要：#include#include#include #define INFINITY INT_MAX#define MAX_VERTEX_NUM 20#define OK 1#define ERROR -1#define TRUE 1#define FALSE 0typedef enum{DG , ... 阅读全文
posted @ 2014-11-30 21:08 gaot 阅读(414) 评论(0) 推荐(0)
邻接表的深度优先搜索(DFS)
摘要：#include#include#define INFINITY INT_MAX#define MAX_VERTEX_NUM 20#define OK 1#define ERROR -1#define TRUE 1#define FALSE 0typedef enum{DG , DN, UDG, U... 阅读全文
posted @ 2014-11-29 23:54 gaot 阅读(541) 评论(0) 推荐(0)
邻接图的广度优先搜索(BFS)
摘要：//----------以无向网为例---------#include#include#define INFINITY INT_MAX#define MAX_VERTEX_NUM 20#define OK 1#define ERROR -1#define TRUE 1#define FALSE 0t... 阅读全文
posted @ 2014-11-29 16:09 gaot 阅读(320) 评论(0) 推荐(0)
邻接表的基本操作(无向网)
摘要：#includeusing namespace std;#define MAX_VERTEX_NUM 20#define OK 1#define ERROR -1typedef int InfoType;typedef int VertexType;typedef int Status;typede... 阅读全文
posted @ 2014-11-28 21:30 gaot 阅读(1624) 评论(0) 推荐(0)
中序线索化二叉树
摘要：#include#include#define OK 1#define ERROR 0#define OVERFLOW 0typedef enum PointerTag{Link,Thread};// Link == 0:指针，Thread=1:线索typedef char TElemType;//... 阅读全文
posted @ 2014-11-27 20:33 gaot 阅读(417) 评论(0) 推荐(0)
邻接矩阵的基本操作
摘要：#includeusing namespace std;#define INFINITY INT_MAX#define MAX_VERTEX_NUM 20#define OK 1#define ERROR 0//typedef enum{DG , DN, UDG, UDN} GraphKind;//... 阅读全文
posted @ 2014-11-27 20:19 gaot 阅读(879) 评论(0) 推荐(0)