mirror of
https://github.com/infiniflow/ragflow.git
synced 2025-12-25 08:06:48 +08:00
### What problem does this PR solve? feat: Add ForceGraph feat: Classify nodes based on edge relationships #162 ### Type of change - [x] New Feature (non-breaking change which adds functionality)
56 lines
1.5 KiB
TypeScript
56 lines
1.5 KiB
TypeScript
class KeyGenerator {
|
|
idx = 0;
|
|
chars: string[] = [];
|
|
constructor() {
|
|
const chars = Array(26)
|
|
.fill(1)
|
|
.map((x, idx) => String.fromCharCode(97 + idx)); // 26 char
|
|
this.chars = chars;
|
|
}
|
|
generateKey() {
|
|
const key = this.chars[this.idx];
|
|
this.idx++;
|
|
return key;
|
|
}
|
|
}
|
|
|
|
// Classify nodes based on edge relationships
|
|
export class Converter {
|
|
keyGenerator;
|
|
dict: Record<string, string> = {}; // key is node id, value is combo
|
|
constructor() {
|
|
this.keyGenerator = new KeyGenerator();
|
|
}
|
|
buildDict(edges: { source: string; target: string }[]) {
|
|
edges.forEach((x) => {
|
|
if (this.dict[x.source] && !this.dict[x.target]) {
|
|
this.dict[x.target] = this.dict[x.source];
|
|
} else if (!this.dict[x.source] && this.dict[x.target]) {
|
|
this.dict[x.source] = this.dict[x.target];
|
|
} else if (!this.dict[x.source] && !this.dict[x.target]) {
|
|
this.dict[x.source] = this.dict[x.target] =
|
|
this.keyGenerator.generateKey();
|
|
}
|
|
});
|
|
return this.dict;
|
|
}
|
|
buildNodesAndCombos(nodes: any[], edges: any[]) {
|
|
this.buildDict(edges);
|
|
const nextNodes = nodes.map((x) => ({ ...x, combo: this.dict[x.id] }));
|
|
|
|
const combos = Object.values(this.dict).reduce<any[]>((pre, cur) => {
|
|
if (pre.every((x) => x.id !== cur)) {
|
|
pre.push({
|
|
id: cur,
|
|
data: {
|
|
label: `Combo ${cur}`,
|
|
},
|
|
});
|
|
}
|
|
return pre;
|
|
}, []);
|
|
|
|
return { nodes: nextNodes, combos };
|
|
}
|
|
}
|