#include <directed_acyclic_graph.hpp>
|
using | Index_t = typename base_type::Index_t |
|
using | Index_t = int32_t |
|
using | AdjacencyList = iox::cxx::vector< VertexType *, DEGREE_LIMIT > |
|
|
static constexpr Index_t | INVALID_INDEX = -1 |
|
using | AdjacencyIndexList = iox::cxx::vector< Index_t, DEGREE_LIMIT > |
|
Index_t | findVertex (VertexType const *vertex) const |
|
bool | isValid (Index_t index) |
|
iox::cxx::vector< VertexData, VERTEX_LIMIT > | m_vertices |
|
size_t | m_numEdges {0} |
|
template<typename VertexType, int32_t VERTEX_LIMIT, int32_t DEGREE_LIMIT>
class DirectedAcyclicGraph< VertexType, VERTEX_LIMIT, DEGREE_LIMIT >
- Todo:
- : refine and move to utils same functionality as its parent class DirectedGraph, except that adding edges that close a cycle is impossible now (this incurs a checking overhead of course)
◆ addEdge()
template<typename VertexType , int32_t VERTEX_LIMIT, int32_t DEGREE_LIMIT>
virtual bool DirectedAcyclicGraph< VertexType, VERTEX_LIMIT, DEGREE_LIMIT >::addEdge |
( |
VertexType * |
fromVertex, |
|
|
VertexType * |
toVertex |
|
) |
| |
|
inlinevirtual |
The documentation for this class was generated from the following file: