edge.h

Dijkstra s Algorithm -- Shortest path (Dijkstra s Algorithm)

// Edge.h: interface for the CEdge class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_EDGE_H__7DA4D413_150C_4C94_AAE6_A5C1C4BA80AC__INCLUDED_)
#define AFX_EDGE_H__7DA4D413_150C_4C94_AAE6_A5C1C4BA80AC__INCLUDED_

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

class CEdge  
{
public:
	bool m_red;			// used to draw the result (if an edge it is a part of the shortest path it is drawn in red)
	double m_cost;		// the cost of an edge (picked randomly between 0-9)
	long m_secondNode;	// the second node number
	long m_firstNode;	// the first node number
	POINT m_secondPct;	// graphical elements for drawing the edges
	POINT m_firstPct;
	CEdge();
	virtual ~CEdge();

};
// the graph is oriented from the first node to the second node

#endif // !defined(AFX_EDGE_H__7DA4D413_150C_4C94_AAE6_A5C1C4BA80AC__INCLUDED_)