Click here to Skip to main content
15,886,008 members
Articles / Programming Languages / C++

Dijkstra Algorithm

Rate me:
Please Sign up or sign in to vote.
4.43/5 (40 votes)
23 Dec 20033 min read 368.3K   22.3K   102  
Shortest path (Dijkstra's Algorithm)
// Graph.h: interface for the CGraph class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_GRAPH_H__0A20F055_21B0_4D48_A1F0_E916CFF57053__INCLUDED_)
#define AFX_GRAPH_H__0A20F055_21B0_4D48_A1F0_E916CFF57053__INCLUDED_

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

#include "StdAfx.h"

class CGraph  
{
public:
	long GetNrNodes();
	CGraph();
	virtual ~CGraph();
	VTYPE_NODE m_nodes;	// array of nodes
	VTYPE_EDGE m_edges;	// array of edges
	VTYPE_NODE_P d;		//	array of longs that contain the shortest path at every step
	VTYPE_NODE_P pi;	//  array of longs that contain the predecessor of each node for the shortest path
};

#endif // !defined(AFX_GRAPH_H__0A20F055_21B0_4D48_A1F0_E916CFF57053__INCLUDED_)

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here


Written By
Web Developer
Romania Romania
Education Computer Engineering Faculty 1994-1999
University of Iasi ? Romania
Engineering degree: system and computers
Specialty: programmer analyst
License: (Computer Engineering Faculty) 2000
Master: (Distributed Computing) 2001 - 2002
Final Project: Remote Access. Encrypted file transfer.
Accessing any computer?s desktop through Internet or LAN.
Technologies: COM, ATL, API, SDK, MFC

Comments and Discussions