[Geometry Dash 2.2] PARALLEL Flood Fill Algorithm
1LEVEL - 113142764
NOTE - The time complexity of this algorithm is O(1) each iteration across O(N) iterations. That's O(N).
PSEUDOCODE
This assumes the neighbors of each node can be determined in O(1) as in the example here where they are simply the four nodes up/right/down/left of the current one. The algorithm itself is a variation on Breadth-First Search.
FLOOD-FILL(src):
N = number of NODES
Set all nodes as NOT MARKED
Set src as MARKED
FOR ITER in [1 ... N]:
FOR v in NODES (Parallel):
IF v Has A MARKED neighbor:
Set v as MARKED
ENDIF
ENDFOR
ENDFOR
MUSIC - Nighthawk22 | Isolation
keywords: robtop, robert topola, robtop games, geometry dash, geometry dash 2.2, flood fill
Other Videos By A Person Who Exists Somewhere
Other Statistics
Geometry Dash Statistics For A Person Who Exists Somewhere
At present, A Person Who Exists Somewhere has 9,781 views spread across 44 videos for Geometry Dash, and less than an hour worth of Geometry Dash videos were uploaded to his channel. This is less than 0.51% of the total video content that A Person Who Exists Somewhere has uploaded to YouTube.