@dagrejs/dagre 1.0.0 → 1.0.2

package/dist/dagre.js

@@ -2950,7 +2950,7 @@ function zipObject(props, values) {
 }
 
 },{"@dagrejs/graphlib":29}],28:[function(require,module,exports){
-module.exports = "1.0.0";
+module.exports = "1.0.2";
 
 },{}],29:[function(require,module,exports){
 /**
@@ -4117,6 +4117,19 @@ class Graph {
     return this.#edgeLabels[e];
   }
 
+  /**
+   * Gets the label for the specified edge and converts it to an object.
+   * Complexity: O(1)
+   */
+  edgeAsObj() {
+    const edge = this.edge(...arguments);
+    if (typeof edge !== "object") {
+      return {label: edge};
+    }
+
+    return edge;
+  }
+
   /**
    * Detects whether the graph contains specified edge or not. No subgraphs are considered.
    * Complexity: O(1).
@@ -4331,7 +4344,7 @@ function read(json) {
 }
 
 },{"./graph":44}],47:[function(require,module,exports){
-module.exports = '2.1.12';
+module.exports = '2.1.13';
 
 },{}]},{},[1])(1)
 });

package/dist/dagre.min.js

@@ -495,7 +495,7 @@ var offset=Math.min(...g.nodes().map(v=>g.node(v).rank));var layers=[];g.nodes()
 /*
  * Returns a new function that wraps `fn` with a timer. The wrapper logs the
  * time it takes to execute the function.
- */function time(name,fn){var start=Date.now();try{return fn()}finally{console.log(name+" time: "+(Date.now()-start)+"ms")}}function notime(name,fn){return fn()}let idCounter=0;function uniqueId(prefix){var id=++idCounter;return toString(prefix)+id}function range(start,limit,step=1){if(limit==null){limit=start;start=0}let endCon=i=>i<limit;if(step<0){endCon=i=>limit<i}const range=[];for(let i=start;endCon(i);i+=step){range.push(i)}return range}function pick(source,keys){const dest={};for(const key of keys){if(source[key]!==undefined){dest[key]=source[key]}}return dest}function mapValues(obj,funcOrProp){let func=funcOrProp;if(typeof funcOrProp==="string"){func=val=>val[funcOrProp]}return Object.entries(obj).reduce((acc,[k,v])=>{acc[k]=func(v,k);return acc},{})}function zipObject(props,values){return props.reduce((acc,key,i)=>{acc[key]=values[i];return acc},{})}},{"@dagrejs/graphlib":29}],28:[function(require,module,exports){module.exports="1.0.0"},{}],29:[function(require,module,exports){
+ */function time(name,fn){var start=Date.now();try{return fn()}finally{console.log(name+" time: "+(Date.now()-start)+"ms")}}function notime(name,fn){return fn()}let idCounter=0;function uniqueId(prefix){var id=++idCounter;return toString(prefix)+id}function range(start,limit,step=1){if(limit==null){limit=start;start=0}let endCon=i=>i<limit;if(step<0){endCon=i=>limit<i}const range=[];for(let i=start;endCon(i);i+=step){range.push(i)}return range}function pick(source,keys){const dest={};for(const key of keys){if(source[key]!==undefined){dest[key]=source[key]}}return dest}function mapValues(obj,funcOrProp){let func=funcOrProp;if(typeof funcOrProp==="string"){func=val=>val[funcOrProp]}return Object.entries(obj).reduce((acc,[k,v])=>{acc[k]=func(v,k);return acc},{})}function zipObject(props,values){return props.reduce((acc,key,i)=>{acc[key]=values[i];return acc},{})}},{"@dagrejs/graphlib":29}],28:[function(require,module,exports){module.exports="1.0.2"},{}],29:[function(require,module,exports){
 /**
  * Copyright (c) 2014, Chris Pettitt
  * All rights reserved.
@@ -756,6 +756,10 @@ v=edgeObj.v;w=edgeObj.w;Object.freeze(edgeObj);this.#edgeObjs[e]=edgeObj;increme
    * Gets the label for the specified edge.
    * Complexity: O(1).
    */edge(v,w,name){var e=arguments.length===1?edgeObjToId(this.#isDirected,arguments[0]):edgeArgsToId(this.#isDirected,v,w,name);return this.#edgeLabels[e]}
+/**
+   * Gets the label for the specified edge and converts it to an object.
+   * Complexity: O(1)
+   */edgeAsObj(){const edge=this.edge(...arguments);if(typeof edge!=="object"){return{label:edge}}return edge}
 /**
    * Detects whether the graph contains specified edge or not. No subgraphs are considered.
    * Complexity: O(1).
@@ -794,4 +798,4 @@ module.exports={Graph:require("./graph"),version:require("./version")}},{"./grap
  * // ['a', 'b']
  * g2.edges()
  * // [ { v: 'a', w: 'b' } ]
- */function read(json){var g=new Graph(json.options).setGraph(json.value);json.nodes.forEach(function(entry){g.setNode(entry.v,entry.value);if(entry.parent){g.setParent(entry.v,entry.parent)}});json.edges.forEach(function(entry){g.setEdge({v:entry.v,w:entry.w,name:entry.name},entry.value)});return g}},{"./graph":44}],47:[function(require,module,exports){module.exports="2.1.12"},{}]},{},[1])(1)});
+ */function read(json){var g=new Graph(json.options).setGraph(json.value);json.nodes.forEach(function(entry){g.setNode(entry.v,entry.value);if(entry.parent){g.setParent(entry.v,entry.parent)}});json.edges.forEach(function(entry){g.setEdge({v:entry.v,w:entry.w,name:entry.name},entry.value)});return g}},{"./graph":44}],47:[function(require,module,exports){module.exports="2.1.13"},{}]},{},[1])(1)});

package/index.d.ts

@@ -0,0 +1,132 @@
+// Type definitions for dagre 1.0.1
+// Project: https://github.com/dagrejs/dagre
+// Definitions by: Qinfeng Chen <https://github.com/qinfchen>
+//                 Pete Vilter <https://github.com/vilterp>
+//                 David Newell <https://github.com/rustedgrail>
+//                 Graham Lea <https://github.com/GrahamLea>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+
+declare module '@dagrejs/dagre' {
+  export namespace graphlib {
+    class Graph<T = {}> {
+      constructor(opt?: { directed?: boolean | undefined; multigraph?: boolean | undefined; compound?: boolean | undefined });
+
+      graph(): GraphLabel;
+      isDirected(): boolean;
+      isMultiGraph(): boolean;
+      setGraph(label: GraphLabel): Graph<T>;
+
+      edge(edgeObj: Edge): GraphEdge;
+      edge(outNodeName: string, inNodeName: string, name?: string): GraphEdge;
+      edgeCount(): number;
+      edges(): Edge[];
+      hasEdge(edgeObj: Edge): boolean;
+      hasEdge(outNodeName: string, inNodeName: string, name?: string): boolean;
+      inEdges(inNodeName: string, outNodeName?: string): Edge[] | undefined;
+      outEdges(outNodeName: string, inNodeName?: string): Edge[] | undefined;
+      removeEdge(outNodeName: string, inNodeName: string, name?: string): Graph<T>;
+      setDefaultEdgeLabel(callback: string | ((v: string, w: string, name?: string) => string | Label)): Graph<T>;
+      setEdge(params: Edge, value?: string | { [key: string]: any }): Graph<T>;
+      setEdge(sourceId: string, targetId: string, value?: string | Label, name?: string): Graph<T>;
+
+      children(parentName: string): string | undefined;
+      hasNode(name: string): boolean;
+      neighbors(name: string): Array<Node<T>> | undefined;
+      node(id: string | Label): Node<T>;
+      nodeCount(): number;
+      nodes(): string[];
+      parent(childName: string): string | undefined;
+      predecessors(name: string): Array<Node<T>> | undefined;
+      removeNode(name: string): Graph<T>;
+      filterNodes(callback: (nodeId: string) => boolean): Graph<T>;
+      setDefaultNodeLabel(callback: string | ((nodeId: string) => string | Label)): Graph<T>;
+      setNode(name: string, label: string | Label): Graph<T>;
+      setParent(childName: string, parentName: string): void;
+      sinks(): Array<Node<T>>;
+      sources(): Array<Node<T>>;
+      successors(name: string): Array<Node<T>> | undefined;
+    }
+
+    namespace json {
+      function read(graph: any): Graph;
+      function write(graph: Graph): any;
+    }
+
+    namespace alg {
+      function components(graph: Graph): string[][];
+      function dijkstra(graph: Graph, source: string, weightFn?: WeightFn, edgeFn?: EdgeFn): any;
+      function dijkstraAll(graph: Graph, weightFn?: WeightFn, edgeFn?: EdgeFn): any;
+      function findCycles(graph: Graph): string[][];
+      function floydWarchall(graph: Graph, weightFn?: WeightFn, edgeFn?: EdgeFn): any;
+      function isAcyclic(graph: Graph): boolean;
+      function postorder(graph: Graph, nodeNames: string | string[]): string[];
+      function preorder(graph: Graph, nodeNames: string | string[]): string[];
+      function prim<T>(graph: Graph<T>, weightFn?: WeightFn): Graph<T>;
+      function tarjam(graph: Graph): string[][];
+      function topsort(graph: Graph): string[];
+    }
+  }
+
+  export interface Label {
+    [key: string]: any;
+  }
+  export type WeightFn = (edge: Edge) => number;
+  export type EdgeFn = (outNodeName: string) => GraphEdge[];
+
+  export interface GraphLabel {
+    width?: number | undefined;
+    height?: number | undefined;
+    compound?: boolean | undefined;
+    rankdir?: string | undefined;
+    align?: string | undefined;
+    nodesep?: number | undefined;
+    edgesep?: number | undefined;
+    ranksep?: number | undefined;
+    marginx?: number | undefined;
+    marginy?: number | undefined;
+    acyclicer?: string | undefined;
+    ranker?: string | undefined;
+  }
+
+  export interface NodeConfig {
+    width?: number | undefined;
+    height?: number | undefined;
+  }
+
+  export interface EdgeConfig {
+    minlen?: number | undefined;
+    weight?: number | undefined;
+    width?: number | undefined;
+    height?: number | undefined;
+    lablepos?: 'l' | 'c' | 'r' | undefined;
+    labeloffest?: number | undefined;
+  }
+
+  export function layout(graph: graphlib.Graph, layout?: GraphLabel & NodeConfig & EdgeConfig): void;
+
+  export interface Edge {
+    v: string;
+    w: string;
+    name?: string | undefined;
+  }
+
+  export interface GraphEdge {
+    points: Array<{ x: number; y: number }>;
+    [key: string]: any;
+  }
+
+  export type Node<T = {}> = T & {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+    class?: string | undefined;
+    label?: string | undefined;
+    padding?: number | undefined;
+    paddingX?: number | undefined;
+    paddingY?: number | undefined;
+    rx?: number | undefined;
+    ry?: number | undefined;
+    shape?: string | undefined;
+  };
+}

package/lib/version.js

@@ -1 +1 @@
-module.exports = "1.0.0";
+module.exports = "1.0.2";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@dagrejs/dagre",
-  "version": "1.0.0",
+  "version": "1.0.2",
   "description": "Graph layout for JavaScript",
   "author": "Chris Pettitt <cpettitt@gmail.com>",
   "contributors": [
@@ -14,15 +14,17 @@
   },
   "files": [
     "index.js",
+    "index.d.ts",
     "dist/",
     "lib/"
   ],
+  "types": "index.d.ts",
   "keywords": [
     "graph",
     "layout"
   ],
   "dependencies": {
-    "@dagrejs/graphlib": "2.1.12"
+    "@dagrejs/graphlib": "2.1.13"
   },
   "devDependencies": {
     "benchmark": "2.1.4",