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
|
// A display projection of a snapshot. Original nodes and edge slots stay intact.
class GraphGroups {
static view(snap, folded) {
const raw = new Map(snap.nodes.map(n => [n.id, n]));
const groups = new Map((snap.groups || []).map(g => [g.id, {...g, members: new Set(g.nodes)}]));
const home = new Map(), cover = new Map();
for (const g of groups.values()) for (const id of g.nodes) home.set(id, g.id);
for (const g of groups.values()) {
for (let p = groups.get(g.par); p; p = groups.get(p.par))
for (const id of g.nodes) p.members.add(id);
}
for (const n of snap.nodes) {
let id = n.id;
for (let g = groups.get(home.get(id)); g; g = groups.get(g.par))
if (folded.has(g.id)) id = g.id;
cover.set(n.id, id);
}
const nodes = [], byId = new Map();
for (const n of snap.nodes) {
if (cover.get(n.id) !== n.id) continue;
const fold = groups.has(n.id) && folded.has(n.id);
const v = {...n, edges: [], fold: fold ? groups.get(n.id) : null};
if (fold) {
v.proj = null;
v.type = `${v.fold.members.size} nodes folded`;
}
nodes.push(v); byId.set(n.id, v);
}
for (const n of snap.nodes) for (const e of n.edges) {
const use = byId.get(cover.get(n.id)), def = cover.get(e.def) || 0;
if (use.fold && (!def || def === use.id)) continue;
use.edges.push({...e, idx: use.fold ? use.edges.length : e.idx, def,
orig: {use: n.id, def: e.def, idx: e.idx}});
}
// Expanded groups only; a folded group is represented by its header box.
const open = [...groups.values()].filter(g => !folded.has(g.id) && cover.get(g.id) === g.id);
const depth = g => {
let n = 0;
for (; g.par; g = groups.get(g.par)) n++;
return n;
};
// Paint outer containers before inner ones, even after headers are cloned.
open.sort((a,b) => depth(a) - depth(b) || a.id - b.id);
return {snap: {...snap, nodes}, raw, home, cover, open, groups};
}
}
|
