From 001aacd3c8dba5af0fd5ff57637f573daa420989 Mon Sep 17 00:00:00 2001
From: AndreaGuarracino <andreaguarracino@outlook.com>
Date: Tue, 4 Jul 2023 08:22:38 +0200
Subject: [PATCH] less cut nodes
---
src/algorithms/untangle.cpp | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/src/algorithms/untangle.cpp b/src/algorithms/untangle.cpp
index 8027c0ba..7e44f506 100644
--- a/src/algorithms/untangle.cpp
+++ b/src/algorithms/untangle.cpp
@@ -742,7 +742,7 @@ void untangle(
if (!graph.has_previous_step(step)) {
//std::cerr << "start.id = " << graph.get_id(graph.get_handle_of_step(step)) << std::endl;
- cut_nodes.set(graph.get_id(graph.get_handle_of_step(step)), true);
+ //cut_nodes.set(graph.get_id(graph.get_handle_of_step(step)), true);
graph.follow_edges(graph.get_handle_of_step(step), true, [&](const handle_t& h) {
//std::cerr << "start.idX = " << graph.get_id(h) << std::endl;
cut_nodes.set(graph.get_id(h), true);
@@ -751,7 +751,7 @@ void untangle(
if (!graph.has_next_step(step)) {
//std::cerr << "end.id = " << graph.get_id(graph.get_handle_of_step(step)) << std::endl;
- cut_nodes.set(graph.get_id(graph.get_handle_of_step(step)), true);
+ //cut_nodes.set(graph.get_id(graph.get_handle_of_step(step)), true);
graph.follow_edges(graph.get_handle_of_step(step), false, [&](const handle_t& h) {
//std::cerr << "end.idX = " << graph.get_id(h) << std::endl;
cut_nodes.set(graph.get_id(h), true);