Left Edge and Dogleg Algorithm for channel routing

[@robinswoboda2993]

Very good video! Greetings from Italy.

[@MdMaksudUlKabirRico]

A very well explained video for this topic. I learned a lot from you. Thank you, sir, you are great. Please, upload more videos.

[@johnreuben6930]

Maximal clique is the min number f tracks required. For more details refer to sadiq saint and youseff book on physical design automation

[@RSK187]

thank you sir. Sir, can you also post a video about switchbox greedy algorithm

[@twotyreexplorer2412]

Well explained thank you

[@liuliuwuwu864]

Thank you sir!

[@danielparabent5067]

Thanks bro

[@chetanar4272]

Sir, please check with A to C in graph

[@shreyaovalekar6764]

Thank you

[@manugs894]

Sir i need c program to perform the left edge algorithm

[@sridharnarayana3557]

thank you sir

[@diyajoseph8619]

I think you are wrong about the Left edge algo. You have to iterate through the whole order before starting from the left again, according to the algorithm provided in these slides.

[@you98765]

Yes

[@Gb-se7ei]

Nice

[@marioadel4045]

Can I have the slides Please ?

[@xAmiSarahx]

good evening...

[@prabinmanandhar]

thank you sir

[@goutamkundu6392]

Thank you sir