@Tanterei Yeah I'm assuming that all edges are weighless / have the weight of 1. If we factor in the weight (that is, choosing this choice makes reaching a scene faster than another choice) then Dijkstra would be more appropriate. My point though is that this is a solved problem, not something like TSP, so it would be weird to do research on a solved problem.
@tkmisere
Please tell me I'm not seeing things and that is truly Ibarada.
@tuankiet65
From my experience it's not that strange to research a "solved" problem. In mathematical terms it shows that a solution exists but the question remains "is it the sole solution", i.e., is it unique, and if not, then is it the optimal solution?
So they're obviously playing an expy of Melee (Gamecube, L-cancel, wavedashing, despite character portrait oddity)
But, in defiance of the [No Items, Fox Only, Final Destination] tryhard memes:
*Items are on (Stars)
*3-player free-for-alls instead on 1-on-1 (might actually be 4-P if there's a CPU as well)
*Not even the restricted stage list (actually looks like Brawl's Rumble Falls, also not tourney legal)