extern/zrok
1
1
Fork 0
mirror of https://github.com/openziti/zrok.git synced 2025-06-24 19:51:32 +02:00
Code Issues Packages Projects Releases Wiki Activity

evolving the graph manipulation (#107)

Browse Source
This commit is contained in:
Michael Quigley 2022-12-21 15:52:09 -05:00
parent 0377214761
commit fb431ac870
No known key found for this signature in database
GPG Key ID: 9B60314A9DD20A62
1 changed files with 18 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
ui/src/console/visualizer/graph.js
View File

@ -1,3 +1,13 @@
const compareArrays = (a, b) => {
if(a.length !== b.length) return false;
return a.every((e, i) => e === b[i]);
}
const compareLinks = (a, b) => {
if(a.length !== b.length) return false;
return a.every((e, i) => e.source === b[i].source && e.target === b[i].target);
}
export const mergeGraph = (oldGraph, newOverview) => { export const mergeGraph = (oldGraph, newOverview) => {
let newGraph = { let newGraph = {
nodes: [], nodes: [],
@ -30,11 +40,15 @@ export const mergeGraph = (oldGraph, newOverview) => {
} }
}); });
// we want to preserve nodes that exist in the new graph, and remove those that don't. // we want to preserve nodes that exist in the new graph, and remove those that don't.
oldGraph.nodes = oldGraph.nodes.filter(oldNode => newGraph.nodes.find(newNode => newNode.id === oldNode.id)); let outputNodes = oldGraph.nodes.filter(oldNode => newGraph.nodes.find(newNode => newNode.id === oldNode.id));
let outputLinks = oldGraph.nodes.filter(oldLink => newGraph.links.find(newLink => newLink.target === oldLink.target && newLink.source === oldLink.source));
// and then do the opposite; add any nodes that are in newGraph that are missing from oldGraph. // and then do the opposite; add any nodes that are in newGraph that are missing from oldGraph.
oldGraph.nodes.push(...newGraph.nodes.filter(newNode => !oldGraph.nodes.find(oldNode => oldNode.id === newNode.id))); outputNodes.push(...newGraph.nodes.filter(newNode => !outputNodes.find(oldNode => oldNode.id === newNode.id)));
outputLinks.push(...newGraph.links.filter(newLink => !outputLinks.find(oldLink => oldLink.target === newLink.target && oldLink.source === newLink.source)));
outputNodes = outputNodes.sort();
outputLinks = outputLinks.sort();
return { return {
nodes: oldGraph.nodes, nodes: outputNodes,
links: newGraph.links, links: outputLinks
}; };
}; };