CAD4FE_ShortestPath.h

Aller à la documentation de ce fichier.

//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//  MAGiC
//####//  Jean Christophe Cuilliere et Vincent FRANCOIS
//####//  Departement de Genie Mecanique - UQTR
//####//------------------------------------------------------------
//####//  MAGIC est un projet de recherche de l equipe ERICCA
//####//  du departement de genie mecanique de l Universite du Quebec a Trois Rivieres
//####//  http://www.uqtr.ca/ericca
//####//  http://www.uqtr.ca/
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//
//####//       CAD4FE_ShortestPath.h
//####//
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//    COPYRIGHT 2000-2024
//####//  jeu 13 jun 2024 11:58:56 EDT
//####//------------------------------------------------------------
//####//------------------------------------------------------------
 
#ifndef CAD4FE_ShortestPathH
#define CAD4FE_ShortestPathH
 
#include <set>
 
#include "ot_mathematique.h"
 
#include "hypergraphlib_graph.h"
#include "hypergraphlib_node.h"
#include "hypergraphlib_arc.h"
#include "hypergraphlib_dijkstra.h"
#include "hypergraphlib_neato.h"
 
namespace Graph = HypergraphLib;
 
class MG_ELEMENT_TOPOLOGIQUE;
 
namespace CAD4FE {
 
class MCNode;
class MCFace ;
class PolySurface;
 
class ShortestPath
{
public:
    ~ShortestPath();
    double Find(std::vector <MCNode *> * __shortestPathNodes = 0, std::vector <MG_ELEMENT_TOPOLOGIQUE *> * __shortestPathTopo = 0);
    void InitializeAdjacencyGraph();
    MCNode * GetStartNode();
    MCNode * GetEndNode();
protected:
    double (*Distance)(Graph::Node * __a, Graph::Node * __b, Graph::Arc * __arc);
    MCFace * _mcFace;
    PolySurface * _polySurface; 
    MCNode * _mcNode[2];
    std::set <MCNode*> _facePoints;
    Graph::Graph * _intrAdjacencyGraph;
    std::vector <MCNode*> _shortestPath;
};
 
}
 
#endif