HW10 - Optional Exercise #10 1. Given the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Optional Exercise #10 1. Given the following graph and edge cost, execute Prim’s algorithm to obtain the minimum spanning tree. 2. What are the advantages of using Path ­Finder for FPGA routing? Disadvantages? 3. What are the advantages of using Min ­Cost Max Flow for FPGA routing? Disadvantages? 4. Any way to combine PF and MCMF algorithms? Answers: 1. ...
View Full Document

Ask a homework question - tutors are online