|
马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
程序运行了一会,但什么都没显示
截取了一部分出来。。可以编译。
- #include <stdio.h>
- #include <stdlib.h>
- #define MAXVEX 14
- //边表结点
- typedef struct EdgeNode
- {
- int adjvex;
- int weight;
- struct EdgeNode *next;
- } EdgeNode;
- //顶点表结点
- typedef struct VertexNode
- {
- int in;
- int data;
- EdgeNode *firstedge;
- } VertexNode,AdjList[MAXVEX];
- //这个表
- typedef struct
- {
- AdjList adjList;
- int numVertexes,numEdges;
- } graphAdjList,*GraphAdjList;
- void CreateALGraph(GraphAdjList GL)
- {
- int i;
- EdgeNode *e;
- GL->numEdges = 20;
- GL->numVertexes = 14;
- for(i = 0; i < GL->numVertexes; ++i)
- {
- GL->adjList[i].data = i;
- }
- }
- int main()
- {
- GraphAdjList G;
- CreateALGraph(&G);
- printf("%d",G->numEdges);
- return 0;
- }
复制代码
- #include <stdio.h>
- #include <stdlib.h>
- #define MAXVEX 14
- typedef struct Node_of_Edge
- {
- int adjvex;
- int weight;
- struct EdgeNode *next;
- }EdgeNode;
- typedef struct Node_of_Vertex
- {
- int in;
- int data;
- EdgeNode *firstedge;
- }VertexNode, AdjList[MAXVEX];
- typedef struct Adjacent_Graph_List
- {
- AdjList adjList;
- int numVertexes, numEdges;
- }GraphAdjList;
- void CreateALGraph(GraphAdjList ** G)
- {
- int i;
- EdgeNode *e;
- *G = (GraphAdjList *)malloc(sizeof(GraphAdjList));
- (*G)->numEdges = 20;
- (*G)->numVertexes = 14;
- for (i = 0; i < (*G)->numVertexes; ++i)
- {
- (*G)->adjList[i].data = i;
- }
- }
- int main()
- {
- GraphAdjList *G;
- CreateALGraph(&G);
- printf("%d", G->numEdges);
- return 0;
- }
复制代码暂时能用
|
|