Procedural Dungeon ⏵ Dungeon Graph ⏵ Has Valid Path
Has Valid Path
Category: Dungeon Graph
Description
Returns wether a path is valid between 2 rooms (no locked room blocking the way)
Note: Could be pure, but since it can be heavy duty for large dungeons, keep it impure to avoid duplicate calls.
Node
C++
bool HasValidPath(const URoom* From, const URoom* To, bool IgnoreLockedRooms)
Inputs
Name | Type | Description |
---|---|---|
In | Exec | |
Target | Dungeon Graph Object Reference | |
From | Room Object Reference | |
To | Room Object Reference | |
Ignore Locked Rooms | Boolean |
Outputs
Name | Type | Description |
---|---|---|
Out | Exec | |
Yes | Boolean | Returns wether a path is valid between 2 rooms (no locked room blocking the way) Note: Could be pure, but since it can be heavy duty for large dungeons, keep it impure to avoid duplicate calls. |