AABB
AlignmentBehavior
ArriveBehavior
AStar
BFS
BoundingSphere
BVH
BVHNode
Cell
CellSpacePartitioning
CohesionBehavior
CompositeGoal
ConvexHull
Corridor
CostTable
DFS
Dijkstra
Edge
EntityManager
EvadeBehavior
EventDispatcher
Behavior
FollowPathBehavior
FuzzyAND
FuzzyCompositeTerm
FuzzyFAIRLY
FuzzyModule
FuzzyOR
FuzzyRule
FuzzySet
FuzzyTerm
FuzzyVariable
FuzzyVERY
GameEntity
Goal
GoalEvaluator
Graph
GraphUtils
HalfEdge
HeuristicPolicyDijkstra
HeuristicPolicyEuclid
HeuristicPolicyEuclidSquared
HeuristicPolicyManhattan
InterposeBehavior
LeftSCurveFuzzySet
LeftShoulderFuzzySet
LineSegment
Logger
MathUtils
Matrix3
Matrix4
MemoryRecord
MemorySystem
MeshGeometry
MessageDispatcher
MovingEntity
NavEdge
NavMesh
NavMeshLoader
NavNode
Node
NormalDistFuzzySet
OBB
ObstacleAvoidanceBehavior
OffsetPursuitBehavior
OnPathBehavior
Path
Plane
Polygon
Polyhedron
PriorityQueue
PursuitBehavior
Quaternion
Ray
RectangleTriggerRegion
Regular
RightSCurveFuzzySet
RightShoulderFuzzySet
SAT
SeekBehavior
SeparationBehavior
SingletonFuzzySet
Smoother
SphericalTriggerRegion
State
StateMachine
SteeringBehavior
SteeringManager
Task
TaskQueue
Telegram
Think
Time
TriangularFuzzySet
Trigger
TriggerRegion
Vector3
Vehicle
Version
WanderBehavior

Yuka.js库 - target

简介

target是Yuka库中DFS(深度优先算法)的一个辅助函数,用于查找一个节点的所有可达节点,并返回它们的数组。

用法

import { Graph, target } from 'yuka';

const graph = new Graph();
// 添加节点和边
const nodeA = graph.addNode();
const nodeB = graph.addNode();
graph.connect(nodeA, nodeB);

// 调用target函数,查找nodeA的所有可达节点
const reachableNodes = target(nodeA);

console.log(reachableNodes); // 输出[nodeA, nodeB]

参数

  • node {GraphNode} - 要查找的节点。

返回值

  • {Array.<GraphNode>} - 所有可达节点的数组,包括目标节点自身。

注意事项

  • target返回的节点顺序不确定,但包括目标节点自身。如果需要特定的遍历顺序,请使用graph.traverse函数。