Converter from rr_nodes to RRGraph object#1048

Open

tangxifan wants to merge 59 commits intoverilog-to-routing:masterfrom

tangxifan:rr_graph_refactoring

Commits on Nov 20, 2019

Commits on Nov 22, 2019

change num_non_config in/out edges to short integer, for sake of memory footprint
tangxifan
committed
use NdMatrix in fast node lookup in RRGraph object
tangxifan
committed
replace full vector of edge ids which simple edge range
tangxifan
committed
replace node id vector with constant and minor bug fixing
tangxifan
committed
further remove using nodes() and edges() inside RRGraph methods to save memory footprint
tangxifan
committed
move convert rr_graph to be close to build_rr_graph
tangxifan
committed
move clear RRGraph object to free_rr_graph()
tangxifan
committed
now node_in/out_edges are arranged in the same vector with delimeters to identify groups
tangxifan
committed
minor code format fix
tangxifan
committed
vpr: Rename RRGraph node/edge_id_range_ to num_nodes_/num_egdes_
kmurray
committed
vpr: Prefer using valid_node_id()/valid_edge_id() in RRGraph
kmurray
committed
vpr: Use std::unordered_set for tracking invalied IDs in RRGraph
kmurray
committed
vpr: Use lazy iterators to iterate through RRGraph nodes/edges
kmurray
committed
vpr: Refactor lazy RRGraph node/edge iterators into a common template class
kmurray
committed
vpr: Use forward declaration to move lazy_id_iterator implementation
kmurray
committed
vpr: Reduce RRGraph memory usage by merging node edge arrays
kmurray
committed
vpr: Remove RRGraph::node_num_*edge() data members.
kmurray
committed

Commits on Nov 26, 2019