The open and composable observability and data visualization platform. Visualize metrics, logs, and traces from multiple sources like Prometheus, Loki, Elasticsearch, InfluxDB, Postgres and many more.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
grafana/public/app/core/utils/dag.ts

214 lines
4.7 KiB

export class Edge {
inputNode?: Node;
outputNode?: Node;
_linkTo(node: Node, direction: number) {
if (direction <= 0) {
node.inputEdges.push(this);
}
if (direction >= 0) {
node.outputEdges.push(this);
}
node.edges.push(this);
}
link(inputNode: Node, outputNode: Node) {
if (!inputNode) {
throw Error('inputNode is required');
}
if (!outputNode) {
throw Error('outputNode is required');
}
this.unlink();
this.inputNode = inputNode;
this.outputNode = outputNode;
this._linkTo(inputNode, 1);
this._linkTo(outputNode, -1);
return this;
}
unlink() {
let pos;
const inode = this.inputNode;
const onode = this.outputNode;
if (!(inode && onode)) {
return;
}
pos = inode.edges.indexOf(this);
if (pos > -1) {
inode.edges.splice(pos, 1);
}
pos = onode.edges.indexOf(this);
if (pos > -1) {
onode.edges.splice(pos, 1);
}
pos = inode.outputEdges.indexOf(this);
if (pos > -1) {
inode.outputEdges.splice(pos, 1);
}
pos = onode.inputEdges.indexOf(this);
if (pos > -1) {
onode.inputEdges.splice(pos, 1);
}
}
}
export class Node {
name: string;
edges: Edge[];
inputEdges: Edge[];
outputEdges: Edge[];
constructor(name: string) {
this.name = name;
this.edges = [];
this.inputEdges = [];
this.outputEdges = [];
}
getEdgeFrom(from: string | Node): Edge | null | undefined {
if (!from) {
return null;
}
if (typeof from === 'object') {
return this.inputEdges.find((e) => e.inputNode?.name === from.name);
}
return this.inputEdges.find((e) => e.inputNode?.name === from);
}
getEdgeTo(to: string | Node): Edge | null | undefined {
if (!to) {
return null;
}
if (typeof to === 'object') {
return this.outputEdges.find((e) => e.outputNode?.name === to.name);
}
return this.outputEdges.find((e) => e.outputNode?.name === to);
}
getOptimizedInputEdges(): Edge[] {
const toBeRemoved: any[] = [];
this.inputEdges.forEach((e) => {
const inputEdgesNodes = e.inputNode?.inputEdges.map((e) => e.inputNode);
inputEdgesNodes?.forEach((n) => {
const edgeToRemove = n?.getEdgeTo(this.name);
if (edgeToRemove) {
toBeRemoved.push(edgeToRemove);
}
});
});
return this.inputEdges.filter((e) => toBeRemoved.indexOf(e) === -1);
}
}
export class Graph {
nodes: any = {};
constructor() {}
createNode(name: string): Node {
const n = new Node(name);
this.nodes[name] = n;
return n;
}
createNodes(names: string[]): Node[] {
const nodes: Node[] = [];
names.forEach((name) => {
nodes.push(this.createNode(name));
});
return nodes;
}
link(input: string | string[] | Node | Node[], output: string | string[] | Node | Node[]): Edge[] {
let inputArr = [];
let outputArr = [];
const inputNodes: Node[] = [];
const outputNodes: Node[] = [];
if (input instanceof Array) {
inputArr = input;
} else {
inputArr = [input];
}
if (output instanceof Array) {
outputArr = output;
} else {
outputArr = [output];
}
for (let n = 0; n < inputArr.length; n++) {
const i = inputArr[n];
if (typeof i === 'string') {
const n = this.getNode(i);
if (!n) {
throw Error(`cannot link input node named ${i} since it doesn't exist in graph`);
}
inputNodes.push(n);
} else {
inputNodes.push(i);
}
}
for (let n = 0; n < outputArr.length; n++) {
const i = outputArr[n];
if (typeof i === 'string') {
const n = this.getNode(i);
if (!n) {
throw Error(`cannot link output node named ${i} since it doesn't exist in graph`);
}
outputNodes.push(n);
} else {
outputNodes.push(i);
}
}
const edges: Edge[] = [];
inputNodes.forEach((input) => {
outputNodes.forEach((output) => {
edges.push(this.createEdge().link(input, output));
});
});
return edges;
}
createEdge(): Edge {
return new Edge();
}
getNode(name: string): Node {
return this.nodes[name];
}
}
export const printGraph = (g: Graph) => {
Object.keys(g.nodes).forEach((name) => {
const n = g.nodes[name];
let outputEdges = n.outputEdges.map((e: Edge) => e.outputNode?.name).join(', ');
if (!outputEdges) {
outputEdges = '<none>';
}
let inputEdges = n.inputEdges.map((e: Edge) => e.inputNode?.name).join(', ');
if (!inputEdges) {
inputEdges = '<none>';
}
console.log(`${n.name}:\n - links to: ${outputEdges}\n - links from: ${inputEdges}`);
});
};