Updating the test

types/dagre/dagre-tests.ts

@@ -1,8 +1,39 @@
-const gDagre = new dagre.graphlib.Graph();
+const gDagre = new dagre.graphlib.Graph({compound: true, multigraph: false});
 gDagre.setGraph({})
   .setDefaultEdgeLabel(() => ({}))
+  .setDefaultNodeLabel(() => ({}))
   .setNode("a", {})
   .setEdge("b", "c")
   .setEdge("c", "d", {class: "class"});
 
 dagre.layout(gDagre);
+
+gDagre.edge({v: 'b', w: 'c'});
+gDagre.hasEdge({v: 'b', w: 'c'});
+gDagre.inEdges('c');
+gDagre.outEdges('c');
+
+gDagre.setParent('a', 'b');
+gDagre.children('b');
+gDagre.hasNode('d');
+gDagre.neighbors('c');
+gDagre.node({});
+gDagre.parent('a');
+gDagre.predecessors('d');
+gDagre.successors('b');
+
+gDagre.removeEdge('c', 'd').removeNode('d');
+
+dagre.graphlib.json.read(dagre.graphlib.json.write(gDagre));
+
+dagre.graphlib.alg.components(gDagre);
+dagre.graphlib.alg.dijkstra(gDagre, 'a', (edge) => 5);
+dagre.graphlib.alg.dijkstraAll(gDagre);
+dagre.graphlib.alg.findCycles(gDagre);
+dagre.graphlib.alg.floydWarchall(gDagre);
+dagre.graphlib.alg.isAcyclic(gDagre);
+dagre.graphlib.alg.postorder(gDagre, 'a');
+dagre.graphlib.alg.preorder(gDagre, ['b', 'c']);
+dagre.graphlib.alg.prim(gDagre);
+dagre.graphlib.alg.tarjam(gDagre);
+dagre.graphlib.alg.topsort(gDagre);

types/dagre/index.d.ts

@@ -41,7 +41,7 @@ export namespace graphlib {
         predecessors(name: string): Node[]|undefined;
         removeNode(name: string): Graph;
         setDefaultNodeLabel(callback: string|((nodeId: string) => string|Label)): Graph;
-        setNode(id: string, node: NodeConfig): Graph;
+        setNode(name: string, label: string|Label): Graph;
         setParent(childName: string, parentName: string): void;
         sinks(): Node[];
         sources(): Node[];