dijkstra_ta.h

数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统；输入为出发城市和目标城市, 输出为最短路径和距离。

// Dijkstra_TA.h : main header file for the DIJKSTRA_TA application
//

#if !defined(AFX_DIJKSTRA_TA_H__225DC5AE_F17B_4264_91BD_DC2767D1D934__INCLUDED_)
#define AFX_DIJKSTRA_TA_H__225DC5AE_F17B_4264_91BD_DC2767D1D934__INCLUDED_

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

#ifndef __AFXWIN_H__
	#error include 'stdafx.h' before including this file for PCH
#endif

#include "resource.h"       // main symbols

/////////////////////////////////////////////////////////////////////////////
// CDijkstra_TAApp:
// See Dijkstra_TA.cpp for the implementation of this class
//

class CDijkstra_TAApp : public CWinApp
{
public:
	CDijkstra_TAApp();

// Overrides
	// ClassWizard generated virtual function overrides
	//{{AFX_VIRTUAL(CDijkstra_TAApp)
	public:
	virtual BOOL InitInstance();
	//}}AFX_VIRTUAL

// Implementation
	//{{AFX_MSG(CDijkstra_TAApp)
	afx_msg void OnAppAbout();
		// NOTE - the ClassWizard will add and remove member functions here.
		//    DO NOT EDIT what you see in these blocks of generated code !
	//}}AFX_MSG
	DECLARE_MESSAGE_MAP()
};


/////////////////////////////////////////////////////////////////////////////

//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.

#endif // !defined(AFX_DIJKSTRA_TA_H__225DC5AE_F17B_4264_91BD_DC2767D1D934__INCLUDED_)