#include <graph.h>
|
| | Graph ()=default |
| size_t | size () const |
| VertexDescriptor | add_vertex (const VertexType &vertex) |
| VertexDescriptor | add_vertex (VertexType &&vertex) |
| EdgeDescriptor | add_edge (VertexDescriptor source, VertexDescriptor target, const EdgeType &edge, bool bidirectional=false) |
| EdgeDescriptor | add_edge (VertexDescriptor source, VertexDescriptor target, EdgeType &&edge, bool bidirectional=false) |
| const EdgeType & | edge (EdgeDescriptor e) const |
| const VertexType & | vertex (VertexDescriptor v) const |
| const auto & | vertices () const |
| const auto & | edges () const |
| const auto & | adjacency_list () const |
| const auto | neighbors (VertexDescriptor v) const |
| auto | vertex (VertexDescriptor v) |
| auto | edge (EdgeDescriptor e) |
| auto | neighbors (VertexDescriptor v) |
| bool | is_connected (VertexDescriptor i, VertexDescriptor j) const |
| template<typename T> |
| void | depth_first_traversal (VertexDescriptor source, T &func) const |
| template<typename T> |
| void | breadth_first_traversal (VertexDescriptor source, T &func) const |
| template<typename T> |
| void | breadth_first_traversal_with_edge (VertexDescriptor source, T &func) const |
| template<typename T> |
| void | connected_component_traversal (T &func) |
| auto | connected_components () const |
| size_t | num_edges () const |
| size_t | num_vertices () const |
◆ AdjacencyList
template<typename VertexType, typename EdgeType>
Initial value:
ankerl::unordered_dense::map<VertexDescriptor, NeighborList>
◆ EdgeDescriptor
template<typename VertexType, typename EdgeType>
◆ Edges
template<typename VertexType, typename EdgeType>
◆ NeighborList
template<typename VertexType, typename EdgeType>
Initial value:
ankerl::unordered_dense::map<VertexDescriptor, EdgeDescriptor>
◆ VertexDescriptor
template<typename VertexType, typename EdgeType>
◆ Vertices
template<typename VertexType, typename EdgeType>
◆ Graph()
template<typename VertexType, typename EdgeType>
◆ add_edge() [1/2]
template<typename VertexType, typename EdgeType>
◆ add_edge() [2/2]
template<typename VertexType, typename EdgeType>
◆ add_vertex() [1/2]
template<typename VertexType, typename EdgeType>
◆ add_vertex() [2/2]
template<typename VertexType, typename EdgeType>
◆ adjacency_list()
template<typename VertexType, typename EdgeType>
◆ breadth_first_traversal()
template<typename VertexType, typename EdgeType>
template<typename T>
◆ breadth_first_traversal_with_edge()
template<typename VertexType, typename EdgeType>
template<typename T>
◆ connected_component_traversal()
template<typename VertexType, typename EdgeType>
template<typename T>
◆ connected_components()
template<typename VertexType, typename EdgeType>
◆ depth_first_traversal()
template<typename VertexType, typename EdgeType>
template<typename T>
◆ edge() [1/2]
template<typename VertexType, typename EdgeType>
◆ edge() [2/2]
template<typename VertexType, typename EdgeType>
◆ edges()
template<typename VertexType, typename EdgeType>
◆ is_connected()
template<typename VertexType, typename EdgeType>
◆ neighbors() [1/2]
template<typename VertexType, typename EdgeType>
◆ neighbors() [2/2]
template<typename VertexType, typename EdgeType>
◆ num_edges()
template<typename VertexType, typename EdgeType>
◆ num_vertices()
template<typename VertexType, typename EdgeType>
◆ size()
template<typename VertexType, typename EdgeType>
◆ vertex() [1/2]
template<typename VertexType, typename EdgeType>
◆ vertex() [2/2]
template<typename VertexType, typename EdgeType>
◆ vertices()
template<typename VertexType, typename EdgeType>
The documentation for this class was generated from the following file:
- /home/runner/work/occ/occ/include/occ/core/graph.h