Yun_Ge的博客

#include<stdio.h>#include<iostream>#define MAXL 100typedef int KeyType;typedef char InfoType;typedef struct{ KeyType key; InfoType data;}RecType;void Display(RecType R[], int n)...

#include<stdio.h>#include<iostream>#include<malloc.h>#define MAXE 20 //线性表中最多元素个数#define MAXR 10 //基数的最大取值typedef struct node{ int key; struct node *next;}NodeType;...

#include<stdio.h>#include<iostream>#include<malloc.h>#define MAXL 100typedef int KeyType;typedef char InfoType;typedef struct{ KeyType key; InfoType data;}RecType;void Cre...

#include<stdio.h>#include<iostream>#define MAXL 100typedef int KeyType;typedef char InfoType;typedef struct{ KeyType key; InfoType data;}RecType;void swap(RecType &x, RecType...

#include<stdio.h>#include<iostream>#define MAXL 100typedef int KeyType;typedef char InfoType;typedef struct{ KeyType key; InfoType data;}RecType;void swap(RecType &x, RecType...

#include<stdio.h>#include<iostream>#define MAXL 100typedef int KeyType;typedef char InfoType;typedef struct{ KeyType key; InfoType data;}RecType;void CreateList(RecType R[], KeyT...

#include<stdio.h>#include<iostream>#define MAXL 100typedef int KeyType;typedef char InfoType;typedef struct{ KeyType key; InfoType data;}RecType;void swap(RecType &x, RecType...

#include<stdio.h>#include<iostream>#define MAXL 100typedef int KeyType;typedef char InfoType;typedef struct{ KeyType key; InfoType data;}RecType;void Display(RecType R[], int n)...

#include<stdio.h>#include<iostream>#define MAXL 100typedef int KeyType;typedef char InfoType;typedef struct{ KeyType key; InfoType data;}RecType;void Display(RecType R[], int n)...

利用Dijkstra算法求下图中从顶点a到其他各顶点间的最短路径，写出执行算法过程中各步的状态。解答：注：path中记录的该结点的前一个结点的标号，暂时不能到达的置为-1。 1. S={a} U={b,c,d,e,f,g}dist[ ] = { 0,15,2,12,∞,∞,∞ } path[ ] = { a,a,a,a,-1,-1,-1 } 2. S = { a,c } ...