Skip to main content
Version: 3.7

Procedural Dungeon ⏵ Dungeon Graph ⏵ Has Valid Path

Has Valid Path

Class: Dungeon Graph
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) const

Inputs​

NameTypeDescription
InExec
TargetDungeon Graph Object Reference
FromRoom Object Reference
ToRoom Object Reference
Ignore Locked RoomsBoolean

Outputs​

NameTypeDescription
OutExec
YesBooleanReturns 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.