Do1phln的博客

个人拙见，难免有不足之处，望大佬们斧正P1#define MAXNODE 64#include <stdio.h>#include <stdlib.h>typedef struct Node //边的信息{ int adjvex; struct Node *next;}ArcNode;typedef struct VNode //顶点的信息{ int data; ArcNode *firstarc;}VexNode;

部分代码源自于lyjyyds#include <iostream>#include <stdio.h>#include <stdlib.h>#include <malloc.h>using namespace std;#define MAXSIZE 100#define OK 1#define ERROR 0typedef char SElemtype;typedef char Status;typedef struct StackNo

7039#include<iostream>#include<cstdio>using namespace std;const int MAX_NUM=100;int w;int mark[MAX_NUM];typedef int EdgeData;typedef struct Node{ int dest; EdgeData weight;//边权 struct Node *next;//next route}EdgeNode;

6110具体为何记录，待补充#include<stdio.h>#include<stdlib.h>#include<malloc.h>#define TRUE 1#define FALSE 0#define s toptypedef int Status;typedef struct Node{ char data; struct Node *next;}Node;Node *top;const Status isEmp

7075#include<iostream>#include<cstdio>using namespace std;typedef struct TNode{ char data; struct TNode *lchild, *rchild;}BiNode, *BiTree;BiTree T;void createTree(BiTree &T){ char ch; cin>>ch; if(ch=='@

欢迎加入NEFU计算机编程交流群：523539085顺序表4882#include<iostream>#include<stdlib.h>using namespace std;const int defaultSize = 10;class SeqList {protected: int *data; int maxSize; //表最大可容纳项数 int last; //当前表大小public: SeqList(int sz = defa

欢迎加入NEFU计算机编程交流群：523539085顺序栈4909#include<iostream>using namespace std;struct Node { int data; Node *next;};class SeqStack {private: int *array; int maxSize; int top; void stackFull();public: SeqStack(int sz=0); void Push(const