Classes | |
| class | AbstractCachePolicy |
| This class is used to set the main functions of a cache policy. More... | |
| class | AbstractCachePolicyFactory |
| This is the abstract factory for cache policy. More... | |
| class | AbstractGraph |
| Abstract class used to define the main functions of graph struct. All graph implementations must used this class. More... | |
| class | AbstractGraphBuilder |
| This abstract class provides the common functions for graph builder classes. Each builder strategy has to implement only a public function called build. More... | |
| class | AbstractGraphFactory |
| This is the abstract factory for Graphs. More... | |
| class | AbstractGraphLoaderStrategy |
| This class define the main functions necessary to save and load the graph data and metadata information using the Graph Cache conception. More... | |
| class | AbstractGraphLoaderStrategyFactory |
| This is the abstract factory for graph loader strategy. More... | |
| class | AbstractIterator |
| This class defines a commun interface to represents a graph iterator class. The main diferency to anothers iterators is the possibility to iterate over the edges or vertexs from a graph. More... | |
| class | AddDeepAttribute |
| This class defines a function used to add to a graph the deep information attribute. More... | |
| class | AddRasterAttribute |
| This class defines a function used to add to a graph the raster pixel value as attribute. More... | |
| class | BidirectionalGraph |
| This is a implementation of a Bidirectional Graph. By convention a bidirectional graph provides access to out-and in edges. More... | |
| class | BidirectionalGraphFactory |
| class | BottomUpLoaderStrategy |
| This class implements the main functions necessary to save and load the graph data and metadata information using as strategy the graph path. More... | |
| class | BoxIterator |
| This class defines a commun interface to represents a graph iterator class. The main diferency to anothers iterators is the possibility to iterate over the edges or vertexs from a graph. More... | |
| class | BoxLoaderStrategy |
| This class implements the main functions necessary to save and load the graph data and metadata information using as strategy a bounding box to create a region that defines a group of elements. More... | |
| class | BoxLoaderStrategyFactory |
| This is the concrete factory for the database box loader strategy. More... | |
| class | DataSourceGraphMetadata |
| Class used to define the graph metadata informations over a SGBD source. More... | |
| class | DirectedGraph |
| This is a implementation of a Directed Graph. By convention a directed graph provides access to out-edges only. More... | |
| class | DirectedGraphFactory |
| This is the concrete factory for the directed Graph type. More... | |
| class | Edge |
| Class used to define the edge struct of a graph. Its compose with a identifier, the vertex origin and destiny information, a set of properties if exist and flags to inform his state (new or dirty). More... | |
| class | EdgeProperty |
| This class is used to define a set of properties of a Edge. More... | |
| class | FIFOCachePolicy |
| This class is used to implement the FIFO cache policy. More... | |
| class | FIFOCachePolicyFactory |
| This is the concrete factory for the FIFO cache policy. More... | |
| class | FlowGraphBuilder |
| This class defines the Flow strategy to build a graph. More... | |
| class | GetSubGraph |
| This class defines a function used to get a sub graph for a graph. More... | |
| class | Globals |
| An static class with global definitions for the TerraLib Graph Module. More... | |
| class | Graph |
| This is the main graph implementation, that uses a cache policy anda graph loader to get all elements inside a data source. More... | |
| class | GraphCache |
| Class used to manager the graph data elements. This class uses a cache policy to control the elements in memory. If a element was requested and not found in cache, the GraphDataManager is used to loaded a new GraphData. More... | |
| class | GraphData |
| This class define a important struct used to group a map of vertex and edges. A flag is used to indicate if any element of this group was changed. More... | |
| class | GraphDataManager |
| class | GraphFactory |
| This is the concrete factory for the commung Graph type. More... | |
| class | GraphMetadata |
| Class used to define the graph metadata informations. More... | |
| class | Layer |
| A Layer is a reference to a virtual dataset with/without geometric attributes. More... | |
| class | LayerRenderer |
| It renders the objects associated to a Layer. More... | |
| class | LDDGraphBuilder |
| This strategy is based on Serio Rosim method, using this "mask" is possible extract a graph from a LDD image. More... | |
| class | LFUCachePolicy |
| This class is used to implement the LFU cache policy. More... | |
| class | LFUCachePolicyFactory |
| This is the concrete factory for the LFU cache policy. More... | |
| class | MemoryIterator |
| class | Module |
| This singleton defines the TerraLib Graph module entry. More... | |
| class | QueryGraphBuilder |
| This class defines the Query strategy to build a graph having a exist graph as input parameters. More... | |
| class | QueryIterator |
| This class defines a commun interface to represents a graph iterator class. The main diferency to anothers iterators is the possibility to iterate over the edges or vertexs from a graph. More... | |
| class | RAGGraphBuilder |
| This class defines the RAG strategy to build a graph,. More... | |
| class | SequenceIterator |
| class | SequenceLoaderStrategy |
| This class implements the main functions necessary to save and load the graph data and metadata information using as strategy a "order by" to create a sequence of objects. More... | |
| class | SequenceLoaderStrategyFactory |
| This is the concrete factory for the database sequency loader strategy. More... | |
| class | TopDownLoaderStrategy |
| This class implements the main functions necessary to save and load the graph data and metadata information using as strategy the graph path. More... | |
| class | UndirectedGraph |
| This is a implementation of a UndirectedGraph Graph. By definition a undirected graph has no direction information about his edges. More... | |
| class | UndirectedGraphFactory |
| This is the concrete factory for the undirected Graph type. More... | |
| class | Vertex |
| From the point of view of graph theory, vertices are treated as featureless and indivisible objects, although they may have additional structure depending on the application from which the graph arises;for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects. More... | |
| class | VertexProperty |
| This class is used to define a set of properties of a Vertex. More... | |
Enumerations | |
| enum | GraphAttrType { Vertex_Attr = 0, Edge_Attr = 1 } |
| enum | GraphClass { Regular = 0, Complete = 1, Finite = 2, Infinite = 3, Connected = 4, Disconnected = 5 } |
| enum | GraphStorageMode { Edge_List = 0, Vertex_List = 1 } |
| enum | GraphType { Undirect = 0, Direct = 1, Mixed = 2, Multi = 3, Simple = 4, Weighted = 5, HalfEdges = 6 } |
| enum te::graph::GraphType |
1.8.10 
