dijkstra.h

这是帮那留学生做的第二个作业,里面有详细的文档资料,要求运用到 链表 图 和最短路径算法. Dijkstra

// Dijkstra.h: interface for the Dijkstra class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_DIJKSTRA_H__087A4D5E_139A_43B6_B93C_D6CDFAE9478E__INCLUDED_)
#define AFX_DIJKSTRA_H__087A4D5E_139A_43B6_B93C_D6CDFAE9478E__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include "connection.h"
#include "town.h"
#include "iostream.h"

#define Infinity 60000
#define NotAVertex (-1)

struct Table
{
	int known;
	int dist;
	int path;
};
class Dijkstra  
{
public:
	Dijkstra();
	virtual ~Dijkstra();
	int * findpath(town *towns,int number,int start);
private:
	Table *table;
};

#endif // !defined(AFX_DIJKSTRA_H__087A4D5E_139A_43B6_B93C_D6CDFAE9478E__INCLUDED_)