COIN-OR::LEMON - Graph Library

Changeset 2260:4274224f8a7d in lemon-0.x for lemon/topology.h


Ignore:
Timestamp:
10/24/06 19:19:16 (13 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3016
Message:

concept -> concepts (namespace & directory)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/topology.h

    r2111 r2260  
    2626#include <lemon/maps.h>
    2727
    28 #include <lemon/concept/graph.h>
    29 #include <lemon/concept/ugraph.h>
     28#include <lemon/concepts/graph.h>
     29#include <lemon/concepts/ugraph.h>
    3030#include <lemon/concept_check.h>
    3131
     
    5454  template <typename UGraph>
    5555  bool connected(const UGraph& graph) {
    56     checkConcept<concept::UGraph, UGraph>();
     56    checkConcept<concepts::UGraph, UGraph>();
    5757    typedef typename UGraph::NodeIt NodeIt;
    5858    if (NodeIt(graph) == INVALID) return true;
     
    7979  template <typename UGraph>
    8080  int countConnectedComponents(const UGraph &graph) {
    81     checkConcept<concept::UGraph, UGraph>();
     81    checkConcept<concepts::UGraph, UGraph>();
    8282    typedef typename UGraph::Node Node;
    8383    typedef typename UGraph::Edge Edge;
     
    127127  template <class UGraph, class NodeMap>
    128128  int connectedComponents(const UGraph &graph, NodeMap &compMap) {
    129     checkConcept<concept::UGraph, UGraph>();
     129    checkConcept<concepts::UGraph, UGraph>();
    130130    typedef typename UGraph::Node Node;
    131131    typedef typename UGraph::Edge Edge;
    132     checkConcept<concept::WriteMap<Node, int>, NodeMap>();
     132    checkConcept<concepts::WriteMap<Node, int>, NodeMap>();
    133133
    134134    typedef NullMap<Node, Edge> PredMap;
     
    245245  template <typename Graph>
    246246  bool stronglyConnected(const Graph& graph) {
    247     checkConcept<concept::Graph, Graph>();
     247    checkConcept<concepts::Graph, Graph>();
    248248
    249249    typedef typename Graph::Node Node;
     
    303303  template <typename Graph>
    304304  int countStronglyConnectedComponents(const Graph& graph) {
    305     checkConcept<concept::Graph, Graph>();
     305    checkConcept<concepts::Graph, Graph>();
    306306
    307307    using namespace _topology_bits;
     
    372372  template <typename Graph, typename NodeMap>
    373373  int stronglyConnectedComponents(const Graph& graph, NodeMap& compMap) {
    374     checkConcept<concept::Graph, Graph>();
     374    checkConcept<concepts::Graph, Graph>();
    375375    typedef typename Graph::Node Node;
    376376    typedef typename Graph::NodeIt NodeIt;
    377     checkConcept<concept::WriteMap<Node, int>, NodeMap>();
     377    checkConcept<concepts::WriteMap<Node, int>, NodeMap>();
    378378
    379379    using namespace _topology_bits;
     
    435435  template <typename Graph, typename EdgeMap>
    436436  int stronglyConnectedCutEdges(const Graph& graph, EdgeMap& cutMap) {
    437     checkConcept<concept::Graph, Graph>();
     437    checkConcept<concepts::Graph, Graph>();
    438438    typedef typename Graph::Node Node;
    439439    typedef typename Graph::Edge Edge;
    440440    typedef typename Graph::NodeIt NodeIt;
    441     checkConcept<concept::WriteMap<Edge, bool>, EdgeMap>();
     441    checkConcept<concepts::WriteMap<Edge, bool>, EdgeMap>();
    442442
    443443    using namespace _topology_bits;
     
    731731  template <typename UGraph>
    732732  int countBiNodeConnectedComponents(const UGraph& graph) {
    733     checkConcept<concept::UGraph, UGraph>();
     733    checkConcept<concepts::UGraph, UGraph>();
    734734    typedef typename UGraph::NodeIt NodeIt;
    735735
     
    775775  int biNodeConnectedComponents(const UGraph& graph,
    776776                                UEdgeMap& compMap) {
    777     checkConcept<concept::UGraph, UGraph>();
     777    checkConcept<concepts::UGraph, UGraph>();
    778778    typedef typename UGraph::NodeIt NodeIt;
    779779    typedef typename UGraph::UEdge UEdge;
    780     checkConcept<concept::WriteMap<UEdge, int>, UEdgeMap>();
     780    checkConcept<concepts::WriteMap<UEdge, int>, UEdgeMap>();
    781781
    782782    using namespace _topology_bits;
     
    815815  template <typename UGraph, typename NodeMap>
    816816  int biNodeConnectedCutNodes(const UGraph& graph, NodeMap& cutMap) {
    817     checkConcept<concept::UGraph, UGraph>();
     817    checkConcept<concepts::UGraph, UGraph>();
    818818    typedef typename UGraph::Node Node;
    819819    typedef typename UGraph::NodeIt NodeIt;
    820     checkConcept<concept::WriteMap<Node, bool>, NodeMap>();
     820    checkConcept<concepts::WriteMap<Node, bool>, NodeMap>();
    821821
    822822    using namespace _topology_bits;
     
    10581058  template <typename UGraph>
    10591059  int countBiEdgeConnectedComponents(const UGraph& graph) {
    1060     checkConcept<concept::UGraph, UGraph>();
     1060    checkConcept<concepts::UGraph, UGraph>();
    10611061    typedef typename UGraph::NodeIt NodeIt;
    10621062
     
    11011101  template <typename UGraph, typename NodeMap>
    11021102  int biEdgeConnectedComponents(const UGraph& graph, NodeMap& compMap) {
    1103     checkConcept<concept::UGraph, UGraph>();
     1103    checkConcept<concepts::UGraph, UGraph>();
    11041104    typedef typename UGraph::NodeIt NodeIt;
    11051105    typedef typename UGraph::Node Node;
    1106     checkConcept<concept::WriteMap<Node, int>, NodeMap>();
     1106    checkConcept<concepts::WriteMap<Node, int>, NodeMap>();
    11071107
    11081108    using namespace _topology_bits;
     
    11421142  template <typename UGraph, typename UEdgeMap>
    11431143  int biEdgeConnectedCutEdges(const UGraph& graph, UEdgeMap& cutMap) {
    1144     checkConcept<concept::UGraph, UGraph>();
     1144    checkConcept<concepts::UGraph, UGraph>();
    11451145    typedef typename UGraph::NodeIt NodeIt;
    11461146    typedef typename UGraph::UEdge UEdge;
    1147     checkConcept<concept::WriteMap<UEdge, bool>, UEdgeMap>();
     1147    checkConcept<concepts::WriteMap<UEdge, bool>, UEdgeMap>();
    11481148
    11491149    using namespace _topology_bits;
     
    12061206    using namespace _topology_bits;
    12071207
    1208     checkConcept<concept::Graph, Graph>();
    1209     checkConcept<concept::WriteMap<typename Graph::Node, int>, NodeMap>();
     1208    checkConcept<concepts::Graph, Graph>();
     1209    checkConcept<concepts::WriteMap<typename Graph::Node, int>, NodeMap>();
    12101210
    12111211    typedef typename Graph::Node Node;
     
    12481248    using namespace _topology_bits;
    12491249
    1250     checkConcept<concept::Graph, Graph>();
    1251     checkConcept<concept::ReadWriteMap<typename Graph::Node, int>, NodeMap>();
     1250    checkConcept<concepts::Graph, Graph>();
     1251    checkConcept<concepts::ReadWriteMap<typename Graph::Node, int>, NodeMap>();
    12521252
    12531253    typedef typename Graph::Node Node;
     
    12911291  bool dag(const Graph& graph) {
    12921292
    1293     checkConcept<concept::Graph, Graph>();
     1293    checkConcept<concepts::Graph, Graph>();
    12941294
    12951295    typedef typename Graph::Node Node;
     
    13321332  template <typename UGraph>
    13331333  bool acyclic(const UGraph& graph) {
    1334     checkConcept<concept::UGraph, UGraph>();
     1334    checkConcept<concepts::UGraph, UGraph>();
    13351335    typedef typename UGraph::Node Node;
    13361336    typedef typename UGraph::NodeIt NodeIt;
     
    13651365  template <typename UGraph>
    13661366  bool tree(const UGraph& graph) {
    1367     checkConcept<concept::UGraph, UGraph>();
     1367    checkConcept<concepts::UGraph, UGraph>();
    13681368    typedef typename UGraph::Node Node;
    13691369    typedef typename UGraph::NodeIt NodeIt;
     
    14031403  template<typename UGraph>
    14041404  inline bool bipartite(const UGraph &graph){
    1405     checkConcept<concept::UGraph, UGraph>();
     1405    checkConcept<concepts::UGraph, UGraph>();
    14061406   
    14071407    typedef typename UGraph::NodeIt NodeIt;
     
    14401440  template<typename UGraph, typename NodeMap>
    14411441  inline bool bipartitePartitions(const UGraph &graph, NodeMap &partMap){
    1442     checkConcept<concept::UGraph, UGraph>();
     1442    checkConcept<concepts::UGraph, UGraph>();
    14431443   
    14441444    typedef typename UGraph::Node Node;
Note: See TracChangeset for help on using the changeset viewer.