DHART
|
Contains definitions for the Graph class. More...
#include <robin_hood.h>
#include <vector>
#include <Edge.h>
#include <Node.h>
#include <Eigen>
#include <iostream>
Go to the source code of this file.
Classes | |
struct | HF::SpatialStructures::CSRPtrs |
A struct to hold all necessary information for a CSR. More... | |
struct | HF::SpatialStructures::Subgraph |
A Subgraph consists of a parent Node m_parent and a container of Edge m_edges such that all Edge in m_edges extend from m_parent. More... | |
class | HF::SpatialStructures::EdgeCostSet |
A set of edge costs for a graph. More... | |
class | HF::SpatialStructures::Graph |
A Graph of nodes connected by edges that supports both integers and HF::SpatialStructures::Node. More... | |
Namespaces | |
namespace | Eigen |
Eigen a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. | |
namespace | HF |
Perform human scale analysis on 3D environments. | |
namespace | HF::SpatialStructures |
Contains standard fundamental data structures for representing space used throughout DHARTAPI. | |
Typedefs | |
using | HF::SpatialStructures::EdgeMatrix = Eigen::SparseMatrix< float, 1 > |
The type of matrix the graph uses internally. More... | |
using | HF::SpatialStructures::TempMatrix = Eigen::Map< const EdgeMatrix > |
A mapped matrix of EdgeMatrix. Only owns pointers to memory. More... | |
Enumerations | |
enum class | HF::SpatialStructures::COST_AGGREGATE : int { HF::SpatialStructures::SUM = 0 , HF::SpatialStructures::AVERAGE = 1 , HF::SpatialStructures::COUNT = 2 } |
Methods of aggregating the costs for edges for each node in the graph. More... | |
enum class | HF::SpatialStructures::Direction : int { HF::SpatialStructures::INCOMING = 0 , HF::SpatialStructures::OUTGOING = 1 , HF::SpatialStructures::BOTH = 2 } |
Node to use for calculating the cost of an edge when converting node attributes to edge costs. More... | |
struct HF::SpatialStructures::Subgraph |
A Subgraph consists of a parent Node m_parent and a container of Edge m_edges such that all Edge in m_edges extend from m_parent.
Class Members | ||
---|---|---|
vector< Edge > | m_edges | The edges that extend from m_parent. |
Node | m_parent | The parent node from which all Edge in m_edges extend. |