cgraphalgori.h

来自「图论算法中dijkstra、Floy、和最小生成树算法的实现」· C头文件 代码 · 共 34 行

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

#if !defined(AFX_CGRAPHALGORI_H__C9C2DA4E_8548_45CD_A6C8_47556F271D07__INCLUDED_)
#define AFX_CGRAPHALGORI_H__C9C2DA4E_8548_45CD_A6C8_47556F271D07__INCLUDED_

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

class CGraphAlgori  
{
public:
	CGraphAlgori();
	virtual ~CGraphAlgori();

//Operation
	//最小生成树算法Prim The minimum spanning tree
	int MinSpanTree_Prim(int n, double* pdR, int* piMinTree, double& dMinTreeFee);

	//最短路径Floy算法
	int MinDist_Floy(int n, double* pdR, double* pdMinDist, int* path);

	//根据最短路径Floy算法生成路径寻找S，E节点间的路径
	int GetPath(int S, int E, int n, int* path, PATH& PathSE/* PATH& PathSE*/);

//Attribution
	

};

#endif // !defined(AFX_CGRAPHALGORI_H__C9C2DA4E_8548_45CD_A6C8_47556F271D07__INCLUDED_)