Summary: 19 instances, 17 unique

Text	Count
// TODO: replace these with the BinarySpacePartitionTree wrapper class	2
//TODO: need this???	1
//TODO: remove angles!	1
//TODO: can we have negative here?	1
//TODO extract the distance computation outside of this step to make the procedure faster	1
// TODO: Remove field as it is never used	1
//TODO: are conflicts possible?	1
//TODO: method incorrect since id doesn't check AdjacentToSourceOrTarget condition	1
//TODO: which one?	1
//TODO check if sorting can be removed to make it faster.	1
// TODO: what if there already is a timeout at this point? Need to test.	1
double r = 10;// ?TODO: change to bundlingSettings.EdgeSeparation;	1
///     TODO: Check all the places we use this and make sure we don't have O(n^2) complexity	2
//TODO: get rif od this call!	1
/// TODO: is there a better solution?	1
//TODO: still we can have two intersecting hubs for not adjacent nodes	1
//TODO: replace the cycle!	1