data-structure-typed 2.6.1 → 2.6.2

package/dist/types/data-structures/graph/abstract-graph.d.ts

@@ -42,6 +42,11 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
     get vertexMap(): Map<VertexKey, VO>;
     set vertexMap(v: Map<VertexKey, VO>);
     get size(): number;
+    /**
+     * The edge connector string used in visual output.
+     * Override in subclasses (e.g., '--' for undirected, '->' for directed).
+     */
+    protected get _edgeConnector(): string;
     /**
      * Create a new vertex instance (implementation specific).
      * @param key - Vertex identifier.
@@ -269,6 +274,45 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * @remarks Time O(V + E), Space O(V + E)
      */
     clone(): this;
+    /**
+     * Generate a text-based visual representation of the graph.
+     *
+     * **Adjacency list format:**
+     * ```
+     * Graph (5 vertices, 6 edges):
+     * A -> B (1), C (2)
+     * B -> D (3)
+     * C -> (no outgoing edges)
+     * D -> A (1)
+     * E (isolated)
+     * ```
+     *
+     * @param options - Optional display settings.
+     * @param options.showWeight - Whether to show edge weights (default: true).
+     * @returns The visual string.
+     */
+    toVisual(options?: {
+        showWeight?: boolean;
+    }): string;
+    /**
+     * Generate DOT language representation for Graphviz.
+     *
+     * @param options - Optional display settings.
+     * @param options.name - Graph name (default: 'G').
+     * @param options.showWeight - Whether to label edges with weight (default: true).
+     * @returns DOT format string.
+     */
+    toDot(options?: {
+        name?: string;
+        showWeight?: boolean;
+    }): string;
+    /**
+     * Print the graph to console.
+     * @param options - Display settings passed to `toVisual`.
+     */
+    print(options?: {
+        showWeight?: boolean;
+    }): void;
     /**
      * Internal iterator over `[key, value]` entries in insertion order.
      * @returns Iterator of `[VertexKey, V | undefined]`.
@@ -337,48 +381,4 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * @remarks Time O(1), Space O(1)
      */
     protected _getVertexKey(vertexOrKey: VO | VertexKey): VertexKey;
-    /**
-     * The edge connector string used in visual output.
-     * Override in subclasses (e.g., '--' for undirected, '->' for directed).
-     */
-    protected get _edgeConnector(): string;
-    /**
-     * Generate a text-based visual representation of the graph.
-     *
-     * **Adjacency list format:**
-     * ```
-     * Graph (5 vertices, 6 edges):
-     * A -> B (1), C (2)
-     * B -> D (3)
-     * C -> (no outgoing edges)
-     * D -> A (1)
-     * E (isolated)
-     * ```
-     *
-     * @param options - Optional display settings.
-     * @param options.showWeight - Whether to show edge weights (default: true).
-     * @returns The visual string.
-     */
-    toVisual(options?: {
-        showWeight?: boolean;
-    }): string;
-    /**
-     * Generate DOT language representation for Graphviz.
-     *
-     * @param options - Optional display settings.
-     * @param options.name - Graph name (default: 'G').
-     * @param options.showWeight - Whether to label edges with weight (default: true).
-     * @returns DOT format string.
-     */
-    toDot(options?: {
-        name?: string;
-        showWeight?: boolean;
-    }): string;
-    /**
-     * Print the graph to console.
-     * @param options - Display settings passed to `toVisual`.
-     */
-    print(options?: {
-        showWeight?: boolean;
-    }): void;
 }