cgraph.h

我写的,画出最短路径,及最小生成树 Prim Dijistra算法+ GDI实现

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

#if !defined(AFX_CLIST_H__A38F898F_9836_49B3_A2A6_56FF3CC947DF__INCLUDED_)
#define AFX_CLIST_H__A38F898F_9836_49B3_A2A6_56FF3CC947DF__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#include <iostream.h>
class cList  
{
public:
	cList();
	virtual ~cList();
     
   
	struct Point
	{
         int Index;
		 double x,y;
			struct Adj
			{
				bool Visited;
				double Weight;
				struct Point *Address;
				struct Adj *Next; 
			}*AjNow;
        struct Adj *First;
		struct Point *Next;
		 
	}*Head,*Now,*Latest,*Bridge,*SNow;
	struct Path
	{
       struct Point *Address;
	   struct Path *Next;
	}*PHead,*PNow,*BHead,*BNow;
	void AddNew();
	bool IsNull();
	void SetAdj();
    void SearchPath();
private:
    int Max;
	double Min;
	double PathValue;
	int P[100];
	double D[100];
	bool Final[100];
	int Start;

};

#endif // !defined(AFX_CLIST_H__A38F898F_9836_49B3_A2A6_56FF3CC947DF__INCLUDED_)