数据结构c语言版_拓扑排序（C language version of the data structure _ topological sorting）.doc

下载文档 降价啦

14
0
约6.36千字
约 20页
2017-07-24 发布于河南
举报
版权申诉
保障服务

数据结构c语言版_拓扑排序（C language version of the data structure _ topological sorting）.doc

1、本文档共20页，可阅读全部内容。
2、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

数据结构c语言版_拓扑排序（C language version of the data structure _ topological sorting）

数据结构c语言版_拓扑排序（C language version of the data structure _ topological sorting） * Data structure, C language version, topological sort P182 Compile environment: Dev-C++ 4.9.9.2 Date: February 15, 2011 * / #include stdio.h #include malloc.h Have / / output to a topological map of sequence. Algorithm 7.12 procedures / / the adjacency table storage representation #define MAX_NAME / / 3 vertices of the maximum length of a string +1 #define MAX_VERTEX_NUM 20 Typedef int InfoType; / / store network weights Typedef char VertexType[MAX_NAME]; / / string type Typedef enum{DG, DN, AG, AN}GraphKind; / / {directed graph, directed, undirected graph, undirected network} Typedef struct ArcNode { Int adjvex; / / the arc at the vertex position Struct ArcNode *nextarc; / / pointer to an arc InfoType *info; / / pointer) net weight }ArcNode; / / table node Typedef struct VNode { VertexType data; / / vertex information ArcNode *firstarc; / / the first table node address pointer to the first attachment of the vertex of arc }VNode, AdjList[MAX_VERTEX_NUM]; / / head Typedef struct { AdjList vertices; Int vexnum, arcnum; / / the graph vertices and arcs Int kind; / / symbol graph type }ALGraph; If the u in the G / / vertex, returns the vertex position in the graph; otherwise it returns -1. Int LocateVex (ALGraph, G, VertexType, U) { Int i; For (i=0; iG.vexnum; ++i) If (StrCmp (U, G.vertices[i].data) ==0) Return i; Return -1; } / / the adjacency list storage structure, no structural information related to the G (4 kinds of graphs with a function). Int CreateGraph (ALGraph *G) { Int, I, J, k; Int w; / / weight VertexType, VA, vb; ArcNode *p; Printf (enter the type of graph (digraph: 0, directed network: 1, undirected graph: 2, undirected network: 3).); Scanf (%d, (*G).Kind); Printf (enter the number of vertices and the number of edges: (spaces) \n); Scanf (%d%d, (*G).Vexnum, (*G).Arcnum; Printf (enter the value of%d vertices (%d characters): \n, (*G).Vexnum, MAX_NAME); For (I = 0; I .Vexnum