Collaboration diagram for s_heap:

Detailed Description

Used by the heap as its fundamental data structure.

index: Index (ID) of this routing resource node.
cost: Cost up to and including this node.
u.prev_node: Index (ID) of the predecessor to this node for use in traceback. NO_PREVIOUS if none.
u.next: pointer to the next s_heap structure in the free linked list. Not used when on the heap.
prev_edge: Index of the edge (between 0 and num_edges-1) used to connect the previous node to this one. NO_PREVIOUS if there is no previous node.
backward_path_cost: Used only by the timing-driven router. The "known" cost of the path up to and including this node. In this case, the .cost member contains not only the known backward cost but also an expected cost to the target.
R_upstream: Used only by the timing-driven router. Stores the upstream resistance to ground from this node, including the resistance of the node itself (rr_node[index].R).

Definition at line 22 of file route_common.h.