Gazebo Math

API Reference

7.5.1
gz/math/graph/Edge.hh File Reference
#include <cstdint>
#include <functional>
#include <map>
#include <ostream>
#include <set>
#include <gz/math/config.hh>
#include "gz/math/graph/Vertex.hh"

Go to the source code of this file.

Classes

class  DirectedEdge< E >
 A directed edge represents a connection between two vertices. The connection is unidirectional, it's only possible to traverse the edge in one direction (from the tail to the head). More...
 
class  Edge< E >
 Generic edge class. An edge has two ends and some constraint between them. For example, a directed edge only allows traversing the edge in one direction. More...
 
struct  EdgeInitializer< E >
 Used in the Graph constructors for uniform initialization. More...
 
class  UndirectedEdge< E >
 An undirected edge represents a connection between two vertices. The connection is bidirectional, it's possible to traverse the edge in both directions. More...
 

Namespaces

 gz
 
 gz::math
 
 gz::math::graph
 

Typedefs

using EdgeId = uint64_t
 The unique Id for an edge. More...
 
using EdgeId_S = std::set< EdgeId >
 
template<typename EdgeType >
using EdgeRef_M = std::map< EdgeId, std::reference_wrapper< const EdgeType > >