For Euler path and circuits, I think this presentation is very ‘meaty’, explained in lucid and short manner without extra loads of history of 7 bridges and how euler solved it!
thankyou so much guys for such help;it is really helpful for me as now i have a concise collection for what should i look upon.
keep up the good work community
Just a suggestion. Sort this list according to their usage. Like, the algorithms which are most used would be ranked first, then the rarely used problems.