Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
This section of the specialization focuses on the shortest paths (Bellman Ford, Floyd-Warshall and Johnson), NP-completeness (and what it means to the algorithm designer) and strategies for coping computationally difficult problems (analysis and heuristics and local search).
Course Popularity
CV Take
Parameters
Pedagogy
Top 30 Percentile
Rating & Reviews
Top 30 Percentile
View Detailed CVT Parameters
Course Highlights
Course Feature
Level
Intermediate
Duration
14 hours
Available on
Limited Access
Delivery Method
Online
Teaching Type
Self Paced
Skills You will Gain
Roles & Skills Fitment
The course is suited for the learning needs of the following job roles:
Course Peer Set
The following are the courses that fulfill similar learning needs:
Review Summary
Average Rating Based on 4 reviews
100%