gardel/lightrag
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix node size calculation bugs

Browse Source
This commit is contained in:
yangdx
2025-03-22 12:39:16 +08:00
parent 613c06c52b
commit ebd73a54b9
1 changed files with 6 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
lightrag_webui/src/hooks/useLightragGraph.tsx
View File

@@ -464,7 +464,7 @@ const useLightrangeGraph = () => {
const nodesToAdd = new Set<string>(); const nodesToAdd = new Set<string>();
const edgesToAdd = new Set<string>(); const edgesToAdd = new Set<string>();
// Get degree range from existing graph for size calculations // Get degree maxDegree from existing graph for size calculations
const minDegree = 1; const minDegree = 1;
let maxDegree = 0; let maxDegree = 0;
sigmaGraph.forEachNode(node => { sigmaGraph.forEachNode(node => {
@@ -472,10 +472,6 @@ const useLightrangeGraph = () => {
maxDegree = Math.max(maxDegree, degree); maxDegree = Math.max(maxDegree, degree);
}); });
// Calculate size formula parameters
const range = maxDegree - minDegree || 1; // Avoid division by zero
const scale = Constants.maxNodeSize - Constants.minNodeSize;
// First identify connectable nodes (nodes connected to the expanded node) // First identify connectable nodes (nodes connected to the expanded node)
for (const node of processedNodes) { for (const node of processedNodes) {
// Skip if node already exists // Skip if node already exists
@@ -512,7 +508,7 @@ const useLightrangeGraph = () => {
// Track degree increments for existing nodes // Track degree increments for existing nodes
existingNodeDegreeIncrements.set(edge.source, (existingNodeDegreeIncrements.get(edge.source) || 0) + 1); existingNodeDegreeIncrements.set(edge.source, (existingNodeDegreeIncrements.get(edge.source) || 0) + 1);
} }
if (nodesToAdd.has(edge.target)) { if (nodesToAdd.has(edge.target)) {
nodeDegrees.set(edge.target, (nodeDegrees.get(edge.target) || 0) + 1); nodeDegrees.set(edge.target, (nodeDegrees.get(edge.target) || 0) + 1);
} else if (existingNodeIds.has(edge.target)) { } else if (existingNodeIds.has(edge.target)) {
@@ -579,7 +575,7 @@ const useLightrangeGraph = () => {
for (const [, degree] of nodeDegrees.entries()) { for (const [, degree] of nodeDegrees.entries()) {
maxDegree = Math.max(maxDegree, degree); maxDegree = Math.max(maxDegree, degree);
} }
// 2. Consider degree increments for existing nodes // 2. Consider degree increments for existing nodes
for (const [nodeId, increment] of existingNodeDegreeIncrements.entries()) { for (const [nodeId, increment] of existingNodeDegreeIncrements.entries()) {
const currentDegree = sigmaGraph.degree(nodeId); const currentDegree = sigmaGraph.degree(nodeId);
@@ -587,6 +583,9 @@ const useLightrangeGraph = () => {
maxDegree = Math.max(maxDegree, projectedDegree); maxDegree = Math.max(maxDegree, projectedDegree);
} }
const range = maxDegree - minDegree || 1; // Avoid division by zero
const scale = Constants.maxNodeSize - Constants.minNodeSize;
// SAdd nodes and edges to the graph // SAdd nodes and edges to the graph
// Calculate camera ratio and spread factor once before the loop // Calculate camera ratio and spread factor once before the loop
const cameraRatio = useGraphStore.getState().sigmaInstance?.getCamera().ratio || 1; const cameraRatio = useGraphStore.getState().sigmaInstance?.getCamera().ratio || 1;