@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...
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.
Seems like there's a bug with the current implementation. Assuming an unread chapter, if I click on the button twice then the chapter should be marked as read first, and then unread later. Instead the read state doesn't change on the second click, and I have to refresh the page to mark it as...