vpr/src/route/router_lookahead_map.cpp
/* returns cost entry with the smallest delay */
returns cost entry with the smallest delay
returns cost entry with the smallest delay
Cost_Entry Expansion_Cost_Entry::get_smallest_entry() {
    Cost_Entry smallest_entry;
    for (auto entry : this->cost_vector) {
        if (smallest_entry.delay < 0 || entry.delay < smallest_entry.delay) {
            smallest_entry = entry;
        }
    }
    return smallest_entry;
}
Cost_Entry Expansion_Cost_Entry :: get_smallest_entry ( ) { Cost_Entry smallest_entry ; for ( auto entry : this -> cost_vector ) { if ( smallest_entry . delay < 0 || entry . delay < smallest_entry . delay ) { smallest_entry = entry ; } } return smallest_entry ; }
returns cost entry with the smallest delay
returns cost entry with the smallest delay