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

Improve node size calculation logic for node expansion to prevent oversized

Browse Source
This commit is contained in:
yangdx
2025-03-22 11:39:46 +08:00
parent 2fd38381c0
commit 133bc40735
1 changed files with 13 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -533,16 +533,21 @@ const useLightrangeGraph = () => {
sigmaGraph: DirectedGraph, sigmaGraph: DirectedGraph,
nodesWithDiscardedEdges: Set<string>, nodesWithDiscardedEdges: Set<string>,
minDegree: number, minDegree: number,
range: number, maxDegree: number
scale: number
) => { ) => {
// Calculate derived values inside the function
const range = maxDegree - minDegree || 1; // Avoid division by zero
const scale = Constants.maxNodeSize - Constants.minNodeSize;
for (const nodeId of nodesWithDiscardedEdges) { for (const nodeId of nodesWithDiscardedEdges) {
if (sigmaGraph.hasNode(nodeId)) { if (sigmaGraph.hasNode(nodeId)) {
let newDegree = sigmaGraph.degree(nodeId); let newDegree = sigmaGraph.degree(nodeId);
newDegree += 1; // Add +1 for discarded edges newDegree += 1; // Add +1 for discarded edges
// Limit newDegree to maxDegree + 1 to prevent nodes from being too large
const limitedDegree = Math.min(newDegree, maxDegree + 1);
const newSize = Math.round( const newSize = Math.round(
Constants.minNodeSize + scale * Math.pow((newDegree - minDegree) / range, 0.5) Constants.minNodeSize + scale * Math.pow((limitedDegree - minDegree) / range, 0.5)
); );
const currentSize = sigmaGraph.getNodeAttribute(nodeId, 'size'); const currentSize = sigmaGraph.getNodeAttribute(nodeId, 'size');
@@ -556,7 +561,7 @@ const useLightrangeGraph = () => {
// If no new connectable nodes found, show toast and return // If no new connectable nodes found, show toast and return
if (nodesToAdd.size === 0) { if (nodesToAdd.size === 0) {
updateNodeSizes(sigmaGraph, nodesWithDiscardedEdges, minDegree, range, scale); updateNodeSizes(sigmaGraph, nodesWithDiscardedEdges, minDegree, maxDegree);
toast.info(t('graphPanel.propertiesView.node.noNewNodes')); toast.info(t('graphPanel.propertiesView.node.noNewNodes'));
return; return;
} }
@@ -585,8 +590,10 @@ const useLightrangeGraph = () => {
const nodeDegree = nodeDegrees.get(nodeId) || 0; const nodeDegree = nodeDegrees.get(nodeId) || 0;
// Calculate node size // Calculate node size
// Limit nodeDegree to maxDegree + 1 to prevent new nodes from being too large
const limitedDegree = Math.min(nodeDegree, maxDegree + 1);
const nodeSize = Math.round( const nodeSize = Math.round(
Constants.minNodeSize + scale * Math.pow((nodeDegree - minDegree) / range, 0.5) Constants.minNodeSize + scale * Math.pow((limitedDegree - minDegree) / range, 0.5)
); );
// Calculate angle for polar coordinates // Calculate angle for polar coordinates
@@ -661,7 +668,7 @@ const useLightrangeGraph = () => {
useGraphStore.getState().resetSearchEngine(); useGraphStore.getState().resetSearchEngine();
// Update sizes for all nodes with discarded edges // Update sizes for all nodes with discarded edges
updateNodeSizes(sigmaGraph, nodesWithDiscardedEdges, minDegree, range, scale); updateNodeSizes(sigmaGraph, nodesWithDiscardedEdges, minDegree, maxDegree);
} catch (error) { } catch (error) {
console.error('Error expanding node:', error); console.error('Error expanding node:', error);