qHexWalker 0.0.1
Hexagonal Grid Pathfinding & Maze Visualization on Interactive Maps
Loading...
Searching...
No Matches
H3AStar::Node Struct Reference

Internal node structure for A* priority queue. More...

+ Collaboration diagram for H3AStar::Node:

Public Member Functions

bool operator> (const Node &other) const
 Comparison operator for priority queue (min-heap).
 

Public Attributes

H3Index cell {}
 The H3 cell index.
 
double gScore {}
 Cost from start to this node.
 
double fScore {}
 Estimated total cost (gScore + heuristic).
 

Detailed Description

Internal node structure for A* priority queue.

Definition at line 108 of file astar.h.

Member Function Documentation

◆ operator>()

bool H3AStar::Node::operator> ( const Node other) const
inline

Comparison operator for priority queue (min-heap).

Parameters
otherThe other node to compare.
Returns
true if this node has higher fScore (lower priority).

Definition at line 118 of file astar.h.

References fScore.

Member Data Documentation

◆ cell

H3Index H3AStar::Node::cell {}

The H3 cell index.

Definition at line 109 of file astar.h.

Referenced by H3AStar::findLocalPathAtResolution(), and H3AStar::findPathAtResolution3().

◆ fScore

double H3AStar::Node::fScore {}

Estimated total cost (gScore + heuristic).

Definition at line 111 of file astar.h.

Referenced by operator>().

◆ gScore

double H3AStar::Node::gScore {}

Cost from start to this node.

Definition at line 110 of file astar.h.


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