When plotting the results from the BruteForce search algorithm, only one solution is reported.
for example, when plotting the Bruteforce Results of Borgatti's figure 8 for a kp-set of size 3 using an mreach of 1, this is the resulting plot https://i.imgur.com/0SjXMDY.png
however, the solutions are both {KR', 'BM', 'NP'} and {'BS3', 'BM', 'NP'} as reported by Pyntacle (in bold):
Reading #input file...
Adjacency Matrix from figure_8.adjm imported
Using Brute Force for searching optimal KP-Set
Finding best set of kp-nodes of size 3 using an MREACH measure of 1 (kp pos measure)
Brute-force search of the best kpp-set of size 3
The best kpp-sets for metric mreach of size 3 are [['KR', 'BM', 'NP'], ['BS3', 'BM', 'NP']] with score 20
Elapsed Time: 0.79 sec
Search for the best kp set completed!
kp sets of size 3 with a reach of 1 for Key Player Metric mreach are [['KR', 'BM', 'NP'], ['BS3', 'BM', 'NP']] with value 20 (reaching the 71.88% of nodes)
Producing report in txt format.
Generating plots in png format.
2018-05-16 14:45:30,419 - WARNING - A directory named "pyntacle-plots" already exists, I may overwrite something in there
pyntacle Keyplayer completed successfully. Ending
Is it possible to enhance this feature and report all sets?
When plotting the results from the BruteForce search algorithm, only one solution is reported.
for example, when plotting the Bruteforce Results of Borgatti's figure 8 for a kp-set of size 3 using an mreach of 1, this is the resulting plot https://i.imgur.com/0SjXMDY.png
however, the solutions are both {KR', 'BM', 'NP'} and {'BS3', 'BM', 'NP'} as reported by Pyntacle (in bold):
Is it possible to enhance this feature and report all sets?