BIN fnc findPath: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "| arma3 " to "|game1= arma3 ") |
Lou Montana (talk | contribs) m (Text replacement - "<code>(\[[a-zA-Z0-9_, ]*\] )?(call|spawn) \[\[(BI[NS]\_fnc\_[a-zA-Z0-9_]+)\]\];?<\/code>" to "<sqf>$1$2 $3;</sqf>") |
||
| (10 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{RV|type=function | {{RV|type=function | ||
|game1= arma3 | |game1= arma3 | ||
|version1= 1.94 | |||
|1.94 | |||
|gr1= Movement | |gr1= Movement | ||
| <pre>/* | |descr= <pre>/* | ||
Description: | Description: | ||
| Line 23: | Line 22: | ||
Returns: | Returns: | ||
ARRAY of NUMBERs - indexes of nodes which are traversed on the way to the ending point | ARRAY of NUMBERs - indexes of nodes which are traversed on the way to the ending point | ||
*/ | */</pre> | ||
{{placeholder}} {{Feature|arma3contact}} | {{Wiki|placeholder}} {{Feature|arma3contact}} | ||
| <!-- [] call [[BIN_fnc_findPath]] | |s1= <!-- [] call [[BIN_fnc_findPath]] --> | ||
|p1= | |p1= | ||
| | |r1= | ||
|x1= <!-- <sqf>[] call BIN_fnc_findPath;</sqf> --> | |||
|seealso= | |||
}} | |||
Latest revision as of 13:06, 5 May 2022
Description
- Description:
/* Description: A* search algorithm. Uses hard-coded Manhattan distance to measure distance. Parameter(s): 0: ARRAY of ARRAYs in format: 0: NUMBER - node cost 1: ARRAY - array of neighbor indexes 2: ARRAY - XYZ position of the node, used to measure distance from end pos 1: NUMBER - index of starting point 2: NUMBER - index of ending point Returns: ARRAY of NUMBERs - indexes of nodes which are traversed on the way to the ending point */
This content is exclusive to the Arma 3 Contact Expansion.- Execution:
- call
- Groups:
- Movement
Syntax
- Syntax:
- Syntax needed
- Return Value:
- Return value needed
Examples
- Examples:
- Example needed
Additional Information
- See also:
- See also needed
Notes
-
Report bugs on the Feedback Tracker and/or discuss them on the Arma Discord or on the Forums.
Only post proven facts here! Add Note