pathFinding.h

Go to the documentation of this file.

/****************************************************************************
 *   This file is part of the aGrUM/pyAgrum library.                        *
 *                                                                          *
 *   Copyright (c) 2005-2026 by                                             *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *                                                                          *
 *   The aGrUM/pyAgrum library is free software; you can redistribute it    *
 *   and/or modify it under the terms of either :                           *
 *                                                                          *
 *    - the GNU Lesser General Public License as published by               *
 *      the Free Software Foundation, either version 3 of the License,      *
 *      or (at your option) any later version,                              *
 *    - the MIT license (MIT),                                              *
 *    - or both in dual license, as here.                                   *
 *                                                                          *
 *   (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html)    *
 *                                                                          *
 *   This aGrUM/pyAgrum library is distributed in the hope that it will be  *
 *   useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,          *
 *   INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or 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.                                        *
 *                                                                          *
 *   See LICENCES for more details.                                         *
 *                                                                          *
 *   SPDX-FileCopyrightText: Copyright 2005-2026                            *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *   SPDX-License-Identifier: LGPL-3.0-or-later OR MIT                      *
 *                                                                          *
 *   Contact  : info_at_agrum_dot_org                                       *
 *   homepage : http://agrum.gitlab.io                                      *
 *   gitlab   : https://gitlab.com/agrumery/agrum                           *
 *                                                                          *
 ****************************************************************************/
 

#ifndef GUM_GRAPH_PATH_FINDING_H
#define GUM_GRAPH_PATH_FINDING_H
 
#include <optional>
#include <vector>
 
#include <agrum/agrum.h>
 
#include <agrum/base/graphs/graphConcepts.h>
 
namespace gum::graph {
 
  namespace detail {
    inline std::vector< NodeId >
        reconstructPath(const NodeProperty< NodeId >& mark, NodeId n1, NodeId n2);
  }   // namespace detail
 
  // =========================================================================
  // Directed graphs (GUM_DiGraphable)
  // =========================================================================

  template < GUM_DiGraphable G >
  std::optional< std::vector< NodeId > > directedPath(const G& g, NodeId n1, NodeId n2);

  template < GUM_DiGraphable G >
  std::optional< std::vector< NodeId > > directedUnorientedPath(const G& g, NodeId n1, NodeId n2);

  template < GUM_DiGraphable G >
  bool hasDirectedPath(const G& g, NodeId from, NodeId to);
 
  // =========================================================================
  // Undirected graphs (GUM_UndiGraphable)
  // =========================================================================

  template < GUM_UndiGraphable G >
  std::optional< std::vector< NodeId > > undirectedPath(const G& g, NodeId n1, NodeId n2);

  template < GUM_UndiGraphable G >
  bool hasUndirectedPath(const G& g, NodeId n1, NodeId n2);

  template < GUM_UndiGraphable G >
  bool hasUndirectedPath(const G& g, NodeId n1, NodeId n2, const NodeSet& except);

  template < GUM_UndiGraphable G >
  bool hasUndirectedPath(const G& g, const NodeSet& n1, const NodeSet& n2, const NodeSet& except);
 
  // =========================================================================
  // Mixed graphs (GUM_MixedGraphable)
  // =========================================================================

  template < GUM_MixedGraphable G >
  std::optional< std::vector< NodeId > > mixedOrientedPath(const G& g, NodeId n1, NodeId n2);

  template < GUM_MixedGraphable G >
  bool hasMixedOrientedPath(const G& g, NodeId n1, NodeId n2);

  template < GUM_MixedGraphable G >
  std::optional< std::vector< NodeId > > mixedUnorientedPath(const G& g, NodeId n1, NodeId n2);
 
}   // namespace gum::graph
 
#include <agrum/base/graphs/algorithms/generic/pathFinding_tpl.h>
 
#endif   // GUM_GRAPH_PATH_FINDING_H