File size: 1,566 Bytes
c211499
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
export class Graph {
  constructor(opts?: {});
  _isDirected: any;
  _isMultigraph: any;
  _isCompound: any;
  _label: any;
  _defaultNodeLabelFn: () => any;
  _defaultEdgeLabelFn: () => any;
  _nodes: {};
  _parent: {};
  _children: {};
  _in: {};
  _preds: {};
  _out: {};
  _sucs: {};
  _edgeObjs: {};
  _edgeLabels: {};
  isDirected(): any;
  isMultigraph(): any;
  isCompound(): any;
  setGraph(label: any): Graph;
  graph(): any;
  setDefaultNodeLabel(newDefault: any): Graph;
  nodeCount(): number;
  nodes(): string[];
  sources(): string[];
  sinks(): string[];
  setNodes(vs: any, value: any, ...args: any[]): Graph;
  setNode(v: any, value: any, ...args: any[]): Graph;
  node(v: any): any;
  hasNode(v: any): boolean;
  removeNode(v: any): Graph;
  setParent(v: any, parent: any): Graph;
  _removeFromParentsChildList(v: any): void;
  parent(v: any): any;
  children(v: any): string[];
  predecessors(v: any): string[];
  successors(v: any): string[];
  neighbors(v: any): string[];
  isLeaf(v: any): boolean;
  filterNodes(filter: any): any;
  setDefaultEdgeLabel(newDefault: any): Graph;
  edgeCount(): number;
  edges(): any[];
  setPath(vs: any, value: any, ...args: any[]): Graph;
  setEdge(...args: any[]): Graph;
  edge(v: any, w: any, name: any, ...args: any[]): any;
  hasEdge(v: any, w: any, name: any, ...args: any[]): boolean;
  removeEdge(v: any, w: any, name: any, ...args: any[]): Graph;
  inEdges(v: any, u: any): any[];
  outEdges(v: any, w: any): any[];
  nodeEdges(v: any, w: any): any[];
  _nodeCount: number;
  _edgeCount: number;
}