|
ACTS
Experiment-independent tracking
|
Uses the geometry implementations to walk through their graph-like structure breadth first. More...
#include <detray/navigation/volume_graph.hpp>
Classes | |
| struct | edge_generator |
| Builds graph edges from the detector mask collection on the fly. More... | |
| struct | node_generator |
| Builds a graph node from the detector collections on the fly. More... | |
Public Types | |
| using | edge_type = typename edge_generator::edge |
| Type representing a volume graph edge. | |
| using | geo_obj_ids = typename detector_t::geo_obj_ids |
| Geometry object identifier type provided by the detector. | |
| using | mask_container_t = typename detector_t::mask_container |
| Detector mask container type. | |
| using | node_type = typename node_generator::node |
| Type representing a volume graph node. | |
| using | volume_container_t = vector_t<typename detector_t::volume_type> |
| Container type used to access detector volumes. | |
Public Member Functions | |
| volume_graph ()=delete | |
| Default constructor. | |
| volume_graph (const detector_t &det) | |
| Build from existing nodes and edges, which are provide by the detector. | |
| ~volume_graph ()=default | |
| Default destructor: we don't own anything. | |
| const auto & | adjacency_matrix () const |
| const auto & | edges () const |
| dindex | n_edges (dindex volume_id) const |
| dindex | n_nodes () const |
| const auto & | nodes () const |
| std::string | to_dot_string () const |
| std::string | to_string () const |
| Walks breadth first through the geometry objects. | |
Uses the geometry implementations to walk through their graph-like structure breadth first.
| detector_t | the type of geometry we want to walk along. |
| node_inspector | the type of inspection to perform when a node is visited |
|
explicit |
Build from existing nodes and edges, which are provide by the detector.
| det | provides: geometry volumes that become the graph nodes, surfaces which are needed to index the correct masks and the masks that link to volumes and become graph edges. |
| const auto & detray::volume_graph< detector_t, node_inspector, vector_t >::adjacency_matrix | ( | ) | const |
| const auto & detray::volume_graph< detector_t, node_inspector, vector_t >::edges | ( | ) | const |
| dindex detray::volume_graph< detector_t, node_inspector, vector_t >::n_edges | ( | dindex | volume_id | ) | const |
| volume_id | index of the volume whose half-edges are counted |
| dindex detray::volume_graph< detector_t, node_inspector, vector_t >::n_nodes | ( | ) | const |
| const auto & detray::volume_graph< detector_t, node_inspector, vector_t >::nodes | ( | ) | const |
| std::string detray::volume_graph< detector_t, node_inspector, vector_t >::to_dot_string | ( | ) | const |
| std::string detray::volume_graph< detector_t, node_inspector, vector_t >::to_string | ( | ) | const |
Walks breadth first through the geometry objects.