带权有向图中心点的选取

 #include <stdio.h>  
#include <stdlib.h>  
#include <string.h>  
#define alloc(type) (type*)malloc(sizeof(type))  
#define MAX_NUM 3.14E38  
#define TRUE 1  
#define FALSE 0  
#define NODE_NUM 8  

struct adj_list{  
int index;  
char name[10];  
float len;  
struct adj_list *next;  
};  
typedef struct adj_list Node;  

//node[]为起始节点数组  
int dijkstra(Node node[],int size,int first,float distance[],int previous[]){  
//初始化数组  
int *isused=new int[size];  
for(int i=0;i<size;i++){  
distance[i]=MAX_NUM;  
isused[i]=FALSE;  
previous[i]=-1;  
}  
//初始起始节点和邻接节点间的距离  
Node *pos=node[first].next;  
if(pos==NULL)  
return 0;