Open mortbopet opened 5 years ago
Given that the routing will be based on a connectivity graph, a route result data structure could be a list of connected connectivity graph nodes, plus a notion of where a pin physically resides within a connectivity graph node (which will be a Channel node)
An obvious data structure would be to contain the place & route result in a matrix, with items within the matrix being pointers to either ComponentGraphics or Ports (which are associated with wires). However, such a data structure does not scale well.