Enums.h
Go to the documentation of this file.
1 /* Copyright (C) 2008 National Institute For Space Research (INPE) - Brazil.
2 
3  This file is part of the TerraLib - a Framework for building GIS enabled applications.
4 
5  TerraLib is free software: you can redistribute it and/or modify
6  it under the terms of the GNU Lesser General Public License as published by
7  the Free Software Foundation, either version 3 of the License,
8  or (at your option) any later version.
9 
10  TerraLib is distributed in the hope that it will be useful,
11  but WITHOUT ANY WARRANTY; without even the implied warranty of
12  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13  GNU Lesser General Public License for more details.
14 
15  You should have received a copy of the GNU Lesser General Public License
16  along with TerraLib. See COPYING. If not, write to
17  TerraLib Team at <terralib-team@terralib.org>.
18  */
19 
20 /*!
21  \file terralib/graph/Enums.h
22 
23  \brief General enumerations.
24  */
25 
26 #ifndef __TERRALIB_GRAPH_INTERNAL_ENUMS_H
27 #define __TERRALIB_GRAPH_INTERNAL_ENUMS_H
28 
29 namespace te
30 {
31  namespace graph
32  {
33 
34  enum GraphType
35  {
36  Undirect = 0, // A graph in which edges have no orientation.
37  Direct = 1, // A directed graph or digraph is an ordered pair D = (V, A)
38  Mixed = 2, // A mixed graph G is a graph in which some edges may be directed and some may be undirected.
39  Multi = 3, // The term "multigraph" is generally understood to mean that multiple edges (and sometimes loops) are allowed.
40  Simple = 4, // As opposed to a multigraph, a simple graph is an undirected graph that has no loops and no more than one edge between any two different vertices.
41  Weighted = 5, // A graph is a weighted graph if a number (weight) is assigned to each edge.
42  HalfEdges = 6 // In exceptional situations it is even necessary to have edges with only one end.
43  };
44 
46  {
47  Regular = 0, // A regular graph is a graph where each vertex has the same number of neighbors.
48  Complete = 1, // Complete graphs have the feature that each pair of vertices has an edge connecting them.
49  Finite = 2, // A finite graph is a graph G = (V, E) such that V and E are finite sets.
50  Infinite = 3, // An infinite graph is one with an infinite set of vertices or edges or both.
51  Connected = 4, // A graph is called connected if every pair of distinct vertices in the graph is connected.
52  Disconnected = 5 // A graph is called disconnected if at least one pair of distinct vertices in the graph is not connected.
53  };
54 
56  {
57  Edge_List = 0, // Using this mode a table with edge list information will be used to store this graph >> edge_id | vertex_from | vertex_to
58  Vertex_List = 1 // Using this mode a table with vertex list information will be used to store this graph >> vertex_ix | edges_in | edges_out
59  };
60 
62  {
63  Vertex_Attr = 0, // Using this attr type will associate this attribute to vertex object
64  Edge_Attr = 1 // Using this attr type will associate this attribute to edge object
65  };
66 
67  } // end namespace graph
68 } // end namespace te
69 
70 #endif // __TERRALIB_GRAPH_INTERNAL_ENUMS_H
71 
GraphClass
Definition: Enums.h:45
GraphStorageMode
Definition: Enums.h:55
URI C++ Library.
GraphType
Definition: Enums.h:34
GraphAttrType
Definition: Enums.h:61