图和最短路径

图的相关操作

数据结构:邻接矩阵

图的种类：有向图

图的操作：增删顶点和增删边

代码：

#include "stdio.h"

#define MAXINT 30000
#define MAXNODE 100
typedef char elemtype;
typedef struct
{
    elemtype vexs[MAXNODE];
    int arc_matrix[MAXNODE][MAXNODE];
    int vex_num, arc_num;
}amgraph;

void create_graph(amgraph *graph);
void print_graph(amgraph graph);
int locate_vex(char *vexs, char vex);
int insert_vex(amgraph *graph, char vex);
void delete_vex(amgraph *graph, char vex);
void delete(char *vexs, char vex);
void in