#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//该结构体用来表示从某个顶点可以到达的其他顶点
struct ENode
{
int secPoint;//顶点号
ENode *next;//指向下一个顶点的指针
};
//该结构体表示每一个顶点的信息
struct PNode
{
char value;//顶点的值
int inDegree;
int outDegree;
ENode *next;//指向顶点可以到达的其他第一个顶点的指针
};
//图的结构体,该图最多有100个顶点
struct Map
{
PNode point[100];//数组的下标就是这个顶点的顶点号
int numPoint,numEdge;
};
//建图的函数
struct Map *CreateMap()
{
struct Map *mp = (struct Map*)malloc(sizeof(struct Map));
int i,j;
int firP,secP;
int numP,numE;
char infoP;
memset(mp,0,sizeof(struct Map));
printf("请输入顶点数和边数,格式为‘顶点数,边数’:\n");
scanf("%d,%d",&numP,&numE);
mp->numPoint = numP;
mp->numEdge = numE;
printf("请输入各个顶点的信息,没有分隔符的连续输入:\n");
fflush(stdin);
for(i=0;i<mp->numPoint;i++)
{
scanf("%c",&infoP);
mp->point[i].value = infoP;
}
printf("请输入边,格式为‘顶点-顶点’\n");
fflush(stdin);
for(j=0;j<mp->numEdge;j++)
{
scanf("%d-%d",&firP,&secP);
struct ENode *newNode = (struct ENode *)malloc(sizeof(struct ENode));
mp->point[firP].outDegree++;
mp->point[secP].inDegree++;
newNode->secPoint = secP;
newNode->next = mp->point[firP].next;
mp->point[firP].next = newNode;
}
return mp;
}
void PrintMap(struct Map *mp)
{
struct ENode *pNode;
printf("\n\n");
for(int i=0;i<mp->numPoint;i++)
{
printf("顶点号:%d 顶点值:%c 出度:%d 入度:%d\n",i,mp->point[i].value,mp->point[i].outDegree,mp->point[i].inDegree);
printf("可到达的顶点号:");
for(pNode = mp->point[i].next;pNode!=NULL;pNode = pNode->next)
{
printf("%d ",pNode->secPoint);
}
printf("\n\n");
}
}
int main()
{
struct Map *mp = CreateMap();
PrintMap(mp);
return 1;
}
#include <stdlib.h>
#include <string.h>
//该结构体用来表示从某个顶点可以到达的其他顶点
struct ENode
{
int secPoint;//顶点号
ENode *next;//指向下一个顶点的指针
};
//该结构体表示每一个顶点的信息
struct PNode
{
char value;//顶点的值
int inDegree;
int outDegree;
ENode *next;//指向顶点可以到达的其他第一个顶点的指针
};
//图的结构体,该图最多有100个顶点
struct Map
{
PNode point[100];//数组的下标就是这个顶点的顶点号
int numPoint,numEdge;
};
//建图的函数
struct Map *CreateMap()
{
struct Map *mp = (struct Map*)malloc(sizeof(struct Map));
int i,j;
int firP,secP;
int numP,numE;
char infoP;
memset(mp,0,sizeof(struct Map));
printf("请输入顶点数和边数,格式为‘顶点数,边数’:\n");
scanf("%d,%d",&numP,&numE);
mp->numPoint = numP;
mp->numEdge = numE;
printf("请输入各个顶点的信息,没有分隔符的连续输入:\n");
fflush(stdin);
for(i=0;i<mp->numPoint;i++)
{
scanf("%c",&infoP);
mp->point[i].value = infoP;
}
printf("请输入边,格式为‘顶点-顶点’\n");
fflush(stdin);
for(j=0;j<mp->numEdge;j++)
{
scanf("%d-%d",&firP,&secP);
struct ENode *newNode = (struct ENode *)malloc(sizeof(struct ENode));
mp->point[firP].outDegree++;
mp->point[secP].inDegree++;
newNode->secPoint = secP;
newNode->next = mp->point[firP].next;
mp->point[firP].next = newNode;
}
return mp;
}
void PrintMap(struct Map *mp)
{
struct ENode *pNode;
printf("\n\n");
for(int i=0;i<mp->numPoint;i++)
{
printf("顶点号:%d 顶点值:%c 出度:%d 入度:%d\n",i,mp->point[i].value,mp->point[i].outDegree,mp->point[i].inDegree);
printf("可到达的顶点号:");
for(pNode = mp->point[i].next;pNode!=NULL;pNode = pNode->next)
{
printf("%d ",pNode->secPoint);
}
printf("\n\n");
}
}
int main()
{
struct Map *mp = CreateMap();
PrintMap(mp);
return 1;
}