# ManYue branching comics: manually log nodes, choices and return routes Language: en Canonical: [ManYue branching comics: manually log nodes, choices and return routes]() 中文：[中文 HTML]() English: [English HTML]() Published: 2026-11-06T00:00:00+08:00 Modified: 2026-11-06T12:13:22+08:00 Author: Bison Map branch prompts to actual page identities and log conditions, visited nodes and loops without assuming rule execution or automatic route saving. English translation of the [Chinese original](), translated on 2026-11-06. Original publication dates, attribution, code and version notes are retained. Some comics direct readers to another page or section, so file order need not form a single story route. Build a manual node log for an authorised branching sample in ManYue. Nodes are personal records, not a new interactive feature. The reader checks choices and saves routes without reordering files or expecting the reader to run a game. ## Confirm that the work supplies branch instructions Choose an authorised short branching comic and record work, edition, starting node and rule location. Read rules first, distinguishing active choice, conditional jump and ordinary cross-reference; a contents list is not automatically branching. Printed-only page references may need digital mapping. Validate one short route rather than bypassing conditions to collect every ending. Exclude wagering or real-world action requirements: this exercise concerns fictional reading choices, not performing characters’ tasks outside the book. ## Separate node names from file locations Log the original node number or title, together with the current chapter, actual page identity and a recognisable image. In an invented example, start A leads to B or C and possibly D; these need not be four adjacent pages. For “go to page twelve,” distinguish printed number from image index, which covers and inserts can offset. Resolve unclear numbers through target titles instead of accepting a near match. Label personal codes as provisional, not official routes or automatically recognised nodes. ## Record each choice condition and destination For each node, record options, conditions, destination and any return requirement, not just an arrow. In the invented case, A’s window choice goes to B and door choice to C; neither is declared better. Check prerequisite reading in your log rather than assuming it. Mark unstated conditions unknown instead of inventing them from an ending. Separate chosen and unchosen options so candidates do not become visited history. Application progress follows its own scope and cannot replace branch history. ## Verify the destination after arriving Reach the target through available chapter/page navigation or manual turning, then inspect title and surrounding imagery to exclude a same-numbered different volume. Built-in links are unnecessary, and no unverified branch button is required. For a discontinuous opening at B, check numbering, edition and prerequisites before alleging plot error. Add B-to-D only after actually reading that instruction, not to beautify the diagram. Each destination needs evidence so the log reflects encountered instructions rather than desired connections. ## Keep state when a route loops If D sends you to A, log the loop and whether prior choices persist. It may be intentional or a numbering mismatch; check rules rather than deleting repeats to reach an ending. Keep any fictional token manually without assuming app rule execution. You may stop when no termination rule is clear, labelling this paused rather than story-complete. Do not mark the whole file fully read after one loop; keep unvisited branches recorded separately. One loop does not make every branch read. Route completion and finishing the whole file remain different states. ## Leave and resume from your own route Bookmark current node and rules where supported, logging travelled order, latest choice, next target and unresolved conditions. Leave and return, verifying the content anchor instead of assuming resume position preserves branch state. Save the first route before trying another choice in a separate record. Image favourites do not automatically save decisions. Remap nodes after edition changes because old image indexes may fail; verify start and one branch destination before continuing. ## Distinguish convergence from a loop If B and C both lead to D, log convergence rather than a duplicated file page. In the invented case, routes may reach D with different knowledge or conditions; one node does not erase earlier state. D returning to A instead forms a recorded loop. Check target identity and entry conditions before drawing relations. Mark unvisited branches untravelled rather than assuming convergence from another route. Retain nodes and choice history so a neat arrow diagram does not remove required conditions. ## Finish one reproducible route record A permitted reader should be able to identify start, choice, destination and stopping point. Branches can depart from file order, destinations can require particular entry conditions, and returning to start can be intentional. Limit validation to the checked route rather than every ending. Respect permission and spoiler boundaries, sharing node locations instead of a full route map where needed. The task is accurate continuation, not creating an unauthorised interactive adaptation. ## Related guides and sources [ManYue bookmarks and notes: save a page and return to the right place](); [Search ManYue chapters: find volume names and chapter numbers](). Checked on November 6, 2026: [Apple public version information]() lists ManYue 2.0.4, requiring iOS / iPadOS 15.0 or later. Feature scope follows the [official App Store description]() and the installed version. This article provides reading and checking methods you can perform; it does not claim step-by-step physical-device or private-server testing. Manual records, external tools and actually visible controls are identified separately, and personal analysis or code observations are not presented as verified automatic capabilities.