COO Sparse Matrix: [ 0 1 1 ] [ 0 6 1 ] [ 0 8 1 ] [ 1 0 1 ] [ 1 4 1 ] [ 1 6 1 ] [ 1 9 1 ] [ 2 4 1 ] [ 2 6 1 ] [ 3 4 1 ] [ 3 5 1 ] [ 3 8 1 ] [ 4 1 1 ] [ 4 2 1 ] [ 4 3 1 ] [ 4 5 1 ] [ 4 9 1 ] [ 5 3 1 ] [ 5 4 1 ] [ 6 0 1 ] [ 6 1 1 ] [ 6 2 1 ] [ 7 8 1 ] [ 7 9 1 ] [ 8 0 1 ] [ 8 3 1 ] [ 8 7 1 ] [ 9 1 1 ] [ 9 4 1 ] [ 9 7 1 ] The minimum degree node is: Node 2 with a degree of 2 # Partitions: 4 # Nodes in Each Partition: Partition 0: 3 Partition 1: 3 Partition 2: 2 Partition 3: 2 Partitions: Partition 0: [ 0 1 1 ] [ 0 6 1 ] [ 0 8 1 ] [ 1 0 1 ] [ 1 4 1 ] [ 1 6 1 ] [ 1 9 1 ] [ 2 4 1 ] [ 2 6 1 ] Partition 1: [ 3 4 1 ] [ 3 5 1 ] [ 3 8 1 ] [ 4 1 1 ] [ 4 2 1 ] [ 4 3 1 ] [ 4 5 1 ] [ 4 9 1 ] [ 5 3 1 ] [ 5 4 1 ] Partition 2: [ 6 0 1 ] [ 6 1 1 ] [ 6 2 1 ] [ 7 8 1 ] [ 7 9 1 ] Partition 3: [ 8 0 1 ] [ 8 3 1 ] [ 8 7 1 ] [ 9 1 1 ] [ 9 4 1 ] [ 9 7 1 ] Iteration 1 ----------------------------------------------- Print Status: Degree: [ 3 4 2 3 5 2 3 2 3 3 ] Node Partition: [ 0 0 0 1 1 1 2 2 3 3 ] Active Nodes: [ 0 0 1 0 0 0 0 0 0 0 ] Active Partitions: [ 1 0 0 0 ] Current Priority: [ 0 0 1 0 0 0 0 0 0 0 ] Future Priority: [ 0 0 0 0 0 0 0 0 0 0 ] Visited: [ 0 0 0 0 0 0 0 0 0 0 ] Permutation: [ ] ----------------------------------------------- Active Nodes: [ Node: 2 Degree: 2 ] Scatter thread #1 created for Partition 0 Scatter threads joined Bin arrays (degree, node) are: Partition 0: [ 2 0 ] Partition 1: [ 4 1 ] Partition 2: [ 6 1 ] Partition 3: Gather thread #1 created for Partition 0 Gather thread #2 created for Partition 1 Gather thread #3 created for Partition 2 Gather threads joined addPriority (priority, degree, node): [ 1 2 2 ] addPriority AFTER SORTING: [ 1 2 2 ] addIntermediate array (degree, node): [ 2 2 ] addIntermediate array AFTER SORTING: [ 2 2 ] Iteration 2 ----------------------------------------------- Print Status: Degree: [ 3 4 2 3 5 2 3 2 3 3 ] Node Partition: [ 0 0 0 1 1 1 2 2 3 3 ] Active Nodes: [ 0 0 0 0 1 0 1 0 0 0 ] Active Partitions: [ 0 1 1 0 ] Current Priority: [ 0 0 0 0 1 0 1 0 0 0 ] Future Priority: [ 0 0 0 0 0 0 0 0 0 0 ] Visited: [ 0 0 1 0 0 0 0 0 0 0 ] Permutation: [ 2 ] ----------------------------------------------- Active Nodes: [ Node: 6 Degree: 3 ] [ Node: 4 Degree: 5 ] Scatter thread #1 created for Partition 1 Scatter thread #2 created for Partition 2 Scatter threads joined Bin arrays (degree, node) are: Partition 0: [ 1 1 ] [ 0 1 ] [ 1 1 ] Partition 1: [ 4 0 ] [ 3 1 ] [ 5 1 ] Partition 2: [ 6 0 ] Partition 3: [ 9 1 ] Gather thread #1 created for Partition 0 Gather thread #2 created for Partition 1 Gather thread #3 created for Partition 2 Gather thread #4 created for Partition 3 Gather threads joined addPriority (priority, degree, node): [ 1 5 4 ] [ 1 3 6 ] addPriority AFTER SORTING: [ 1 5 4 ] [ 1 3 6 ] addIntermediate array (degree, node): [ 5 4 ] [ 3 6 ] addIntermediate array AFTER SORTING: [ 3 6 ] [ 5 4 ] Iteration 3 ----------------------------------------------- Print Status: Degree: [ 3 4 2 3 5 2 3 2 3 3 ] Node Partition: [ 0 0 0 1 1 1 2 2 3 3 ] Active Nodes: [ 1 1 0 1 0 1 0 0 0 1 ] Active Partitions: [ 1 1 0 1 ] Current Priority: [ 2 2 0 1 0 1 0 0 0 1 ] Future Priority: [ 0 0 0 0 0 0 0 0 0 0 ] Visited: [ 0 0 1 0 1 0 1 0 0 0 ] Permutation: [ 2 6 4 ] ----------------------------------------------- Active Nodes: [ Node: 5 Degree: 2 ] [ Node: 0 Degree: 3 ] [ Node: 3 Degree: 3 ] [ Node: 9 Degree: 3 ] [ Node: 1 Degree: 4 ] Scatter thread #1 created for Partition 0 Scatter thread #2 created for Partition 1 Scatter thread #3 created for Partition 3 Scatter threads joined Bin arrays (degree, node) are: Partition 0: [ 0 0 ] [ 1 0 ] Partition 1: [ 3 0 ] [ 5 0 ] Partition 2: [ 7 1 ] Partition 3: [ 8 1 ] [ 8 1 ] [ 9 0 ] Gather thread #1 created for Partition 0 Gather thread #2 created for Partition 1 Gather thread #3 created for Partition 2 Gather thread #4 created for Partition 3 Gather threads joined addPriority (priority, degree, node): [ 2 3 0 ] [ 2 4 1 ] [ 1 3 3 ] [ 1 2 5 ] [ 1 3 9 ] addPriority AFTER SORTING: [ 2 3 0 ] [ 2 4 1 ] [ 1 3 3 ] [ 1 2 5 ] [ 1 3 9 ] addIntermediate array (degree, node): [ 3 0 ] [ 4 1 ] addIntermediate array AFTER SORTING: [ 3 0 ] [ 4 1 ] addIntermediate array (degree, node): [ 3 3 ] [ 2 5 ] [ 3 9 ] addIntermediate array AFTER SORTING: [ 2 5 ] [ 3 3 ] [ 3 9 ] Iteration 4 ----------------------------------------------- Print Status: Degree: [ 3 4 2 3 5 2 3 2 3 3 ] Node Partition: [ 0 0 0 1 1 1 2 2 3 3 ] Active Nodes: [ 0 0 0 0 0 0 0 1 1 0 ] Active Partitions: [ 0 0 1 1 ] Current Priority: [ 0 0 0 0 0 0 0 2 4 0 ] Future Priority: [ 0 0 0 0 0 0 0 0 0 0 ] Visited: [ 1 1 1 1 1 1 1 0 0 1 ] Permutation: [ 2 6 4 0 1 5 3 9 ] ----------------------------------------------- Active Nodes: [ Node: 7 Degree: 2 ] [ Node: 8 Degree: 3 ] Scatter thread #1 created for Partition 2 Scatter thread #2 created for Partition 3 Scatter threads joined Bin arrays (degree, node) are: Partition 0: Partition 1: Partition 2: [ 7 0 ] Partition 3: [ 8 0 ] Gather thread #1 created for Partition 2 Gather thread #2 created for Partition 3 Gather threads joined addPriority (priority, degree, node): [ 2 2 7 ] [ 4 3 8 ] addPriority AFTER SORTING: [ 4 3 8 ] [ 2 2 7 ] addIntermediate array (degree, node): [ 3 8 ] addIntermediate array AFTER SORTING: [ 3 8 ] addIntermediate array (degree, node): [ 2 7 ] addIntermediate array AFTER SORTING: [ 2 7 ] ----------------------------------------------- Print Status: Degree: [ 3 4 2 3 5 2 3 2 3 3 ] Node Partition: [ 0 0 0 1 1 1 2 2 3 3 ] Active Nodes: [ 0 0 0 0 0 0 0 0 0 0 ] Active Partitions: [ 0 0 0 0 ] Current Priority: [ 0 0 0 0 0 0 0 0 0 0 ] Future Priority: [ 0 0 0 0 0 0 0 0 0 0 ] Visited: [ 1 1 1 1 1 1 1 1 1 1 ] Permutation: [ 2 6 4 0 1 5 3 9 8 7 ] ----------------------------------------------- C:\Users\jeff5\source\repos\rcm_parallel\Debug\rcm_parallel.exe (process 26056) exited with code 0. To automatically close the console when debugging stops, enable Tools->Options->Debugging->Automatically close the console when debugging stops. Press any key to close this window . . .