void MIN_SPAN_TREE_PADS::AddTreeToRatsnest( std::vector<RATSNEST_ITEM> &aRatsnestList ) { std::vector<D_PAD*> & padsBuffer = *m_PadsList; int netcode = padsBuffer[0]->GetNet(); // Note: to get edges in minimum spanning tree, // the index value 0 is not used: it is just // the entry point of the minimum spanning tree. // The first edge (i.e. rastnest) starts at index 1 for( int ii = 1; ii < m_Size; ii++ ) { // Create the new ratsnest RATSNEST_ITEM net; net.SetNet( netcode ); net.m_Status = CH_ACTIF | CH_VISIBLE; net.m_Lenght = GetDist(ii); net.m_PadStart = padsBuffer[ii]; net.m_PadEnd = padsBuffer[ GetWhoTo(ii) ]; aRatsnestList.push_back( net ); } }