m0_62518283的博客

粗略介绍

图解堆排序

#include <iostream>using namespace std;#define MAXSIZE 101typedef struct { float coef; //系数 int expn; //指数}Polynomial;typedef struct { Polynomial* elem; int length;}SqList;void seletSort(SqList& L) { //选择排序 Polynomial temp; fo.

JAVASE大作业内容，用于结课报告

typedef struct ArcNode { char adjvex; ArcNode* nextArc; int weight;}ArcNode,*pArcNode;typedef struct VNode { char date; pArcNode firstArc;}VNode,*pVNode;typedef struct { pVNode vert; int vexnum, arcnum;}ALGraph;void Dijkstra(ALGraph G, i.

typedef struct ArcNode { char adjvex; ArcNode* nextArc; int weight;}ArcNode,*pArcNode;typedef struct VNode { char date; pArcNode firstArc;}VNode,*pVNode;typedef struct { pVNode vert; int vexnum, arcnum;}ALGraph;typedef struct Ed{ char Hea.

typedef struct ArcNode { char adjvex; ArcNode* nextArc; int weight;}ArcNode,*pArcNode;typedef struct VNode { char date; pArcNode firstArc;}VNode,*pVNode;typedef struct { pVNode vert; int vexnum, arcnum;}ALGraph;typedef struct cdge { char .