1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
/**
* @file: graph_iface.h
* Interface of Graph library
*
* @defgroup GraphBase Graph
* @ingroup Core
*
* @brief Representation of graphs
*
* Graph representation is implemented through 3 tightly connected classes Graph, Node and Edge.
*/
/*
* Graph library, internal representation of graphs in ShowGraph tool.
* Copyright (c) 2009, Boris Shurygin
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef GRAPH_IFACE_H
#define GRAPH_IFACE_H
#include "predecls.h"
#include "edge.h"
#include "node.h"
#include "graph.h"
#include "agraph.h"
/* Edges traversal implementation */
#define ITERATE_NODE_EDGES(node, edge, dir) for ( edge = node->first##dir();\
isNotNullP( edge);\
edge = edge->next##dir())
/* Succs traverse implementation */
#define ITERATE_NODE_SUCCS(edge, node) for ( edge = node->firstSucc();\
isNotNullP( edge);\
edge = edge->nextSucc())
/* Preds traverse implementation */
#define ITERATE_NODE_PREDS(edge, node) for ( edge = node->firstPred();\
isNotNullP( edge);\
edge = edge->nextPred())
/**
* Convenience macro for traversing edges in given direction
* @ingroup GraphBase
* @param node A node that we use to get first edge
* @param edge An object of Edge type or subclass of Edge which is the loop variable
* @param dir 'Succ' or 'Pred'
*/
#ifndef ForEdges
# define ForEdges(node, edge, dir) ITERATE_NODE_EDGES(node, edge, dir)
#endif
/**
* Convenience macro for traversing successors of node
* @ingroup GraphBase
* @param edge An object of Edge type or subclass of Edge which is the loop variable
* @param node A node that we use to get first edge
*/
#ifndef foreachSucc
# define foreachSucc(edge, node) ITERATE_NODE_SUCCS(edge, node)
#endif
/**
* Convenience macro for traversing predecessors of node
* @ingroup GraphBase
* @param edge An object of Edge type or subclass of Edge which is the loop variable
* @param node A node that we use to get first edge
*/
#ifndef foreachPred
# define foreachPred(edge, node) ITERATE_NODE_PREDS(edge, node)
#endif
/* Graph's edges traverse implementation */
#define ITERATE_GRAPH_EDGES(edge, graph) for ( edge = graph->firstEdge();\
isNotNullP( edge);\
edge = edge->nextEdge())
/* Graph's nodes traverse implementation */
#define ITERATE_GRAPH_NODES(node, graph) for ( node = graph->firstNode();\
isNotNullP( node);\
node = node->nextNode())
/**
* Convenience macro for traversing edges in graph
* @ingroup GraphBase
* @param edge An object of Edge type or subclass of Edge which is the loop variable
* @param graph Graph of interest
*/
#ifndef foreachEdge
# define foreachEdge(edge, graph) ITERATE_GRAPH_EDGES(edge, graph)
#endif
/**
* Convenience macro for traversing nodes in graph
* @ingroup GraphBase
* @param node An object of Node type or subclass of Node which is the loop variable
* @param graph Graph of interest
*/
#ifndef foreachNode
# define foreachNode(node, graph) ITERATE_GRAPH_NODES(node, graph)
#endif
/* Implementation of inline functinality */
#include "edge_inline.h"
#include "node_inline.h"
#include "graph_inline.h"
#endif
|
