数据结构作业系统 - 第七章答案

InfoType *info; //该弧相关信息的指针(可无)

}ArcCell,AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; typedef struct {

AdjMatrixarcs; //邻接矩阵

VertexType vexs[MAX_VERTEX_NUM]; //顶点向量 GraphKindkind; //图的种类标志 }MGraph;

int SimplePath(MGraph G, int i, int j, int k)

/*求有向图G的顶点i到j之间长度为k的简单路径条数*/{int sum=0,v; if( G.arcs[i][j].adj &&k==1 && !visited[j]) sum=1; else if(k>1) {visited[i]=1;

for(v=0;v

sum+=SimplePath(G,v,j,k-1);}visited[i]=0;}return sum;}实现下列函数： int Search(SSTable s, KeyType k); /* Index the element which key is k */ /* in StaticSearchTable s.*/ /* Return 0 if x is not found.*/

静态查找表的类型SSTable定义如下：

13 / 14

typedef struct { KeyType key; ... ...//其他数据域 } ElemType; typedef struct { ElemType *elem; intlength; } SSTable;

int Search(SSTable a, KeyType k) /* Index the element which key is k*/ /* in StaticSearchTable s.*/ /* Return 0 if x is not found.*/{int i; for(i=1;i<=a.length;i++) if(a.elem[i].key==k)return i; return 0;}

14 / 14