A

各种排序#include <stdlib.h>#include <iostream>#include<time.h>#include<math.h>using namespace std;//*************************数据元素class RedType{public: int key; //关键字项};//************************顺序表class SqList{ RedType r

邻接表，深度优先/广度优先搜索方式遍历图#include<iostream>#include<cstring>#define MaxV 100 //宏定义最大顶点数using namespace std;int visited[MaxV]; //设置标记数组typedef struct ArcNode{ int adjvex; //邻接点域，存储该邻点顶点对应

（1）栈的顺序存储结构操作#include<stdio.h>#include<windows.h>#include<stdlib.h>#define len 30void showmenu();//菜单显示void processmenu();//菜单控制void create();//创建一个栈void destroy();//销毁一个栈vo...