DijkstraCache< Scalar, Index > Struct Template Reference

Reusable scratch buffers for Dijkstra traversal. More...

#include <lagrange/internal/dijkstra.h>

Public Types
using	Entry = std::pair<Scalar, Index>

Public Attributes
std::priority_queue< Entry, std::vector< Entry >, std::greater< Entry > >	queue
std::vector< bool >	visited
std::vector< bool >	visited_edges
std::vector< bool >	chord_bridged
std::vector< Index >	edge_indices

Detailed Description

template<typename Scalar, typename Index>
struct lagrange::internal::DijkstraCache< Scalar, Index >

Reusable scratch buffers for Dijkstra traversal.

Avoids per-call allocation when dijkstra() is called repeatedly on the same mesh.

---

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

• lagrange/internal/dijkstra.h