@mark1russell7/highways 0.9.4 → 0.9.6

package/src/routers/shared.ts

@@ -108,6 +108,8 @@ export interface SharedSearch {
    * The function `cost` can change the cost of the link from corner `i` to corner `j`, of length `d`. It must give at least `floor` × `d`.
    */
   find(w: Way, cost?: (i: number, j: number, d: number) => number, floor?: number): { seq: Point[]; ids: number[] } | undefined;
+  /** This function gives the free space across the link from corner `i` to corner `j` (`channelWidth`). The router keeps each width that it finds. */
+  width(i: number, j: number): number;
 }
 
 /**
@@ -212,6 +214,7 @@ export function sharedRouter(options: SharedOptions, negotiation?: SharedNegotia
           const way = corners.path(ways.out(w.ps), ways.out(w.pt), cost, floor);
           return way && { seq: way, ids: way.map((p, i) => (i === 0 || i === way.length - 1 ? endId(p) : index.get(p)!)) };
         },
+        width: (i, j) => widthOf(i, j),
       };
       const sorted = orderWays(all, options.order ?? "span", graph);
       const order = hooks?.order ? hooks.order(sorted, search) : sorted;

package/src/strategies/builtins.ts

@@ -47,6 +47,8 @@ import { SCALE_SPACE_DEFAULTS, scaleSpacePlan, type ScaleSpaceOptions } from "..
 import { GAP_DEFAULTS, gapPlan, type GapOptions } from "../highways/gaps/index.ts";
 import { INTERCHANGE_DEFAULTS, interchangePlan, type InterchangeOptions } from "../highways/interchanges/index.ts";
 import { KNEE_DEFAULTS, kneePlan, type KneeOptions } from "../highways/knee/index.ts";
+import { BALANCE_DEFAULTS, balancePlan, type BalanceOptions } from "../highways/balance/index.ts";
+import { MANIFOLD_DEFAULTS, manifoldPlan, type ManifoldOptions } from "../highways/manifolds/index.ts";
 import { BRONCHIAL_DEFAULTS, bronchialPlan, type BronchialOptions } from "../highways/bronchial/index.ts";
 import { SEARCH_DEFAULTS, searchPlan, type SearchOptions } from "../highways/search/index.ts";
 import { STEINER_DEFAULTS, steinerPlan, type SteinerOptions } from "../highways/steiner/index.ts";
@@ -75,11 +77,14 @@ import { WSPD_DEFAULTS, wspdPlan, type WspdOptions } from "../highways/wspd/inde
 import { ZIPPER_DEFAULTS, zipperPlan, type ZipperOptions } from "../highways/zipper/index.ts";
 import { depthLevels, type DepthLevelOptions } from "../levels/depths/index.ts";
 import { VENATION_DEFAULTS, venationLevels, type VenationOptions } from "../levels/venation/index.ts";
+import { DETAIL_DEFAULTS, detailLevels, type DetailOptions } from "../levels/detail/index.ts";
 import type { Graph, Result, Router } from "../model.ts";
 import { facingEnds } from "../plugs/facing/index.ts";
 import { justifyEnds, type JustifyOptions } from "../plugs/justify.ts";
 import { sideEnds, type SidePlugOptions } from "../plugs/side.ts";
 import { SPREAD_DEFAULTS, spreadEnds, type SpreadOptions } from "../plugs/spread/index.ts";
+import { ASSIGN_DEFAULTS, assignEnds, type AssignOptions } from "../plugs/assign/index.ts";
+import { LEADER_DEFAULTS, leaderEnds, type LeaderOptions } from "../plugs/leaders/index.ts";
 import { roomDemand, type RoomMethod, type RoomOptions } from "../room/index.ts";
 import { levelRoom, type LevelRoomOptions } from "../room/levels/index.ts";
 import { cornersRouter, type CornersOptions } from "../routers/corners.ts";
@@ -91,10 +96,15 @@ import { byCollection, trunksRouter, type TrunksOptions } from "../routers/trunk
 import { buildSections, SECTION_DEFAULTS, type SectionOptions } from "../sections.ts";
 import { runPipeline, type PipelineOptions } from "../whole/pipeline/index.ts";
 import { BOARD_PORTFOLIO_DEFAULTS, boardPortfolio, type BoardPortfolioOptions, type PortfolioSetting } from "../whole/portfolio/index.ts";
+import { CURRICULUM_DEFAULTS, curriculum, type CurriculumOptions } from "../whole/curriculum/index.ts";
+import { SLOT_DEFAULTS, slotPlan, type SlotOptions } from "../highways/slots/index.ts";
+import { PREFERENCE_DEFAULTS, preferences, type PreferenceOptions } from "../whole/preferences/index.ts";
+import { FIREFLY_DEFAULTS, fireflies, type FireflyOptions } from "../whole/fireflies/index.ts";
+import { TRACING_DEFAULTS, tracing, type TracingOptions } from "../whole/tracing/index.ts";
 import { createRegistry, defineStrategy, type AnyStrategy, type CurveInput, type LaneBoard, type Registry, type Strategy } from "./model.ts";
 import type { OptionSchema } from "./options.ts";
 import { AREA_SCHEMA, CONFLUENT_SCHEMA, CROSSBAR_SCHEMA, FRECHET_SCHEMA, MLSEB_SCHEMA, POWER_SCHEMA, SBEB_SCHEMA } from "./schemas.ts";
-import { DEPTHS_SCHEMA, JUSTIFY_SCHEMA, PIPELINE_SCHEMA, SIDE_PLUG_SCHEMA, SPREAD_SCHEMA, CLOTHOID_SCHEMA, CORNERS_SCHEMA, CORRIDOR_SCHEMA, CONSENSUS_SCHEMA, CUBU_SCHEMA, CUT_SCHEMA, DIFFUSION_SCHEMA, DIVIDED_SCHEMA, EDGE_PATH_SCHEMA, FDEB_SCHEMA, FLOW_CLUSTER_SCHEMA, FLOW_FIELD_SCHEMA, GROWTH_SCHEMA, HDBSCAN_SCHEMA, HIERARCHY_SCHEMA, HIGHWAY_SCHEMA, HOUGH_SCHEMA, HUB_ARC_SCHEMA, KD_SCHEMA, KDEEB_SCHEMA, KEY_SCHEMA, LANES_SCHEMA, LEVEL_HIGHWAY_SCHEMA, LEVEL_ROOM_SCHEMA, LINK_COMMUNITY_SCHEMA, MEET_SCHEMA, MESH_SCHEMA, MINGLE_SCHEMA, NESTED_SCHEMA, OD_CELL_SCHEMA, P_HUB_SCHEMA, QUICKBUNDLES_SCHEMA, RADIUS_SCHEMA, RESISTANCE_SCHEMA, RIDGE_SCHEMA, ROAD_CLASS_SCHEMA, ROOM_SCHEMA, SCALE_SPACE_SCHEMA, SECTION_SCHEMA, SELECT_SCHEMA, SECTIONS_SCHEMA, SHARED_ALL_SCHEMA, SHARED_SCHEMA, SMOOTH_SCHEMA, SOFT_KEY_SCHEMA, SPECTRAL_SCHEMA, SPIRAL_SCHEMA, STUB_SCHEMA, TENSION_SCHEMA, TERRITORY_SCHEMA, TRACLUS_SCHEMA, TRUNKS_SCHEMA, WEISZFELD_SCHEMA, WSPD_SCHEMA, ZIPPER_SCHEMA, STEINER_SCHEMA, GAP_SCHEMA, STREET_SCHEMA, SEARCH_SCHEMA, INTERCHANGE_SCHEMA, KNEE_SCHEMA, BRONCHIAL_SCHEMA, BOARD_PORTFOLIO_SCHEMA, VENATION_SCHEMA } from "./schemas.ts";
+import { ASSIGN_SCHEMA, DEPTHS_SCHEMA, JUSTIFY_SCHEMA, PIPELINE_SCHEMA, SIDE_PLUG_SCHEMA, SPREAD_SCHEMA, CLOTHOID_SCHEMA, CORNERS_SCHEMA, CORRIDOR_SCHEMA, CONSENSUS_SCHEMA, CUBU_SCHEMA, CUT_SCHEMA, DIFFUSION_SCHEMA, DIVIDED_SCHEMA, EDGE_PATH_SCHEMA, FDEB_SCHEMA, FLOW_CLUSTER_SCHEMA, FLOW_FIELD_SCHEMA, GROWTH_SCHEMA, HDBSCAN_SCHEMA, HIERARCHY_SCHEMA, HIGHWAY_SCHEMA, HOUGH_SCHEMA, HUB_ARC_SCHEMA, KD_SCHEMA, KDEEB_SCHEMA, KEY_SCHEMA, LANES_SCHEMA, LEVEL_HIGHWAY_SCHEMA, LEVEL_ROOM_SCHEMA, LINK_COMMUNITY_SCHEMA, MEET_SCHEMA, MESH_SCHEMA, MINGLE_SCHEMA, NESTED_SCHEMA, OD_CELL_SCHEMA, P_HUB_SCHEMA, QUICKBUNDLES_SCHEMA, RADIUS_SCHEMA, RESISTANCE_SCHEMA, RIDGE_SCHEMA, ROAD_CLASS_SCHEMA, ROOM_SCHEMA, SCALE_SPACE_SCHEMA, SECTION_SCHEMA, SELECT_SCHEMA, SECTIONS_SCHEMA, SHARED_ALL_SCHEMA, SHARED_SCHEMA, SMOOTH_SCHEMA, SOFT_KEY_SCHEMA, SPECTRAL_SCHEMA, SPIRAL_SCHEMA, STUB_SCHEMA, TENSION_SCHEMA, TERRITORY_SCHEMA, TRACLUS_SCHEMA, TRUNKS_SCHEMA, WEISZFELD_SCHEMA, WSPD_SCHEMA, ZIPPER_SCHEMA, STEINER_SCHEMA, GAP_SCHEMA, STREET_SCHEMA, SEARCH_SCHEMA, INTERCHANGE_SCHEMA, KNEE_SCHEMA, BRONCHIAL_SCHEMA, BOARD_PORTFOLIO_SCHEMA, VENATION_SCHEMA, BALANCE_SCHEMA, MANIFOLD_SCHEMA, LEADER_SCHEMA, DETAIL_SCHEMA, CURRICULUM_SCHEMA, SLOT_SCHEMA, PREFERENCE_SCHEMA, FIREFLY_SCHEMA, TRACING_SCHEMA } from "./schemas.ts";
 
 /** The options of a router strategy: the options of its router, without the name and the limit of the benchmark. */
 export type RouterPreset<O> = Omit<O, "name" | "maxNodes">;
@@ -480,6 +490,9 @@ export const highwayStrategies: {
   readonly interchanges: Strategy<"highway", InterchangeOptions>;
   readonly knee: Strategy<"highway", KneeOptions>;
   readonly bronchial: Strategy<"highway", BronchialOptions>;
+  readonly balance: Strategy<"highway", BalanceOptions>;
+  readonly manifolds: Strategy<"highway", ManifoldOptions>;
+  readonly slots: Strategy<"highway", SlotOptions>;
   readonly "corridors+breakeven": Strategy<"highway", CorridorOptions & BreakEvenOptions>;
   readonly "corridors+stretch": Strategy<"highway", CorridorOptions & StretchOptions>;
   readonly "corridors+ambiguity": Strategy<"highway", CorridorOptions & AmbiguityGuardOptions>;
@@ -973,6 +986,33 @@ export const highwayStrategies: {
     maxNodes: 10_000,
     run: (input: HighwayInput, o: Readonly<BronchialOptions>) => bronchialPlan(input, o),
   }),
+  balance: defineStrategy({
+    step: "highway",
+    name: "balance",
+    describe: "Stretch balance in a bundle (EDA-017). A price for each edge grows while its stretch is above the target, and the price moves its exit forward.",
+    defaults: { ...BALANCE_DEFAULTS } as BalanceOptions,
+    schema: BALANCE_SCHEMA,
+    maxNodes: 10_000,
+    run: (input: HighwayInput, o: Readonly<BalanceOptions>) => balancePlan(input, o),
+  }),
+  manifolds: defineStrategy({
+    step: "highway",
+    name: "manifolds",
+    describe: "Manifolds for a fan to a row (WILD-036). A straight header in the gap before the row, with taps at right angles and one feed from the node.",
+    defaults: { ...MANIFOLD_DEFAULTS } as ManifoldOptions,
+    schema: MANIFOLD_SCHEMA,
+    maxNodes: 10_000,
+    run: (input: HighwayInput, o: Readonly<ManifoldOptions>) => manifoldPlan(input, o),
+  }),
+  slots: defineStrategy({
+    step: "highway",
+    name: "slots",
+    describe: "A pull toward the lane slots of the trunks (RULE-047). An edge near a trunk joins it on a new lane when the pull is larger than its detour.",
+    defaults: { ...SLOT_DEFAULTS } as SlotOptions,
+    schema: SLOT_SCHEMA,
+    maxNodes: 10_000,
+    run: (input: HighwayInput, o: Readonly<SlotOptions>) => slotPlan(input, o),
+  }),
   "corridors+breakeven": gateStrategy(corridors, breakEvenGate),
   "corridors+stretch": gateStrategy(corridors, stretchGate),
   "corridors+ambiguity": gateStrategy(corridors, ambiguityGate),
@@ -986,6 +1026,8 @@ export const plugStrategies: {
   readonly side: Strategy<"plugs", SidePlugOptions>;
   readonly justify: Strategy<"plugs", JustifyOptions>;
   readonly spread: Strategy<"plugs", SpreadOptions>;
+  readonly leaders: Strategy<"plugs", LeaderOptions>;
+  readonly assign: Strategy<"plugs", AssignOptions>;
 } = Object.freeze({
   facing: defineStrategy({
     step: "plugs",
@@ -1019,12 +1061,29 @@ export const plugStrategies: {
     schema: SPREAD_SCHEMA,
     run: (input, o) => spreadEnds(input, o),
   }),
+  leaders: defineStrategy<"plugs", LeaderOptions>({
+    step: "plugs",
+    name: "leaders",
+    describe: "Boundary leaders as plug stubs (EDA-041). The plugs of each wall take the order of po-leaders with no crossing, and keep a least gap.",
+    defaults: { ...LEADER_DEFAULTS },
+    schema: LEADER_SCHEMA,
+    run: (input, o) => leaderEnds(input, o),
+  }),
+  assign: defineStrategy<"plugs", AssignOptions>({
+    step: "plugs",
+    name: "assign",
+    describe: "PLUG-ASSIGN. The plugs of each wall go into the ranges of their ports with a minimum gap. The most ends are in their range, then the order of the far ends.",
+    defaults: { ...ASSIGN_DEFAULTS },
+    schema: ASSIGN_SCHEMA,
+    run: (input, o) => assignEnds(input, o),
+  }),
 });
 
 /** The built-in level rules: the strategies of the step `levels`. The router `sections` makes its zoom levels with its option `level`. */
 export const levelStrategies: {
   readonly depths: Strategy<"levels", DepthLevelOptions>;
   readonly venation: Strategy<"levels", VenationOptions>;
+  readonly detail: Strategy<"levels", DetailOptions>;
 } = Object.freeze({
   depths: defineStrategy<"levels", DepthLevelOptions>({
     step: "levels",
@@ -1042,6 +1101,14 @@ export const levelStrategies: {
     schema: VENATION_SCHEMA,
     run: (input, o) => venationLevels(input, o),
   }),
+  detail: defineStrategy<"levels", DetailOptions>({
+    step: "levels",
+    name: "detail",
+    describe: "The level of detail of the bundles (WILD-016 with EDA-038). Legs of level links closer than a few pixels at the scale of their level become one stroke.",
+    defaults: { ...DETAIL_DEFAULTS },
+    schema: DETAIL_SCHEMA,
+    run: (input, o) => detailLevels(input, o),
+  }),
 });
 
 /**
@@ -1058,6 +1125,14 @@ export const BOARD_PORTFOLIO_SETTINGS: readonly PortfolioSetting[] = Object.free
   ].map((s) => Object.freeze(s)),
 );
 
+/**
+ * The pool of routes of the whole strategy `curriculum` (RULE-048), in order: the routers of the base of the screen. The first one gives the first answer.
+ * The option `settings` takes the first ones.
+ */
+export const CURRICULUM_POOL: readonly PortfolioSetting[] = Object.freeze(
+  (["corners", "shared", "trunks"] as const).map((name) => Object.freeze({ name, pipeline: { router: routerStrategies[name] as Strategy<"router"> } })),
+);
+
 /**
  * The built-in whole strategies: the strategies of the step `whole`. The strategy `pipeline` runs one strategy of each step, as the demo of the site does.
  * Without options, it routes the graph with the router `corners`.
@@ -1065,6 +1140,10 @@ export const BOARD_PORTFOLIO_SETTINGS: readonly PortfolioSetting[] = Object.free
 export const wholeStrategies: {
   readonly pipeline: Strategy<"whole", PipelineOptions>;
   readonly "board-portfolio": Strategy<"whole", BoardPortfolioOptions>;
+  readonly curriculum: Strategy<"whole", CurriculumOptions>;
+  readonly preferences: Strategy<"whole", PreferenceOptions>;
+  readonly fireflies: Strategy<"whole", FireflyOptions>;
+  readonly tracing: Strategy<"whole", TracingOptions>;
 } = Object.freeze({
   pipeline: defineStrategy<"whole", PipelineOptions>({
     step: "whole",
@@ -1082,6 +1161,38 @@ export const wholeStrategies: {
     schema: BOARD_PORTFOLIO_SCHEMA,
     run: (graph, o) => boardPortfolio(graph, BOARD_PORTFOLIO_SETTINGS, o).output,
   }),
+  curriculum: defineStrategy<"whole", CurriculumOptions>({
+    step: "whole",
+    name: "curriculum",
+    describe: "A curriculum of rules (RULE-048). Each stage adds one rule, and each edge takes the route of a pool that improves it with no loss on the earlier rules.",
+    defaults: { ...CURRICULUM_DEFAULTS },
+    schema: CURRICULUM_SCHEMA,
+    run: (graph, o) => curriculum(graph, CURRICULUM_POOL, o),
+  }),
+  preferences: defineStrategy<"whole", PreferenceOptions>({
+    step: "whole",
+    name: "preferences",
+    describe: "Rule weights from preferences (RULE-038). A fit to made-up pairs gives the weights, and each edge takes the route of a pool with the least weighted cost.",
+    defaults: { ...PREFERENCE_DEFAULTS },
+    schema: PREFERENCE_SCHEMA,
+    run: (graph, o) => preferences(graph, CURRICULUM_POOL, o),
+  }),
+  fireflies: defineStrategy<"whole", FireflyOptions>({
+    step: "whole",
+    name: "fireflies",
+    describe: "Firefly and bee searches (NAT-047). A seeded swarm searches the discount and the margin of `shared` on the board, within a budget of settings.",
+    defaults: { ...FIREFLY_DEFAULTS },
+    schema: FIREFLY_SCHEMA,
+    run: (graph, o) => fireflies(graph, routerStrategies.shared as Strategy<"router">, o).output,
+  }),
+  tracing: defineStrategy<"whole", TracingOptions>({
+    step: "whole",
+    name: "tracing",
+    describe: "The least tracing load (WILD-057). The pipeline tries a fixed list of settings, and the least load of crossings, merges and bends on one edge wins.",
+    defaults: { ...TRACING_DEFAULTS },
+    schema: TRACING_SCHEMA,
+    run: (graph, o) => tracing(graph, BOARD_PORTFOLIO_SETTINGS, o).output,
+  }),
 });
 
 /** The built-in strategies of each step, in order. A consumer adds its own: `createRegistry([...BUILT_IN_STRATEGIES, mine])`. */

package/src/strategies/schemas.ts

@@ -9,6 +9,16 @@ import type { CutOptions } from "../groups/cut/index.ts";
 import type { JustifyOptions } from "../plugs/justify.ts";
 import type { SidePlugOptions } from "../plugs/side.ts";
 import type { SpreadOptions } from "../plugs/spread/index.ts";
+import type { AssignOptions } from "../plugs/assign/index.ts";
+import type { LeaderOptions } from "../plugs/leaders/index.ts";
+import type { BalanceOptions } from "../highways/balance/index.ts";
+import type { ManifoldOptions } from "../highways/manifolds/index.ts";
+import type { DetailOptions } from "../levels/detail/index.ts";
+import type { CurriculumOptions } from "../whole/curriculum/index.ts";
+import type { SlotOptions } from "../highways/slots/index.ts";
+import type { PreferenceOptions } from "../whole/preferences/index.ts";
+import type { FireflyOptions } from "../whole/fireflies/index.ts";
+import type { TracingOptions } from "../whole/tracing/index.ts";
 import type { KdOptions } from "../groups/kd/index.ts";
 import type { KeyOptions } from "../groups/keys/index.ts";
 import type { HighwayBase } from "../highways/base.ts";
@@ -968,6 +978,12 @@ export const SPREAD_SCHEMA: OptionSchema<SpreadOptions> = {
   rounds: { type: "integer", min: 0, max: 8, step: 1, default: 2, describe: "The passes that sort each wall again by the new places of the far ends." },
 };
 
+/** The declarations of the options of the plug strategy `assign` (PLUG-ASSIGN). */
+export const ASSIGN_SCHEMA: OptionSchema<AssignOptions> = {
+  plugGap: { type: "number", min: 0, max: 24, step: 1, default: 8, describe: "The least gap between two plugs of one wall. On a short wall, the gap shrinks evenly." },
+  inset: { type: "number", min: 0, max: 12, step: 1, default: 6, describe: "A plug stays this far from the corners of its wall." },
+};
+
 /** The declarations of the options of the whole strategy `pipeline`. */
 export const PIPELINE_SCHEMA: OptionSchema<PipelineOptions> = {
   router: { type: "strategy", step: "router", describe: "The router. A highway plan takes its place." },
@@ -1070,3 +1086,83 @@ export const BOARD_PORTFOLIO_SCHEMA: OptionSchema<BoardPortfolioOptions> = {
   ink: { type: "number", min: 0, max: 4, step: 0.25, marks: [0, 1, 2], default: 1, describe: "The weight of the ink saved (B1) in the score." },
   budget: { type: "number", min: 0, max: 10, step: 0.1, marks: [0, 1, 10], default: 0, describe: "The time budget in seconds. The value 0 sets no budget." },
 };
+
+/** The declarations of the options of the highway strategy `balance` (EDA-017). */
+export const BALANCE_SCHEMA: OptionSchema<BalanceOptions> = {
+  tau: { type: "number", min: 1.1, max: 2, step: 0.05, marks: [1.1, 1.2, 1.5, 2], default: 1.2, describe: "The target of the stretch of an edge: its route on the plan over its route alone." },
+  iterations: { type: "integer", min: 5, max: 30, step: 1, marks: [5, 10, 30], default: 5, describe: "The number of updates of the prices." },
+  end: { type: "enum", values: ["exit", "entry", "both"], default: "exit", describe: "The end of a ride that the price moves: the exit, the entry, or both by half." },
+  from: { ...HIGHWAY_BASE, default: "shared-ways" },
+};
+
+/** The declarations of the options of the highway strategy `manifolds` (WILD-036). */
+export const MANIFOLD_SCHEMA: OptionSchema<ManifoldOptions> = {
+  kMin: { type: "integer", min: 3, max: 8, step: 1, marks: [3, 4, 6, 8], default: 3, describe: "A manifold has this number of taps or more." },
+  band: { type: "number", min: 0.5, max: 2, step: 0.25, marks: [0.5, 1, 2], default: 1, describe: "The nodes of one row have centers in a band of this many median box heights." },
+  side: { type: "enum", values: ["near", "far"], default: "near", describe: "The place of the header in the gap before the row: near the row, or near the feed node." },
+  detour: { type: "number", min: 1, max: 3, step: 0.05, marks: [1.25, 1.5, 2], default: 1.5, describe: "A tap stays on the manifold only when its way is this many times the direct line or less." },
+  from: { ...HIGHWAY_BASE, default: "shared-ways" },
+};
+
+/** The declarations of the options of the highway strategy `slots` (RULE-047). */
+export const SLOT_SCHEMA: OptionSchema<SlotOptions> = {
+  pull: { type: "number", min: 0.25, max: 8, step: 0.25, marks: [0.5, 1, 2, 4, 8], default: 2, describe: "The weight of the pull toward the slot of a new lane." },
+  reach: { type: "number", min: 8, max: 64, step: 4, marks: [8, 16, 24, 48, 64], default: 24, describe: "A route point farther than this distance from a trunk gets no pull." },
+  laneSpacing: { type: "number", min: 2, max: 8, step: 1, marks: [2, 4, 8], default: 4, describe: "The distance between two lanes of a trunk." },
+  maxStretch: { type: "number", min: 1.05, max: 2, step: 0.05, marks: [1.1, 1.25, 1.5, 2], default: 1.25, describe: "The largest new length of a route over its first length after it joins a trunk." },
+  keys: { type: "enum", values: ["same", "any"], default: "same", describe: "The edges that can join a trunk: only the edges with the key of the trunk, or each edge." },
+  from: { ...HIGHWAY_BASE, default: "shared-ways" },
+};
+
+/** The declarations of the options of the plug strategy `leaders` (EDA-041). */
+export const LEADER_SCHEMA: OptionSchema<LeaderOptions> = {
+  leader: { type: "enum", values: ["s", "po", "opo"], default: "po", describe: "The type of leader: the order of the angles, the order along the wall, or even places." },
+  slotSpacing: { type: "number", min: 2, max: 8, step: 1, marks: [2, 4, 8], default: 8, describe: "The least gap between two plugs of one wall." },
+  inset: SPREAD_SCHEMA.inset,
+  rounds: { type: "integer", min: 0, max: 4, step: 1, default: 2, describe: "The passes that sort each wall again by the new places of the far ends." },
+};
+
+/** The declarations of the options of the level strategy `detail` (WILD-016 with EDA-038): the options of `depths`, and the limits of the collapse. */
+export const DETAIL_SCHEMA: OptionSchema<DetailOptions> = {
+  ...DEPTHS_SCHEMA,
+  pxMin: { type: "number", min: 0.5, max: 4, step: 0.5, marks: [1, 2, 3, 4], default: 3, describe: "Two parallel legs closer than this number of pixels on the screen become one stroke." },
+  minCount: { type: "integer", min: 2, max: 5, step: 1, default: 2, describe: "A stroke holds this number of edges or more." },
+  w0: { type: "number", min: 1, max: 4, step: 0.5, default: 1.5, describe: "The width of a stroke of one edge, in pixels." },
+  widthScale: { type: "enum", values: ["linear", "sqrt", "log"], default: "log", describe: "The growth of the width of a stroke with its count." },
+};
+
+/** The declarations of the options of the whole strategy `curriculum` (RULE-048). */
+export const CURRICULUM_SCHEMA: OptionSchema<CurriculumOptions> = {
+  order: { type: "enum", values: ["R1-R12-R2", "R12-R1-R2", "R1-R2-R12"], default: "R1-R12-R2", describe: "The order in which the stages add the rules." },
+  passes: { type: "integer", min: 1, max: 3, step: 1, default: 1, describe: "The number of passes over the edges in each stage." },
+  settings: { type: "integer", min: 2, max: 3, step: 1, default: 3, describe: "The number of settings in the pool of routes, from the start of its list." },
+  detour: { type: "number", min: 1.5, max: 4, step: 0.25, marks: [1.5, 2, 3], default: 2, describe: "A new route has a detour of at most this value, or of its old route." },
+};
+
+/** The declarations of the options of the whole strategy `preferences` (RULE-038). */
+export const PREFERENCE_SCHEMA: OptionSchema<PreferenceOptions> = {
+  l2: { type: "number", min: 0, max: 1, step: 0.01, marks: [0, 0.01, 0.1, 1], default: 0.01, describe: "The weight of the L2 term of the fit of the weights to the made-up pairs." },
+  passes: { type: "integer", min: 1, max: 3, step: 1, default: 1, describe: "The number of passes over the edges." },
+  settings: { type: "integer", min: 2, max: 3, step: 1, default: 3, describe: "The number of settings in the pool of routes, from the start of its list." },
+  detour: { type: "number", min: 1.5, max: 4, step: 0.25, marks: [1.5, 2, 3], default: 2, describe: "A new route has a detour of at most this value, or of its old route." },
+};
+
+/** The declarations of the options of the whole strategy `fireflies` (NAT-047). */
+export const FIREFLY_SCHEMA: OptionSchema<FireflyOptions> = {
+  search: { type: "enum", values: ["firefly", "bees"], default: "firefly", describe: "The search: the firefly algorithm, or the artificial bee colony." },
+  budget: { type: "integer", min: 4, max: 40, step: 1, marks: [4, 12, 20, 40], default: 12, describe: "The largest number of different settings that the search routes." },
+  colony: { type: "integer", min: 4, max: 20, step: 1, marks: [4, 6, 10, 20], default: 6, describe: "The number of fireflies or food sources." },
+  gamma: { type: "number", min: 0.01, max: 10, step: 0.01, scale: "log", marks: [0.01, 0.1, 1, 10], default: 1, describe: "The absorption of the light of a firefly." },
+  alpha: { type: "number", min: 0.01, max: 0.5, step: 0.01, marks: [0.01, 0.1, 0.2, 0.5], default: 0.2, describe: "The size of the random step of a firefly, as a share of the range." },
+  limit: { type: "integer", min: 10, max: 100, step: 10, marks: [10, 50, 100], default: 10, describe: "A scout bee leaves a food source after this number of tries with no gain." },
+  seed: { type: "integer", min: 0, max: 1_000_000, step: 1, marks: [1, 2, 3], default: 1, describe: "The seed of the search. The same seed gives the same routes." },
+};
+
+/** The declarations of the options of the whole strategy `tracing` (WILD-057). */
+export const TRACING_SCHEMA: OptionSchema<TracingOptions> = {
+  crossing: { type: "number", min: 0, max: 4, step: 0.25, marks: [0, 1, 2, 4], default: 1, describe: "The weight of a crossing in the tracing load." },
+  merge: { type: "number", min: 0, max: 4, step: 0.25, marks: [0, 1, 2, 4], default: 2, describe: "The weight of a merge or a split where the edge is not an outer lane." },
+  bend: { type: "number", min: 0, max: 4, step: 0.25, marks: [0, 0.5, 1, 4], default: 0.5, describe: "The weight of a bend in the tracing load." },
+  settings: { type: "integer", min: 1, max: 12, step: 1, marks: [1, 4, 8, 12], default: 4, describe: "The number of settings that the strategy tries, from the start of its list." },
+  quantile: { type: "enum", values: ["q50", "q95", "mean"], default: "q95", describe: "The value of the loads of the edges that the pick reads." },
+};

package/src/whole/curriculum/index.ts

@@ -0,0 +1,243 @@
+import { checkProperties } from "../../bench/properties.ts";
+import { dist, polylineLength, segmentsCross, type Point } from "../../geom.ts";
+import type { Graph, Route } from "../../model.ts";
+import type { WholeOutput } from "../../strategies/model.ts";
+import { runPipeline } from "../pipeline/index.ts";
+import type { PortfolioSetting } from "../portfolio/index.ts";
+
+/** One rule of the curriculum: the crossings (R1), the lane separation (R12) or the crossing angle (R2). */
+export type CurriculumRule = "R1" | "R12" | "R2";
+
+/** The order in which the curriculum adds its rules. */
+export type CurriculumOrder = "R1-R12-R2" | "R12-R1-R2" | "R1-R2-R12";
+
+/** The values of `CurriculumOrder`. */
+export const CURRICULUM_ORDERS: readonly CurriculumOrder[] = Object.freeze(["R1-R12-R2", "R12-R1-R2", "R1-R2-R12"]);
+
+/** The options of the whole strategy `curriculum` (RULE-048). */
+export interface CurriculumOptions {
+  /** The order in which the stages add the rules. The default is `R1-R12-R2`. */
+  readonly order: CurriculumOrder;
+  /** The number of passes over the edges in each stage, from 1 to 3. The default is 1. */
+  readonly passes: number;
+  /** The number of settings in the pool of routes, from the start of its list, from 2 to 3. The default is 3. */
+  readonly settings: number;
+  /** A new route has a detour of at most this value, or of its old route, from 1.5 to 4. The default is 2. */
+  readonly detour: number;
+}
+
+/** The default options of the strategy `curriculum`. */
+export const CURRICULUM_DEFAULTS: Readonly<CurriculumOptions> = Object.freeze({ order: "R1-R12-R2", passes: 1, settings: 3, detour: 2 });
+
+/** Two legs closer than this distance count for the lane separation (R12), as in the screen. */
+const NEAR = 4;
+
+/** A route with its bounding box, for the quick test of two routes. */
+interface Shape {
+  readonly route: Route;
+  readonly x0: number;
+  readonly y0: number;
+  readonly x1: number;
+  readonly y1: number;
+}
+
+/** This function gives the shape of a route. */
+function shapeOf(route: Route): Shape {
+  let x0 = Infinity;
+  let y0 = Infinity;
+  let x1 = -Infinity;
+  let y1 = -Infinity;
+  for (const p of route.points) {
+    x0 = Math.min(x0, p.x);
+    y0 = Math.min(y0, p.y);
+    x1 = Math.max(x1, p.x);
+    y1 = Math.max(y1, p.y);
+  }
+  return { route, x0, y0, x1, y1 };
+}
+
+/** The sine of 5 degrees, as a literal. A literal gives the same bits on each platform, so a decision does not depend on `Math.sin`. */
+const SIN_5 = 0.08715574274765817;
+
+/** The constants of the arc sine of fdlibm (`e_asin.c`). */
+const PIO2_HI = 1.5707963267948966;
+const PIO2_LO = 6.123233995736766e-17;
+const PIO4_HI = 0.7853981633974483;
+const PS = [1.66666666666666657415e-1, -3.25565818622400915405e-1, 2.01212532134862925881e-1, -4.00555345006794114027e-2, 7.91534994289814532176e-4, 3.47933107596021167570e-5] as const;
+const QS = [-2.40339491173441421878, 2.02094576023350569471, -6.88283971605453293030e-1, 7.70381505559019352791e-2] as const;
+const WORDS = new DataView(new ArrayBuffer(8));
+
+/** This function gives the rational part `p / q` of the arc sine of fdlibm at `t`. */
+function asinRatio(t: number): [number, number] {
+  const p = t * (PS[0] + t * (PS[1] + t * (PS[2] + t * (PS[3] + t * (PS[4] + t * PS[5])))));
+  const q = 1 + t * (QS[0] + t * (QS[1] + t * (QS[2] + t * QS[3])));
+  return [p, q];
+}
+
+/**
+ * This function gives the arc sine of `x` in radians, from -1 to 1. It is the algorithm of fdlibm, with only `+`, `*`, `/` and `Math.sqrt`.
+ * These operations are exact to the last bit on each platform, so the result does not depend on the engine.
+ */
+export function arcsin(x: number): number {
+  const ax = Math.abs(x);
+  if (Number.isNaN(x) || ax > 1) return Number.NaN;
+  if (ax === 1) return x * PIO2_HI + x * PIO2_LO;
+  if (ax < 0.5) {
+    if (ax < 2 ** -27) return x;
+    const [p, q] = asinRatio(x * x);
+    return x + x * (p / q);
+  }
+  const t = (1 - ax) * 0.5;
+  const [p, q] = asinRatio(t);
+  const s = Math.sqrt(t);
+  let r: number;
+  WORDS.setFloat64(0, ax);
+  if (WORDS.getUint32(0) >= 0x3fef3333) {
+    r = PIO2_HI - (2 * (s + s * (p / q)) - PIO2_LO);
+  } else {
+    WORDS.setFloat64(0, s);
+    WORDS.setUint32(4, 0);
+    const w = WORDS.getFloat64(0);
+    const c = (t - w * w) / (s + w);
+    const pp = 2 * s * (p / q) - (PIO2_LO - 2 * c);
+    const qq = PIO4_HI - 2 * w;
+    r = PIO4_HI - (pp - qq);
+  }
+  return x > 0 ? r : -r;
+}
+
+/** This function gives the distance between the segments `ab` and `cd`, when they do not cross. */
+function segmentGap(a: Point, b: Point, c: Point, d: Point): number {
+  const at = (p: Point, u: Point, v: Point): number => {
+    const dx = v.x - u.x;
+    const dy = v.y - u.y;
+    const l2 = dx * dx + dy * dy;
+    const t = l2 > 0 ? Math.max(0, Math.min(1, ((p.x - u.x) * dx + (p.y - u.y) * dy) / l2)) : 0;
+    const ex = p.x - u.x - t * dx;
+    const ey = p.y - u.y - t * dy;
+    return Math.sqrt(ex * ex + ey * ey);
+  };
+  return Math.min(at(a, c, d), at(b, c, d), at(c, a, b), at(d, a, b));
+}
+
+/**
+ * This function gives the costs of the rules between two routes. R1 is the number of crossings.
+ * R2 is the sum of `1 - θ / 90` over the crossings. θ is the crossing angle in degrees.
+ * R12 is the overlap of the legs of `a` and `b` that are within 5 degrees of parallel. The two legs are nearer than 4 units.
+ */
+export function pairCosts(a: readonly Point[], b: readonly Point[]): Record<CurriculumRule, number> {
+  let r1 = 0;
+  let r2 = 0;
+  let r12 = 0;
+  for (let i = 1; i < a.length; i++) {
+    const p = a[i - 1]!;
+    const q = a[i]!;
+    const ux = q.x - p.x;
+    const uy = q.y - p.y;
+    const lu = Math.sqrt(ux * ux + uy * uy);
+    if (lu <= 1e-9) continue;
+    for (let j = 1; j < b.length; j++) {
+      const r = b[j - 1]!;
+      const s = b[j]!;
+      const vx = s.x - r.x;
+      const vy = s.y - r.y;
+      const lv = Math.sqrt(vx * vx + vy * vy);
+      if (lv <= 1e-9) continue;
+      if (segmentsCross(p, q, r, s)) {
+        r1++;
+        const angle = (arcsin(Math.min(1, Math.abs(ux * vy - uy * vx) / (lu * lv))) * 180) / Math.PI;
+        r2 += 1 - angle / 90;
+        continue;
+      }
+      if (Math.abs(ux * vy - uy * vx) > SIN_5 * lu * lv) continue;
+      const t0 = ((r.x - p.x) * ux + (r.y - p.y) * uy) / lu;
+      const t1 = ((s.x - p.x) * ux + (s.y - p.y) * uy) / lu;
+      const overlap = Math.min(lu, Math.max(t0, t1)) - Math.max(0, Math.min(t0, t1));
+      if (overlap > 1e-9 && segmentGap(p, q, r, s) < NEAR) r12 += overlap;
+    }
+  }
+  return { R1: r1, R2: r2, R12: r12 };
+}
+
+/** This function gives the detour of a route: its length over the distance between its ends. */
+function detourOf(points: readonly Point[]): number {
+  const span = dist(points[0]!, points[points.length - 1]!);
+  return span > 1e-9 ? polylineLength(points) / span : 1;
+}
+
+/**
+ * This function runs the whole strategy `curriculum` (RULE-048, after curriculum learning, Bengio 2009). The record has no energy solver yet (RULE-019).
+ * Thus a pool of routes of fixed settings takes its place. Each edge can take its route from any setting of the pool.
+ * The first answer is the first setting. Each stage adds one rule, in the order `order`. A pass of a stage visits the edges, the worst first.
+ * An edge takes the route of the pool with the least cost of the new rule. That cost is lower, and the earlier rules do not get worse.
+ * A route with a break of a hard rule is not in the pool. The output has the routes alone, with no runs, bundles or levels.
+ */
+export function curriculum(graph: Graph, list: readonly PortfolioSetting[], options: Partial<CurriculumOptions> = {}): WholeOutput {
+  const o = { ...CURRICULUM_DEFAULTS, ...options };
+  const count = Math.max(1, Math.min(list.length, Math.floor(o.settings)));
+  const pool = new Map<string, Route[]>();
+  let first: WholeOutput | undefined;
+  for (const s of list.slice(0, count)) {
+    const limit = (s.pipeline.highway ?? s.pipeline.router).maxNodes;
+    if (limit !== undefined && graph.nodes.length > limit) continue;
+    const output = runPipeline(graph, s.pipeline);
+    first ??= output;
+    const faulty = new Set(checkProperties(output.graph, output.result, 1_000_000).map((v) => v.edge));
+    for (const r of output.result.routes) {
+      if (faulty.has(r.edge) || r.points.length < 2) continue;
+      const list2 = pool.get(r.edge);
+      if (list2) list2.push(r);
+      else pool.set(r.edge, [r]);
+    }
+  }
+  if (!first) return runPipeline(graph, list[0]!.pipeline);
+  const rules = o.order.split("-") as CurriculumRule[];
+  const current = new Map<string, Shape>(first.result.routes.map((r) => [r.edge, shapeOf(r)]));
+  // A faulty first route takes the first route of the pool, so no stage starts from a break of a hard rule.
+  for (const [edge, shape] of current) {
+    const own = pool.get(edge);
+    if (own && !own.includes(shape.route)) current.set(edge, shapeOf(own[0]!));
+  }
+  const costOf = (edge: string, s: Shape): Record<CurriculumRule, number> => {
+    const sum = { R1: 0, R2: 0, R12: 0 };
+    for (const [other, t] of current) {
+      if (other === edge || t.x0 > s.x1 + NEAR || t.x1 < s.x0 - NEAR || t.y0 > s.y1 + NEAR || t.y1 < s.y0 - NEAR) continue;
+      const c = pairCosts(s.route.points, t.route.points);
+      sum.R1 += c.R1;
+      sum.R2 += c.R2;
+      sum.R12 += c.R12;
+    }
+    return sum;
+  };
+  const edges = [...current.keys()];
+  for (let stage = 0; stage < rules.length; stage++) {
+    const rule = rules[stage]!;
+    const earlier = rules.slice(0, stage);
+    for (let pass = 0; pass < Math.max(1, Math.floor(o.passes)); pass++) {
+      const costs = new Map(edges.map((e) => [e, costOf(e, current.get(e)!)]));
+      const order = [...edges].sort((a, b) => costs.get(b)![rule] - costs.get(a)![rule] || (a < b ? -1 : a > b ? 1 : 0));
+      let moved = 0;
+      for (const edge of order) {
+        const now = current.get(edge)!;
+        const base = costOf(edge, now);
+        if (base[rule] <= 1e-9) continue;
+        const cap = Math.max(o.detour, detourOf(now.route.points));
+        let best: { shape: Shape; cost: number } | undefined;
+        for (const r of pool.get(edge) ?? []) {
+          if (r === now.route || detourOf(r.points) > cap + 1e-9) continue;
+          const shape = shapeOf(r);
+          const c = costOf(edge, shape);
+          if (c[rule] >= base[rule] - 1e-9 || earlier.some((k) => c[k] > base[k] + 1e-9)) continue;
+          if (!best || c[rule] < best.cost - 1e-9) best = { shape, cost: c[rule] };
+        }
+        if (best) {
+          current.set(edge, best.shape);
+          moved++;
+        }
+      }
+      if (moved === 0) break;
+    }
+  }
+  const routes = first.result.routes.map((r) => current.get(r.edge)?.route ?? r);
+  return { graph: first.graph, result: { routes } };
+}