Add branching after degree of nodes
1 unresolved thread
1 unresolved thread
Merge request reports
Activity
Filter activity
70 70 clock_t begin = clock(); 71 71 72 72 // builds a vector of node ids with descending degree 73 std::vector<node_id> nodes; 73 std::vector<node_id> sorted_nodes; 74 74 for (node_id i = 1; i <= graph_.num_nodes(); ++i) { 75 nodes.push_back(i); 75 sorted_nodes.push_back(i); 76 76 } 77 std::sort(nodes.begin(), nodes.end(), [this](node_id a, node_id b) { 77 std::sort(sorted_nodes.begin(), sorted_nodes.end(), [this](node_id a, node_id b) { But we need a sorted list. Otherwise we would have to determine the max element of a list of not assigned nodes at every expansion step. Not sure if I understand what you mean
Edited by Patrick Hamann
mentioned in commit 0bcbe443