graph 6.0.0
Graph: generic attributed relational graphs
dedge.h
Go to the documentation of this file.
1/* This software and supporting documentation are distributed by
2 * Institut Federatif de Recherche 49
3 * CEA/NeuroSpin, Batiment 145,
4 * 91191 Gif-sur-Yvette cedex
5 * France
6 *
7 * This software is governed by the CeCILL-B license under
8 * French law and abiding by the rules of distribution of free software.
9 * You can use, modify and/or redistribute the software under the
10 * terms of the CeCILL-B license as circulated by CEA, CNRS
11 * and INRIA at the following URL "http://www.cecill.info".
12 *
13 * As a counterpart to the access to the source code and rights to copy,
14 * modify and redistribute granted by the license, users are provided only
15 * with a limited warranty and the software's author, the holder of the
16 * economic rights, and the successive licensors have only limited
17 * liability.
18 *
19 * In this respect, the user's attention is drawn to the risks associated
20 * with loading, using, modifying and/or developing or reproducing the
21 * software by the user in light of its specific status of free software,
22 * that may mean that it is complicated to manipulate, and that also
23 * therefore means that it is reserved for developers and experienced
24 * professionals having in-depth computer knowledge. Users are therefore
25 * encouraged to load and test the software's suitability as regards their
26 * requirements in conditions enabling the security of their systems and/or
27 * data to be ensured and, more generally, to use and operate it in the
28 * same conditions as regards security.
29 *
30 * The fact that you are presently reading this means that you have had
31 * knowledge of the CeCILL-B license and that you accept its terms.
32 */
33
34#ifndef GRAPH_GRAPH_DEDGE_H
35#define GRAPH_GRAPH_DEDGE_H
36
37
38//=============================================================================
39// H E A D E R F I L E S
40//=============================================================================
41
43#ifndef GRAPH_GRAPH_EDGE_H
44#include <graph/graph/edge.h>
45#endif
46
47
48//=============================================================================
49// C L A S S D E C L A R A T I O N
50//=============================================================================
51
55class GRAPH_API DEdge : public Edge
56{
57 /* Graph factories call the constructor
58 */
59 friend class GraphFactory;
60
61public:
62
63 virtual ~DEdge();
64
65 //---------------------------------------------------------------------
67 //---------------------------------------------------------------------
69
73 virtual bool isDirected() const;
74
78 virtual bool isUndirected() const;
79
81
82protected:
83
84 //---------------------------------------------------------------------
86 //---------------------------------------------------------------------
88
92 DEdge(std::string s);
93
98 DEdge(const DEdge& x);
99
104 virtual Edge* cloneEdge() const;
105
107
108private:
109
110 //---------------------------------------------------------------------
112 //---------------------------------------------------------------------
114
117 DEdge& operator=(const DEdge&);
118
120};
121
122
123#endif
virtual ~DEdge()
DEdge(const DEdge &x)
The programmer should not call the copy constructor.
virtual bool isUndirected() const
Is this edge undirected?
friend class GraphFactory
Definition dedge.h:59
DEdge(std::string s)
The programmer should not call the constructor.
virtual Edge * cloneEdge() const
The programmer should not clone.
virtual bool isDirected() const
Is this edge directed?
Edge(std::string s)
The programmer should not call the constructor.
#define GRAPH_API