Say if a visual novels is a graph with vertices as scenes, and edges as the choices to transition from this scene to others, it is trivial to use breadth-first search to find the shortest path from a source to a ending? Not sure what I'm missing since I don't play visual novels.