Finds the closest, directly connected node to the current node. This method examines the node's list of connected nodes and finds the edge that has the smallest weight and whose node's Visited property equals the Visited parameter.
If there is no directly connected nodes, this function returns nil.
Namespace: GGraph
Delphi |
public |
Parameters
Visited
Type: Boolean
Return Value
Type: TGGraphNode
Reference•Visited |
