We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6bc58a1 commit 337a46cCopy full SHA for 337a46c
vpr/src/route/bucket.h
@@ -182,6 +182,16 @@ alloc_heap_data() {
182
// with items is returned. This randomization exists to prevent the router
183
// from following identical paths when operating with identical costs.
184
// Consider two parallel paths to a node.
185
+//
186
+// Important node: This approximation makes some assumptions about the
187
+// structure of costs.
188
189
+// Assumptions:
190
+// 1. 0 is the minimum cost
191
+// 2. Costs that are different by 0.1 % of the maximum cost are effectively
192
+// equivilant
193
+// 3. The cost function is roughly linear.
194
195
class Bucket {
196
public:
197
Bucket() {}
0 commit comments