Description
Construct connected imaginary transit lines with exact stop budgets, complete station coverage and transfer labels using nonuniform shared-anchor construction; no real schedules or geography.
Worldbuilding fixtures describe an invented setting through supplied entities and explicit relations. A reproducible arrangement can support games or writing exercises while keeping constructed history and geography separate from factual claims about the real world.
Construct connected imaginary transit lines with exact stop budgets, complete station coverage and transfer labels using nonuniform shared-anchor construction; no real schedules or geography.
When to use this tool
Use this generator to create reproducible fictional transit line map cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.
How to use the tool and how it works
- Supply stationIds, lineStopCounts in the field shapes below. Set seed when you need an explicit replay.
- Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
- Read lines, links, transferStationIds, componentCount, fictional. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.
Build ordered transit lines covering all stations, starting later lines at an already served station and preferentially adding unserved stations. Deduplicate unordered consecutive-stop links, then report transfer stations and component count.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| stationIds | Station Ids | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 2; maximum items 16. |
| lineStopCounts | Line Stop Counts | Required. Array of Safe integer; minimum 2; maximum 16.; minimum items 1; maximum items 16. |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| lines | Lines | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| lines[].id | Literal identifier used independently of display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| lines[].stops | Stops | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 2; maximum items 16. |
| links | Links | Required. Array of Object; no unknown keys.; minimum items 0; maximum items 120. |
| links[].from | From | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| links[].to | To | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 64. |
| transferStationIds | Transfer Station Ids | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 64.; minimum items 0; maximum items 16. |
| componentCount | Component Count | Required. Safe integer; minimum 1; maximum 1. |
| fictional | Fictional | Required. Boolean; exactly true. |
| randomness | Replay source and normalized 32-bit seed, or null seed for an advancing context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional safe-integer replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. Text; one of "context", "seed". |
An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.
{
"input": {
"stationIds": [
"a",
"b",
"c"
],
"lineStopCounts": [
2,
2
],
"seed": 42
},
"output": {
"lines": [
{
"id": "line-1",
"stops": [
"c",
"a"
]
},
{
"id": "line-2",
"stops": [
"a",
"b"
]
}
],
"links": [
{
"from": "c",
"to": "a"
},
{
"from": "a",
"to": "b"
}
],
"transferStationIds": [
"a"
],
"componentCount": 1,
"fictional": true,
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- Line stop counts must permit complete coverage and cannot exceed the station bank. This constructs a connected fictional network, not timetables, frequencies, route capacity, or geographically valid rail alignments.
- A replay requires the same complete input and implementation. The stated sampling convention applies within its eligible space. A finite draw does not exhaust all possible outputs; repeats remain possible unless a distinct-selection rule is explicit.
- The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.
Alternative or Complementary methods
For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.
References
Similar or alternative tools
- Random Fictional Faction Alliance Map Generator
Generate supplied fictional factions' ally, rival, or neutral pair network with bounded topology search and same or independent reciprocal labels.
- Random Fictional Language Contact Map Generator
Assign supplied invented languages to regions with minimum coverage quotas, then label caller contact edges; constructed nonuniform allocation, not real sociolinguistic inference.