MIRA
Public Member Functions | Static Public Member Functions | List of all members
TopoMap Class Reference

#include <topomap/TopoMap.h>

Public Member Functions

 TopoMap ()
 
template<typename Reflector >
void reflect (Reflector &r)
 
void clear ()
 removes all content and starts with an empty graph More...
 
NodePtr getRoot ()
 
template<typename Visitor >
void visitNodes (Visitor &&visitor)
 Calls the operator()(NodePtr node) of the given visitor for each node (recurses the tree recursively in depth-first order) More...
 
GraphElementPtr findElement (const std::string &predicate)
 Returns the graph element with the given predicate, or NULL if no such element exists. More...
 
const GraphElementPtr findElement (const std::string &predicate) const
 
NodePtr createNode (NodePtr parent=NodePtr())
 
GatewayNodePtr createGatewayNode (NodePtr node)
 
LinkPtr createLink (GatewayNodePtr from, GatewayNodePtr to, bool bidirektional=true, double costs=0.0)
 
void dumpGraphviz (std::ostream &os, bool hideIntraLinks=false)
 

Static Public Member Functions

static TopoMapPtr create ()
 
static NodePtr lowestCommonAncestor (NodePtr m, NodePtr n)
 Returns the lowest common ancestor of the two nodes, or rises an XLogical exception, if both nodes are not part of the same TopoMap. More...
 

Constructor & Destructor Documentation

◆ TopoMap()

TopoMap ( )

Member Function Documentation

◆ create()

static TopoMapPtr create ( )
inlinestatic

◆ reflect()

void reflect ( Reflector &  r)
inline

◆ clear()

void clear ( )

removes all content and starts with an empty graph

◆ getRoot()

NodePtr getRoot ( )
inline

◆ visitNodes()

void visitNodes ( Visitor &&  visitor)
inline

Calls the operator()(NodePtr node) of the given visitor for each node (recurses the tree recursively in depth-first order)

◆ findElement() [1/2]

GraphElementPtr findElement ( const std::string &  predicate)

Returns the graph element with the given predicate, or NULL if no such element exists.

◆ findElement() [2/2]

const GraphElementPtr findElement ( const std::string &  predicate) const

◆ lowestCommonAncestor()

static NodePtr lowestCommonAncestor ( NodePtr  m,
NodePtr  n 
)
static

Returns the lowest common ancestor of the two nodes, or rises an XLogical exception, if both nodes are not part of the same TopoMap.

◆ createNode()

NodePtr createNode ( NodePtr  parent = NodePtr())

◆ createGatewayNode()

GatewayNodePtr createGatewayNode ( NodePtr  node)

◆ createLink()

LinkPtr createLink ( GatewayNodePtr  from,
GatewayNodePtr  to,
bool  bidirektional = true,
double  costs = 0.0 
)

◆ dumpGraphviz()

void dumpGraphviz ( std::ostream &  os,
bool  hideIntraLinks = false 
)

The documentation for this class was generated from the following file: