Caddy
A 2005 Roborodentia entry with vision and path planning capability
 All Data Structures Files Functions Variables Typedefs Macros Pages
Data Fields
GraphNode Struct Reference

Definition of each node (vertex) in the course map node. More...

#include <node_list.h>

Data Fields

uint8_t numAdjNodes
uint8_t adjNodes [MAX_ADJ_NODES]
uint8_t adjCosts [MAX_ADJ_NODES]
int8_t adjHeadings [MAX_ADJ_NODES]

Detailed Description

Definition of each node (vertex) in the course map node.

Defines the directions and distances to adjacent nodes.

Definition at line 91 of file node_list.h.

Field Documentation

uint8_t GraphNode::adjCosts[MAX_ADJ_NODES]

distances to adjacent nodes (6 inches increments)

Definition at line 104 of file node_list.h.

int8_t GraphNode::adjHeadings[MAX_ADJ_NODES]

directions towards adjacent nodes in 8-bit brads

Definition at line 108 of file node_list.h.

uint8_t GraphNode::adjNodes[MAX_ADJ_NODES]

node numbers of adjacent nodes

Definition at line 100 of file node_list.h.

uint8_t GraphNode::numAdjNodes

number of nodes adjacent to this node

Definition at line 96 of file node_list.h.


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