摘要：作业18 #include <iostream> #define N 5 using namespace std; void main() { double *p; double max,min,temp; p=new double[N]; for (int i=0;i<N;i++) cin>>*( 阅读全文

摘要：作业15 #include <iostream> #include <string> using namespace std; class People { public: string number; string name; string id_number; public: People(){ 阅读全文

摘要：邻接矩阵定义 const int vnum=20; typedef struct gp { VertexType vexs[vnum]; //顶点信息 int arcs[vnum][vnum]; //邻接矩阵 int vexnum,arcnum; }Graph; 带权图的邻接矩阵 int最大整数：3 阅读全文