Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi. For more details on NPTEL visit http://nptel.iitm.ac.in
@AJSwisgirl Definitely not Phd level. It is normal implementation stuff concerning graphs. This was done on BSc level on my faculty. (including complexity analisys)
Thanksss Dr.naveen
U r good teacher
I study information system and yourr video is useful
Thanks alooot
»»»LOLO from saudi
LoLo2011111 2 months ago
unable to view this video!!!
manab68 3 months ago
@AJSwisgirl Definitely not Phd level. It is normal implementation stuff concerning graphs. This was done on BSc level on my faculty. (including complexity analisys)
xzminx 7 months ago
ICANNOT EVEN SEE THIS THINGS IN THE BOOKS ??? What is he talking about? This is very advance graph, as phd student level.
AJSwisgirl 9 months ago
@hskprg Just know the concept man and try to implement it urself.....even I didnt bother to look at it...i just wanted the concept.
vipinanandcpp 9 months ago
oh my head hurts... ;u;
Johannady 1 year ago
Only watched 20 minutes but have to say that all these methods are actually worse than the initial diagram!
chrisofnottingham 1 year ago
If its so easy send me a copy of prims algorithm undirected graphof adjacent matrix. i'll be waiting contact me at com520 youtube accounts.
com520 2 years ago
This comment has received too many negative votes show
aww easy material i learned this in 5th grade
xdwere1 2 years ago
No matter everything is good but how can i view that BFS algorithm. Its impossible many times to read text. Please link some pdf etc. on your site
hskprg 3 years ago