#ifndef _DIJKSTRA
#define _DIJKSTRA
#include "Dijkstra.h"
#include "stdio.h"
#include "stdlib.h"

typedef struct PathLink
{
	int node;
	struct PathLink *nextNode;
}Path,*p_path;

typedef struct NodeLink
{
	int node;            //節點編號
	int flag;            //加入標志
	Path path;           //最短路徑鏈表
	int distance;        //最短距離
}Node;
//extern Path Dijkstra(int A[][],Node B[],int n,int sourceNode,int destinationNode);
extern int  Get_Next_Grow_Node(Node A[],int n);
extern bool Output(Path nodePath);
extern void Insert_Path(Path &pathA,Path *pathB);
#endif