Riccardo Elitropi
39 lines
1.1 KiB
C++
39 lines
1.1 KiB
C++
//----------------------------------------------------------------------------
|
|
// EgalTech 2015-2015
|
|
//----------------------------------------------------------------------------
|
|
// File : Dijkstra.h Data : 08.02.24 Versione : 2.6b1
|
|
// Contenuto : Classe per calcolo del percorso a peso minimo su un grafo orientato.
|
|
//
|
|
//
|
|
// Modifiche : 02.02.2024 RE Creazione modulo.
|
|
//
|
|
//
|
|
//----------------------------------------------------------------------------
|
|
|
|
#pragma once
|
|
|
|
#include "/EgtDev/Include/ENkDijkstra.h"
|
|
|
|
//----------------------------------------------------------------------------
|
|
#define MAXDIST 1073741823U // 2^30 - 1 per evitare overflow
|
|
|
|
//----------------------------------------------------------------------------
|
|
|
|
//----------------------------------------------------------------------------
|
|
class Dijkstra : public IDijkstra
|
|
{
|
|
public :
|
|
~Dijkstra( void) override ;
|
|
bool SetGraph( DBLMATRIX AdjMatrix, int nDestInd = -1) override ;
|
|
bool GetPath( INTVECTOR& vNodePath) override ;
|
|
|
|
public :
|
|
Dijkstra( void) ;
|
|
|
|
private :
|
|
int m_nDest ;
|
|
DBLMATRIX m_AdjMatrix ;
|
|
bool m_bValid ;
|
|
} ;
|
|
|