gnmgraph.h

/******************************************************************************
 * $Id$
 *
 * Project:  GDAL/OGR Geography Network support (Geographic Network Model)
 * Purpose:  GNM graph implementation.
 * Authors:  Mikhail Gusev (gusevmihs at gmail dot com)
 *           Dmitry Baryshnikov, polimax@mail.ru
 *
 ******************************************************************************
 * Copyright (c) 2014, Mikhail Gusev
 * Copyright (c) 2014-2015, NextGIS <info@nextgis.com>
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included
 * in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 ****************************************************************************/
 
#ifndef GNMGRAPH_H
#define GNMGRAPH_H
 
#include "cpl_port.h"
#if defined(__cplusplus) && !defined(CPL_SUPRESS_CPLUSPLUS)
#include <map>
#include <queue>
#include <set>
#include <vector>
#endif
 
// Alias for some big data type to store identificators.
#define GNMGFID GIntBig
// Graph constants
#define GNM_EDGE_DIR_BOTH 0      // bidirectional
#define GNM_EDGE_DIR_SRCTOTGT 1  // from source to target
#define GNM_EDGE_DIR_TGTTOSRC 2  // from target to source
 
#if defined(__cplusplus) && !defined(CPL_SUPRESS_CPLUSPLUS)
// Types declarations.
typedef std::vector<GNMGFID> GNMVECTOR, *LPGNMVECTOR;
typedef const std::vector<GNMGFID> GNMCONSTVECTOR;
typedef const std::vector<GNMGFID> *LPGNMCONSTVECTOR;
typedef std::pair<GNMGFID, GNMGFID> EDGEVERTEXPAIR;
typedef std::vector<EDGEVERTEXPAIR> GNMPATH;
 
struct GNMStdEdge
{
    GNMGFID nSrcVertexFID; 
    GNMGFID nTgtVertexFID; 
    bool bIsBidir;         
    double dfDirCost;      
    double dfInvCost;      
    bool bIsBlocked;       
};
 
struct GNMStdVertex
{
    GNMVECTOR anOutEdgeFIDs; 
    bool bIsBlocked;         
};
 
class CPL_DLL GNMGraph
{
  public:
    GNMGraph();
    virtual ~GNMGraph();
 
    // GNMGraph
 
    virtual void AddVertex(GNMGFID nFID);
 
    virtual void DeleteVertex(GNMGFID nFID);
 
    virtual void AddEdge(GNMGFID nConFID, GNMGFID nSrcFID, GNMGFID nTgtFID,
                         bool bIsBidir, double dfCost, double dfInvCost);
 
    virtual void DeleteEdge(GNMGFID nConFID);
 
    virtual void ChangeEdge(GNMGFID nFID, double dfCost, double dfInvCost);
 
    virtual void ChangeBlockState(GNMGFID nFID, bool bBlock);
 
    virtual bool CheckVertexBlocked(GNMGFID nFID) const;
 
    virtual void ChangeAllBlockState(bool bBlock = false);
 
    virtual GNMPATH DijkstraShortestPath(GNMGFID nStartFID, GNMGFID nEndFID);
 
    virtual std::vector<GNMPATH> KShortestPaths(GNMGFID nStartFID,
                                                GNMGFID nEndFID, size_t nK);
 
    virtual GNMPATH ConnectedComponents(const GNMVECTOR &anEmittersIDs);
 
    virtual void Clear();
 
  protected:
    virtual void
    DijkstraShortestPathTree(GNMGFID nFID,
                             const std::map<GNMGFID, GNMStdEdge> &mstEdges,
                             std::map<GNMGFID, GNMGFID> &mnPathTree);
    virtual GNMPATH
    DijkstraShortestPath(GNMGFID nStartFID, GNMGFID nEndFID,
                         const std::map<GNMGFID, GNMStdEdge> &mstEdges);
    virtual LPGNMCONSTVECTOR GetOutEdges(GNMGFID nFID) const;
    virtual GNMGFID GetOppositVertex(GNMGFID nEdgeFID,
                                     GNMGFID nVertexFID) const;
    virtual void TraceTargets(std::queue<GNMGFID> &vertexQueue,
                              std::set<GNMGFID> &markedVertIds,
                              GNMPATH &connectedIds);
 
  protected:
    std::map<GNMGFID, GNMStdVertex> m_mstVertices;
    std::map<GNMGFID, GNMStdEdge> m_mstEdges;
};
 
#endif  // __cplusplus
 
#endif /* GNMGRAPH_H */