@knowvah/dot-engine 0.1.0

package/dist/model/graph.d.ts

@@ -0,0 +1,135 @@
+/**
+ * TypeScript port of Agraph_t from lib/cgraph/cgraph.h.
+ *
+ * @see lib/cgraph/cgraph.h:Agraph_s
+ * @see lib/cgraph/cgraph.h:Agdesc_s
+ */
+import type { Edge } from './edge.js';
+import type { Node } from './node.js';
+import { type GraphInfo } from './graphInfo.js';
+/**
+ * Describes the kind of graph, corresponding to the Agdesc_t descriptor
+ * fields `directed` and `strict` in the C implementation.
+ *
+ * @see lib/cgraph/cgraph.h:Agdesc_s
+ * @see lib/cgraph/graph.c:Agdirected
+ * @see lib/cgraph/graph.c:Agstrictdirected
+ * @see lib/cgraph/graph.c:Agundirected
+ * @see lib/cgraph/graph.c:Agstrictundirected
+ */
+export type GraphKind = 'directed' | 'undirected' | 'strict-directed' | 'strict-undirected';
+/**
+ * Represents an Agraph_t — a graph or subgraph.
+ *
+ * In the C implementation Agraph_t holds n_seq/n_id (node dicts), e_seq/e_id
+ * (edge dicts), g_seq/g_id (subgraph dicts), parent, root, and a shared
+ * Agclos_t. Here we use native TypeScript collections in place of libcdt
+ * Dict_t, and the `info` field replaces the agbindrec / GD_* mechanism (AD-1).
+ *
+ * Nodes are owned by the root graph. Subgraphs hold references to the same
+ * Node instances (Subgraph Ownership Semantics, cgraph.md).
+ *
+ * @see lib/cgraph/cgraph.h:Agraph_s
+ */
+export declare class Graph {
+    /** Graph name; agnameof equivalent. @see lib/cgraph/cgraph.h:agnameof */
+    readonly name: string;
+    /**
+     * True when the graph was declared with NO name (`digraph {`), as opposed to
+     * an explicit empty name (`digraph "" {`). Both store `name === ''`, but
+     * cgraph gives the truly-anonymous root the internal id `%1` (agnameof) while
+     * the empty-named one keeps `""`. Only the imagemap `<map id/name>` reads this
+     * (map.ts:mapGraphName); dot/xdot re-serialization keeps `name` so an
+     * anonymous root round-trips as `digraph {`, not `digraph %1 {`.
+     * @see lib/cgraph/id.c:idmap (anon → `%1`) ; lib/cgraph/agraph.c:agnameof
+     */
+    readonly anonymous: boolean;
+    /**
+     * Directed/strict classification; mirrors Agdesc_t.directed and
+     * Agdesc_t.strict. @see lib/cgraph/cgraph.h:Agdesc_s
+     */
+    readonly kind: GraphKind;
+    /**
+     * Node set in insertion order, keyed by name.
+     * Mirrors Agraph_t.n_seq (sequence dict) merged with n_id access.
+     * @see lib/cgraph/cgraph.h:Agraph_s
+     */
+    nodes: Map<string, Node>;
+    /**
+     * All edges owned by this graph (root graph only for ownership; subgraphs
+     * reference a subset). Mirrors Agraph_t.e_seq.
+     * @see lib/cgraph/cgraph.h:Agraph_s
+     */
+    edges: Edge[];
+    /**
+     * Named subgraphs, keyed by name. Mirrors Agraph_t.g_seq/g_id.
+     * @see lib/cgraph/cgraph.h:Agraph_s
+     */
+    subgraphs: Map<string, Graph>;
+    /**
+     * String attributes (agget/agset equivalents).
+     * Replaces the Agattr_t / Agsym_t machinery for simple key-value access.
+     * @see lib/cgraph/cgraph.h:Agattr_s
+     */
+    attrs: Map<string, string>;
+    /** Default attributes applied to all nodes in this graph scope. */
+    nodeDefaults: Map<string, string>;
+    /** Default attributes applied to all edges in this graph scope. */
+    edgeDefaults: Map<string, string>;
+    /**
+     * Snapshot of the enclosing graphs' graph-attribute defaults (this graph ->
+     * root, inner wins) captured when this subgraph was OPENED during parsing.
+     * Graph attributes set on an ancestor AFTER this subgraph was created are not
+     * included — mirroring cgraph's parse-time agsubg defval copy. Used for
+     * order-correct label/font inheritance (e.g. a root `label=` declared after a
+     * cluster must NOT apply to that cluster). Undefined on the root graph.
+     * @see lib/cgraph/graph.c:agsubg (attr defval copy)
+     */
+    graphDefaultsSnapshot?: Map<string, string>;
+    /**
+     * Layout-engine info; replaces GD_* macros via agbindrec (AD-1).
+     * @see lib/cgraph/cgraph.h:agbindrec
+     */
+    info: GraphInfo;
+    /**
+     * Immediate parent graph. null for root graphs.
+     * @see lib/cgraph/cgraph.h:Agraph_s
+     */
+    parent: Graph | null;
+    /**
+     * Root (main) graph. Self-referential for root graphs;
+     * points up for subgraphs.
+     * @see lib/cgraph/cgraph.h:Agraph_s
+     */
+    root: Graph;
+    /**
+     * Subgraph sequence number (AGSEQ). A global counter on the root, assigned
+     * at creation in source order, counting anonymous subgraphs. The root keeps
+     * the default 0 (par == NULL never calls agnextseq). Consumed by getObjId to
+     * emit cluster ids `clust<seq>`.
+     * @see lib/cgraph/cgraph.h:AGSEQ
+     * @see lib/cgraph/graph.c:agopen (AGSEQ(g) = agnextseq(par, AGRAPH))
+     */
+    seq: number;
+    /**
+     * Root-only counter mirroring `clos->seq[AGRAPH]`: the running maximum AGSEQ
+     * handed out to subgraphs. Meaningful only on the root graph; `assignSubgSeq`
+     * pre-increments it. Other graphs leave it at 0.
+     * @see lib/cgraph/graph.c:agnextseq (++clos->seq[AGRAPH])
+     */
+    subgSeqCounter: number;
+    /**
+     * Names of graph attributes (AGRAPH) declared anywhere in this hierarchy —
+     * the port's stand-in for cgraph's `Agsym_t` symbol table. Populated on the
+     * ROOT only, at parse time, whenever a graph attribute is assigned on any
+     * (sub)graph: setting `ordering=out` on a subgraph declares "ordering"
+     * graph-wide with an empty default, so `agGraphAttr(root, "ordering")` returns
+     * `""` (not undefined) — mirroring `agfindgraphattr`/`late_string`. Read via
+     * `agGraphAttr` (model/cgraph-ops.ts); empty on non-root graphs.
+     * @see lib/cgraph/attr.c:agattr (graph-wide declaration, "" default)
+     */
+    declaredGraphAttrs: Set<string>;
+    /** @see lib/cgraph/graph.c:agopen */
+    constructor(name: string, kind: GraphKind, anonymous?: boolean);
+}
+//# sourceMappingURL=graph.d.ts.map

package/dist/model/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/model/graph.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,KAAK,SAAS,EAAiB,MAAM,gBAAgB,CAAC;AAE/D;;;;;;;;;GASG;AACH,MAAM,MAAM,SAAS,GACjB,UAAU,GACV,YAAY,GACZ,iBAAiB,GACjB,mBAAmB,CAAC;AAExB;;;;;;;;;;;;GAYG;AACH,qBAAa,KAAK;IAChB,yEAAyE;IACzE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;;;;;;;OAQG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAE5B;;;OAGG;IACH,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAEzB;;;;OAIG;IACH,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAEzB;;;;OAIG;IACH,KAAK,EAAE,IAAI,EAAE,CAAC;IAEd;;;OAGG;IACH,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAE9B;;;;OAIG;IACH,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE3B,mEAAmE;IACnE,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAElC,mEAAmE;IACnE,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAElC;;;;;;;;OAQG;IACH,qBAAqB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE5C;;;OAGG;IACH,IAAI,EAAE,SAAS,CAAC;IAEhB;;;OAGG;IACH,MAAM,EAAE,KAAK,GAAG,IAAI,CAAC;IAErB;;;;OAIG;IACH,IAAI,EAAE,KAAK,CAAC;IAEZ;;;;;;;OAOG;IACH,GAAG,SAAK;IAER;;;;;OAKG;IACH,cAAc,SAAK;IAEnB;;;;;;;;;OASG;IACH,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IAE5C,qCAAqC;gBACzB,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,UAAQ;CAc7D"}

package/dist/model/graphInfo.d.ts

@@ -0,0 +1,418 @@
+/**
+ * TypeScript port of Agraphinfo_t from lib/common/types.h.
+ * All GD_* macros in the C source are replaced by typed fields on GraphInfo.
+ *
+ * Supporting types (LayoutParams, RatioKind, FontnameKind, RankEntry,
+ * RankTable) live in layoutParams.ts and rankEntry.ts to keep file size
+ * within limits.
+ *
+ * @see lib/common/types.h:Agraphinfo_t
+ */
+import type { Box, Point } from './geom.js';
+import type { Node } from './node.js';
+import type { Graph } from './graph.js';
+import type { LayoutParams, FontnameKind } from './layoutParams.js';
+import type { RankTable } from './rankEntry.js';
+import type { GvcContext } from '../gvc/context.js';
+export type { RatioKind, LayoutParams } from './layoutParams.js';
+export { FontnameKind } from './layoutParams.js';
+export type { AdjMatrix, RankEntry, RankTable } from './rankEntry.js';
+/**
+ * The rendering context attached to a laid-out graph (C's GVC_t). Retained
+ * under the historical name `GVContext` for the `common/types.ts` re-export;
+ * it now resolves to the concrete {@link GvcContext} rather than `unknown`, so
+ * every `g.info.gvc` read is typed instead of an ad-hoc `as { textMeasurer? }`
+ * cast. Type-only import — erased at compile time, so no runtime cycle with
+ * `gvc/context.ts`.
+ *
+ * @see lib/gvc/gvcext.h:GVC_t
+ */
+export type GVContext = GvcContext;
+/**
+ * Graph-level info record, equivalent to Agraphinfo_t in the C source.
+ * All GD_* accessor macros in the C source become plain typed fields here.
+ *
+ * Required fields (non-pointer C fields always present after graph_init):
+ * - bb, rankdir, flags, charset, gui_state, has_labels, has_images
+ *
+ * All C pointer fields become optional (`| undefined`) because they may
+ * legitimately be null/unset until the relevant layout pass runs.
+ *
+ * @see lib/common/types.h:Agraphinfo_t
+ */
+export interface GraphInfo {
+    /**
+     * Bounding box of the graph after layout.
+     * @see lib/common/types.h:GD_bb
+     */
+    bb: Box;
+    /**
+     * Rank direction + flip flags (raw int, encode via SET_RANKDIR macro).
+     * GD_rankdir(g) = rankdir & 0x3; GD_realrankdir(g) = rankdir >> 2.
+     * @see lib/common/types.h:GD_rankdir2
+     */
+    rankdir: number;
+    /**
+     * Edge type and layout engine flags bitmask.
+     * @see lib/common/types.h:GD_flags
+     */
+    flags: number;
+    /**
+     * Input character set constant (CHAR_UTF8, CHAR_LATIN1, CHAR_BIG5).
+     * @see lib/common/types.h:GD_charset
+     */
+    charset: number;
+    /**
+     * GUI state flags bitmask (GUI_STATE_ACTIVE, _SELECTED, _VISITED, _DELETED).
+     * @see lib/common/types.h:GD_gui_state
+     */
+    gui_state: number;
+    /**
+     * Bitmask of which label types are present in the graph.
+     * @see lib/common/types.h:GD_has_labels
+     */
+    has_labels: number;
+    /**
+     * True if any node uses an image.
+     * @see lib/common/types.h:GD_has_images
+     */
+    has_images: boolean;
+    /**
+     * Library-API-only flag (no C analogue): set by GvcContext.layout once the
+     * graph has been laid out. Not cleared by freeLayout — node coordinates and
+     * splines persist on the model after engine scratch is freed, so the
+     * "render then getLayout" workflow stays valid. The public `getLayout` reads
+     * it to reject a never-laid-out graph instead of returning the calloc-zero
+     * geometry defaults as if they were real coordinates.
+     */
+    laidOut?: boolean;
+    /**
+     * Resolved layout parameters (set by the layout engine init).
+     * @see lib/common/types.h:GD_drawing
+     */
+    drawing?: LayoutParams;
+    /**
+     * Cluster or graph title label. Typed fully in Batch 5b (textlabel_t).
+     * @see lib/common/types.h:GD_label
+     */
+    label?: unknown;
+    /**
+     * Margin sizes for graph labels; four Points corresponding to pointf[4].
+     * Indices: [0]=left, [1]=right, [2]=top, [3]=bottom per C convention.
+     * @see lib/common/types.h:GD_border
+     */
+    border?: [Point, Point, Point, Point];
+    /**
+     * GVC context for cross-graph globals.
+     * @see lib/common/types.h:GD_gvc
+     */
+    gvc?: GVContext;
+    /**
+     * Layout-engine cleanup function; called by graph_cleanup to free
+     * engine-specific data attached to this graph.
+     * @see lib/common/types.h:GD_cleanup
+     */
+    cleanup?: (g: Graph) => void;
+    /**
+     * Height below extremal ranks (dot layout).
+     * @see lib/common/types.h:GD_ht1
+     */
+    ht1?: number;
+    /**
+     * Height above extremal ranks (dot layout).
+     * @see lib/common/types.h:GD_ht2
+     */
+    ht2?: number;
+    /**
+     * Engine-specific algorithm state.
+     * @see lib/common/types.h:GD_alg
+     */
+    alg?: unknown;
+    /**
+     * Node list for neato layout.
+     * @see lib/common/types.h:GD_neato_nlist
+     */
+    neato_nlist?: Node[];
+    /**
+     * Move count for iterative neato placement.
+     * @see lib/common/types.h:GD_move
+     */
+    move?: number;
+    /**
+     * All-pairs distance matrix (neato).
+     * @see lib/common/types.h:GD_dist
+     */
+    dist?: number[][];
+    /**
+     * Spring constant matrix (neato).
+     * @see lib/common/types.h:GD_spring
+     */
+    spring?: number[][];
+    /**
+     * Spring force sum matrix (neato).
+     * @see lib/common/types.h:GD_sum_t
+     */
+    sum_t?: number[][];
+    /**
+     * Position delta tensor (neato, ndim-dimensional).
+     * @see lib/common/types.h:GD_t
+     */
+    t?: number[][][];
+    /**
+     * Number of layout dimensions.
+     * @see lib/common/types.h:GD_ndim
+     */
+    ndim?: number;
+    /**
+     * Original number of layout dimensions.
+     * @see lib/common/types.h:GD_odim
+     */
+    odim?: number;
+    /**
+     * Number of cluster subgraphs.
+     * @see lib/common/types.h:GD_n_cluster
+     */
+    n_cluster?: number;
+    /**
+     * Count of cluster edges created by fdp's processClusterEdges (edges whose
+     * endpoint names a cluster). Non-zero ⇒ HAS_CLUST_EDGE(g).
+     * @see lib/common/utils.c:processClusterEdges (cl_edge_t.n_cluster_edges)
+     */
+    n_cluster_edges?: number;
+    /**
+     * Cluster margin (in points). Corresponds to the `margin` attribute on a
+     * cluster graph, read by `late_int(g, G_margin, CL_OFFSET, 0)` in C.
+     * @see lib/dotgen/position.c:contain_nodes
+     */
+    clusterMargin?: number;
+    /**
+     * Cluster array.
+     *
+     * IMPORTANT: In C this is 1-indexed — clust[1..n_cluster]. This TypeScript
+     * array is 0-indexed; callers must add 1 when converting between C indices
+     * and this array's indices, or subtract 1 when coming from C.
+     *
+     * @see lib/common/types.h:GD_clust
+     */
+    clust?: Graph[];
+    /**
+     * The root graph for dot layout purposes.
+     * @see lib/common/types.h:GD_dotroot
+     */
+    dotroot?: Graph;
+    /**
+     * Linked-list head of nodes for dot layout traversal.
+     * @see lib/common/types.h:GD_nlist
+     */
+    nlist?: Node;
+    /**
+     * Rank table for dot layout (array indexed by rank level).
+     * @see lib/common/types.h:GD_rank
+     */
+    rank?: RankTable;
+    /**
+     * Containing cluster (not parent subgraph).
+     * @see lib/common/types.h:GD_parent
+     */
+    parent?: Graph;
+    /**
+     * Cluster nesting level (not node level).
+     * @see lib/common/types.h:GD_level
+     */
+    level?: number;
+    /**
+     * Set leader for minimum rank.
+     * @see lib/common/types.h:GD_minrep
+     */
+    minrep?: Node;
+    /**
+     * Set leader for maximum rank.
+     * @see lib/common/types.h:GD_maxrep
+     */
+    maxrep?: Node;
+    /**
+     * Fast-graph node component list.
+     * @see lib/common/types.h:GD_comp (nlist_t)
+     */
+    comp?: Node[];
+    /**
+     * Set leader for minimum connected component.
+     * @see lib/common/types.h:GD_minset
+     */
+    minset?: Node;
+    /**
+     * Set leader for maximum connected component.
+     * @see lib/common/types.h:GD_maxset
+     */
+    maxset?: Node;
+    /**
+     * Minimum rank value in this graph.
+     * @see lib/common/types.h:GD_minrank
+     */
+    minrank?: number;
+    /**
+     * Maximum rank value in this graph.
+     * @see lib/common/types.h:GD_maxrank
+     */
+    maxrank?: number;
+    /**
+     * True if the graph has any flat (same-rank) edges.
+     * @see lib/common/types.h:GD_has_flat_edges
+     */
+    has_flat_edges?: boolean;
+    /**
+     * Parity correction for the rank-array renumbering done by `abomination`.
+     * C inserts a flat-label rank at index -1 (so real nodes keep their even rank
+     * index); this 0-based port instead shifts every `ND_rank` up by 1 (AD-2),
+     * which inverts the rank-index parity that `make_LR_constraints` uses to pick
+     * the LR separation (`sep[i & 1]`). Each shift increments this offset so
+     * `lrSep` can recover C's parity via `(rankIdx + abomShift) & 1`. 0 / unset
+     * means no abomination happened. @see lib/dotgen/flat.c:abomination
+     */
+    abomShift?: number;
+    /**
+     * Show subdivision boxes for debugging; 0 means off.
+     * @see lib/common/types.h:GD_showboxes
+     */
+    showboxes?: number;
+    /**
+     * SVG font name mangling setting.
+     * @see lib/common/types.h:GD_fontnames
+     */
+    fontnames?: FontnameKind;
+    /**
+     * Node separation in points.
+     * @see lib/common/types.h:GD_nodesep
+     */
+    nodesep?: number;
+    /**
+     * Rank separation in points.
+     * @see lib/common/types.h:GD_ranksep
+     */
+    ranksep?: number;
+    /**
+     * Left-boundary node of the bounding box.
+     * @see lib/common/types.h:GD_ln
+     */
+    ln?: Node;
+    /**
+     * Right-boundary node of the bounding box.
+     * @see lib/common/types.h:GD_rn
+     */
+    rn?: Node;
+    /**
+     * Cluster leader node.
+     * @see lib/common/types.h:GD_leader
+     */
+    leader?: Node;
+    /**
+     * Per-rank leader node array.
+     * @see lib/common/types.h:GD_rankleader
+     */
+    rankleader?: Node[];
+    /**
+     * True if the cluster has been expanded.
+     * @see lib/common/types.h:GD_expanded
+     */
+    expanded?: boolean;
+    /**
+     * Installation state flag.
+     * @see lib/common/types.h:GD_installed
+     */
+    installed?: number;
+    /**
+     * Set type for union-find operations.
+     * @see lib/common/types.h:GD_set_type
+     */
+    set_type?: number;
+    /**
+     * Label position flag for cluster labels.
+     * @see lib/common/types.h:GD_label_pos
+     */
+    label_pos?: number;
+    /**
+     * Whether exact rank separation is enforced.
+     * @see lib/common/types.h:GD_exact_ranksep
+     */
+    exact_ranksep?: boolean;
+    /**
+     * Whether the rank direction is flipped (used in flat_reorder and build_ranks).
+     * Set from GD_realrankdir: true when layout is LR or RL (horizontal).
+     * @see lib/dotgen/mincross.c:GD_flip
+     */
+    flip?: boolean;
+    /**
+     * Whether edge concentration is enabled (merges parallel edges).
+     * Corresponds to the `concentrate` graph attribute.
+     * @see lib/dotgen/class2.c:Concentrate
+     */
+    concentrate?: boolean;
+    /**
+     * Whether the graph has compound edges (lhead/ltail attributes set on edges).
+     * When true, dot_compoundEdges clips splines to cluster bounding boxes.
+     * Corresponds to the `compound` graph attribute.
+     * @see lib/dotgen/compound.c:dot_compoundEdges
+     * @see lib/common/types.h:GD_flags (via compound flag)
+     */
+    compound?: boolean;
+    /**
+     * AD-8 phase marker: true between create_aux_edges and set_xcoords,
+     * while ND_rank holds x-coordinates instead of rank indices.
+     * Cleared by setXcoords after ND_coord.x is populated.
+     * @see lib/dotgen/position.c:set_xcoords (AD-8)
+     */
+    rankIsXCoord?: boolean;
+    /**
+     * MT19937 seed used by the SGD layout engine.
+     * Corresponds to the rk_seed() call in lib/neatogen/sgd.c.
+     * Defaults to 0 when not set.
+     *
+     * @see lib/neatogen/sgd.c:sgd (rk_seed call)
+     */
+    seed?: number;
+    /**
+     * Per-layout flag: true when edge label positions have been computed by
+     * the spline-routing pass (dotsplines.c:EdgeLabelsDone).
+     *
+     * C uses a process-global `EdgeLabelsDone` (lib/common/globals.h) reset in
+     * lib/common/input.c:commonInitGraph and set at lib/dotgen/dotsplines.c:471.
+     * This port lifts it onto GraphInfo so it is per-graph (no globals).
+     *
+     * @see lib/common/globals.h:EdgeLabelsDone
+     * @see lib/dotgen/dotsplines.c:471
+     */
+    edgeLabelsDone?: boolean;
+    /**
+     * Neato start attribute: controls initial placement and RNG seed.
+     * Values: "random[N]" | "self" | "regular" | numeric string.
+     * Corresponds to agget(g, "start") in lib/neatogen/neatoinit.c:setSeed.
+     *
+     * @see lib/neatogen/neatoinit.c:setSeed
+     */
+    start?: string;
+    /**
+     * Neato layout mode string attribute.
+     * Values: "KK" | "major" | "hier" | "ipsep" | "sgd".
+     * Corresponds to agget(g, "mode") in lib/neatogen/neato.h:neatoMode.
+     *
+     * @see lib/neatogen/neato.h:neatoMode
+     */
+    mode?: string;
+    /**
+     * Neato overlap removal control.
+     * "false" disables VPSC overlap removal; any other value enables it.
+     * Corresponds to agget(g, "overlap") in lib/neatogen/neatoinit.c.
+     *
+     * @see lib/neatogen/neatoinit.c:neato_layout
+     */
+    overlap?: string;
+}
+/**
+ * Creates a zero-initialized GraphInfo with all required fields set to their
+ * defaults. All optional fields are left undefined (absent from the object),
+ * matching a freshly allocated Agraphinfo_t after graph_init().
+ *
+ * @see lib/common/utils.c:graph_init
+ */
+export declare function makeGraphInfo(): GraphInfo;
+//# sourceMappingURL=graphInfo.d.ts.map

package/dist/model/graphInfo.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphInfo.d.ts","sourceRoot":"","sources":["../../src/model/graphInfo.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACpE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAGpD,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAGjE,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAMtE;;;;;;;;;GASG;AACH,MAAM,MAAM,SAAS,GAAG,UAAU,CAAC;AAMnC;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,SAAS;IAKxB;;;OAGG;IACH,EAAE,EAAE,GAAG,CAAC;IAER;;;;OAIG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAC;IAEd;;;OAGG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;;OAGG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,UAAU,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,UAAU,EAAE,OAAO,CAAC;IAEpB;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;IAMlB;;;OAGG;IACH,OAAO,CAAC,EAAE,YAAY,CAAC;IAEvB;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;IAEhB;;;;OAIG;IACH,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAEtC;;;OAGG;IACH,GAAG,CAAC,EAAE,SAAS,CAAC;IAEhB;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC;IAE7B;;;OAGG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;IAEb;;;OAGG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;IAEb;;;OAGG;IACH,GAAG,CAAC,EAAE,OAAO,CAAC;IAMd;;;OAGG;IACH,WAAW,CAAC,EAAE,IAAI,EAAE,CAAC;IAErB;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IAElB;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IAEpB;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IAEnB;;;OAGG;IACH,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAEjB;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAMd;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;;OAIG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB;;;;;;;;OAQG;IACH,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;IAEhB;;;OAGG;IACH,OAAO,CAAC,EAAE,KAAK,CAAC;IAEhB;;;OAGG;IACH,KAAK,CAAC,EAAE,IAAI,CAAC;IAEb;;;OAGG;IACH,IAAI,CAAC,EAAE,SAAS,CAAC;IAEjB;;;OAGG;IACH,MAAM,CAAC,EAAE,KAAK,CAAC;IAEf;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;OAGG;IACH,MAAM,CAAC,EAAE,IAAI,CAAC;IAEd;;;OAGG;IACH,MAAM,CAAC,EAAE,IAAI,CAAC;IAEd;;;OAGG;IACH,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;IAEd;;;OAGG;IACH,MAAM,CAAC,EAAE,IAAI,CAAC;IAEd;;;OAGG;IACH,MAAM,CAAC,EAAE,IAAI,CAAC;IAEd;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IAEzB;;;;;;;;OAQG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,SAAS,CAAC,EAAE,YAAY,CAAC;IAEzB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,EAAE,CAAC,EAAE,IAAI,CAAC;IAEV;;;OAGG;IACH,EAAE,CAAC,EAAE,IAAI,CAAC;IAEV;;;OAGG;IACH,MAAM,CAAC,EAAE,IAAI,CAAC;IAEd;;;OAGG;IACH,UAAU,CAAC,EAAE,IAAI,EAAE,CAAC;IAEpB;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IAEnB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;;OAIG;IACH,IAAI,CAAC,EAAE,OAAO,CAAC;IAEf;;;;OAIG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB;;;;;;OAMG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IAEnB;;;;;OAKG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IAEvB;;;;;;OAMG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;;;;;;;;OAUG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IAEzB;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;;;;OAMG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAMD;;;;;;GAMG;AACH,wBAAgB,aAAa,IAAI,SAAS,CAUzC"}

package/dist/model/index.d.ts

@@ -0,0 +1,10 @@
+export * from './geom.js';
+export * from './graph.js';
+export * from './node.js';
+export * from './edge.js';
+export * from './graphInfo.js';
+export * from './layoutParams.js';
+export * from './rankEntry.js';
+export * from './nodeInfo.js';
+export * from './edgeInfo.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/model/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/model/index.ts"],"names":[],"mappings":"AACA,cAAc,WAAW,CAAC;AAC1B,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,mBAAmB,CAAC;AAClC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC"}

package/dist/model/layoutParams.d.ts

@@ -0,0 +1,85 @@
+/**
+ * LayoutParams, RatioKind, and FontnameKind — supporting types for GraphInfo.
+ * Ported from lib/common/types.h:layout_t and lib/common/types.h:ratio_t.
+ *
+ * @see lib/common/types.h:layout_t
+ * @see lib/common/types.h:ratio_t
+ * @see lib/common/types.h:fontname_kind
+ */
+import type { Point } from './geom.js';
+/**
+ * Ratio kind matching ratio_t enum.
+ * R_NONE=0, R_VALUE, R_FILL, R_COMPRESS, R_AUTO, R_EXPAND
+ *
+ * @see lib/common/types.h:ratio_t
+ */
+export type RatioKind = 'none' | 'value' | 'fill' | 'compress' | 'auto' | 'expand';
+/**
+ * Controls SVG font-name mangling.
+ * NATIVEFONTS=0, PSFONTS=1, SVGFONTS=2
+ *
+ * @see lib/common/types.h:fontname_kind
+ */
+export declare const FontnameKind: {
+    readonly NativeFonts: 0;
+    readonly PsFonts: 1;
+    readonly SvgFonts: 2;
+};
+export type FontnameKind = (typeof FontnameKind)[keyof typeof FontnameKind];
+/**
+ * Graph-level layout parameters; stored via GD_drawing.
+ *
+ * @see lib/common/types.h:layout_t
+ * @see lib/common/types.h:GD_drawing
+ */
+export interface LayoutParams {
+    /** Coordinate quantization step. @see lib/common/types.h:layout_t.quantum */
+    quantum: number;
+    /** Output scale factor. @see lib/common/types.h:layout_t.scale */
+    scale: number;
+    /**
+     * Aspect ratio; set only when ratioKind === 'value'.
+     * @see lib/common/types.h:layout_t.ratio
+     */
+    ratio: number;
+    /** Dots per inch. @see lib/common/types.h:layout_t.dpi */
+    dpi: number;
+    /** Page margin. @see lib/common/types.h:layout_t.margin */
+    margin: Point;
+    /** Page size. @see lib/common/types.h:layout_t.page */
+    page: Point;
+    /** Desired graph drawing size. @see lib/common/types.h:layout_t.size */
+    size: Point;
+    /** Fit graph to page. @see lib/common/types.h:layout_t.filled */
+    filled: boolean;
+    /** Landscape orientation. @see lib/common/types.h:layout_t.landscape */
+    landscape: boolean;
+    /** Center graph on page. @see lib/common/types.h:layout_t.centered */
+    centered: boolean;
+    /** Ratio mode. @see lib/common/types.h:layout_t.ratio_kind */
+    ratioKind: RatioKind;
+    /**
+     * Whether parallel edges should be concentrated into fewer edges.
+     * @see lib/common/globals.h:Concentrate
+     */
+    concentrate?: boolean;
+    /**
+     * Parsed xdot data; typed fully in a later batch.
+     * @see lib/common/types.h:layout_t.xdots
+     */
+    xdots: unknown | null;
+    /**
+     * Graph identifier string.
+     * @see lib/common/types.h:layout_t.id
+     */
+    id: string | null;
+}
+/**
+ * Construct a `LayoutParams` mirroring C's calloc-zeroed `layout_t` (GD_drawing),
+ * with the given fields overridden. C zero-inits every field, then `graph_init`
+ * sets only the ones it parses (ratio_kind, size, filled, …); this factory keeps
+ * the unset fields at their C-zero defaults so callers populate just what they
+ * need. @see lib/common/types.h:layout_t (allocated via agbindrec/calloc)
+ */
+export declare function makeDrawing(overrides: Partial<LayoutParams>): LayoutParams;
+//# sourceMappingURL=layoutParams.d.ts.map

package/dist/model/layoutParams.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layoutParams.d.ts","sourceRoot":"","sources":["../../src/model/layoutParams.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAMvC;;;;;GAKG;AACH,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,OAAO,GACP,MAAM,GACN,UAAU,GACV,MAAM,GACN,QAAQ,CAAC;AAMb;;;;;GAKG;AACH,eAAO,MAAM,YAAY;;;;CAIf,CAAC;AACX,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,YAAY,CAAC,CAAC,MAAM,OAAO,YAAY,CAAC,CAAC;AAM5E;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,6EAA6E;IAC7E,OAAO,EAAE,MAAM,CAAC;IAChB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAC;IACd,0DAA0D;IAC1D,GAAG,EAAE,MAAM,CAAC;IACZ,2DAA2D;IAC3D,MAAM,EAAE,KAAK,CAAC;IACd,uDAAuD;IACvD,IAAI,EAAE,KAAK,CAAC;IACZ,wEAAwE;IACxE,IAAI,EAAE,KAAK,CAAC;IACZ,iEAAiE;IACjE,MAAM,EAAE,OAAO,CAAC;IAChB,wEAAwE;IACxE,SAAS,EAAE,OAAO,CAAC;IACnB,sEAAsE;IACtE,QAAQ,EAAE,OAAO,CAAC;IAClB,8DAA8D;IAC9D,SAAS,EAAE,SAAS,CAAC;IACrB;;;OAGG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB;;;OAGG;IACH,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IACtB;;;OAGG;IACH,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;CACnB;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,YAAY,CAAC,GAAG,YAAY,CAkB1E"}