Back to Browse

Multistage Graph |Backward Algorithm| dynamic programming| DAA | solved example |Short tricks

13.5K views
Feb 10, 2024
15:26

Multistage Graphs: Principal: In this method, Graph is divided into different stages that is stage-1 to stage-n and will have only one vertex for each. The main objective is to find shortest path between source and destination. There are two methods are used- -Backward algorithm -Forward algorithm Backward Algorithm: In this method calculation for shortest path from source to destination the information about previous stage is considered. To find backward cost by using- π‘π‘π‘œπ‘ π‘‘(𝑖,𝑗) = min{ π‘π‘π‘œπ‘ π‘‘(𝑖 βˆ’ 1, 𝐿 ) + π‘π‘œπ‘ π‘‘(𝐿,𝑗)} Where, 𝑖 βˆ’ π‘ π‘‘π‘Žπ‘”π‘’ π‘›π‘œ. 𝑗 βˆ’ π‘π‘œπ‘‘π‘’ /π‘‰π‘’π‘Ÿπ‘‘π‘’π‘₯ π‘›π‘œ. π‘π‘π‘œπ‘ π‘‘( ) βˆ’ π‘›π‘œπ‘‘π‘’ π‘π‘œπ‘ π‘‘ π‘π‘œπ‘ π‘‘( ) βˆ’ π‘π‘Žπ‘‘β„Ž 𝑐 play list optimal binary search tree part #2 πŸ”—https://youtu.be/_U0gYfx-G4s ⭐ ALGORITHM COURSE CONTENT ⭐ πŸ”— Introduction to Algorithms https://youtu.be/kvQhvXoDS6w?si=9xU2VZHNcD5bzlbC πŸ”— Definition of Algorithms https://youtu.be/-AmbJ34ZCb0?si=XQ1ENqQUn_ns21Rv πŸ”— Recurrence Relation https://youtu.be/ihJDhqZgoZ0?si=PDOgEI1llq2Vj2cL πŸ”— Master Method shortcut tricks https://www.youtube.com/live/XboyzJwaiw4?si=_Od1GhJlfCwV6gf4 πŸ”— BIOTONIC SORTING https://youtu.be/tWymSVeDg6g?si=4T-9VClrM0MN0JIx πŸ”— AMORTIZED ANALYSIS https://youtu.be/amd-oHXyeYE?si=f9jwm8AYkYwC8emN Design and analysis of algorithms DAA DDA by Ahmad Sir DAA BY CSE ACADEMY ahmad Sir #cseacademy #byahmadsir #daa #gatecse #engineering #polytechnic

Download

1 formats

Video Formats

360pmp437.9 MB

Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.

Multistage Graph |Backward Algorithm| dynamic programming| DAA | solved example |Short tricks | NatokHD