Filter according to arc length, not weight different (more logic physical filtering)

2 files changed, 8 insertions, 2 deletions

diff --git a/source/blender/blenlib/BLI_graph.h b/source/blender/blenlib/BLI_graph.h
index 44131fbbff8..a814b6f8c96 100644
--- a/source/blender/blenlib/BLI_graph.h
+++ b/source/blender/blenlib/BLI_graph.h
@@ -66,6 +66,7 @@ typedef struct RadialArc
 BNode *BLI_otherNode(BArc *arc, BNode *node);
 
 void BLI_freeNode(BGraph *graph, BNode *node);
+void BLI_removeNode(BGraph *graph, BNode *node);
 
 void BLI_flagNodes(BGraph *graph, int flag);
 void BLI_flagArcs(BGraph *graph, int flag);
diff --git a/source/blender/blenlib/intern/graph.c b/source/blender/blenlib/intern/graph.c
index 8c7e8ce8cd6..1371e59a77a 100644
--- a/source/blender/blenlib/intern/graph.c
+++ b/source/blender/blenlib/intern/graph.c
@@ -53,6 +53,12 @@ void BLI_freeNode(BGraph *graph, BNode *node)
 	}
 }
 
+void BLI_removeNode(BGraph *graph, BNode *node)
+{
+	BLI_freeNode(graph, node);
+	BLI_freelinkN(&graph->nodes, node);
+}
+
 BNode *BLI_otherNode(BArc *arc, BNode *node)
 {
 	return (arc->head == node) ? arc->tail : arc->head;
@@ -194,8 +200,7 @@ void BLI_removeDoubleNodes(BGraph *graph, float limit)
 			{
 				BLI_replaceNode(graph, node_src, node_replaced);
 				
-				BLI_freeNode(graph, node_replaced);
-				BLI_freelinkN(&graph->nodes, node_replaced);
+				BLI_removeNode(graph, node_replaced);
 			}
 		}
 	}