dhart.spatialstructures

Description

Store relationhships between points in space

The graph is a datastructure that contains a series of nodes and connections between them. Nodes can be created as 3D points in space or just a set of IDs.

Classes

CostAggregationType(value)	An enumeration.
CostAlgorithmKeys()	Contains the keys for each cost algorithm in Cost Algorithms
Direction(value)	An enumeration.
Edge()	Unimplemented for now
EdgeSumArray(vector_ptr, data_ptr, size)	Contains the scores for every node based on edges
Graph([graph_ptr])	A graph representing connections between points in space.
NodeList(vector_ptr, data_ptr)	A list of node structs from C++
NodeStruct	A point in space

Functions

CalculateCrossSlope(g)	Calculate cross slope for every edge in a graph and store it as a new cost type.
CalculateEnergyExpenditure(g)	Calculate EnergyExpenditure for every edge in a graph and store it as a new cost type.
CreateListOfNodeStructs(points)	Create an array of NodeStructs from a list of tuples.