bestcourses is supported by learners. When you buy through links on our website, we may earn an affiliate commission. Learn more

Byte-Sized-Chunks: Graph Algorithms and Problems in Java

Djisktra, Prim, Kruskal, Bellman-Ford, the topological sort - all will make sense now!

4.55 / 5.0
2845 students5 hours 13 minutes

Created by Loony Corn, offered on Udemy

bestcourses score™

Student feedback

5.4/10

To make sure that we score courses properly, we pay a lot of attention to the reviews students leave on courses and how many students are taking a course in the first place. This course has a total of 2845 students which left 59 reviews at an average rating of 4.55, which is average.

Course length

9/10

We analyze course length to see if courses cover all important aspects of a topic, taking into account how long the course is compared to the category average. This course has a length of 5 hours 13 minutes, which is pretty short. This might not be a bad thing, but we've found that longer courses are often more detailed & comprehensive. The average course length for this entire category is 4 hours 58 minutes.

Overall score

5.8/10

This course currently has a bestcourses score of 5.8/10, which makes it an average course. Overall, there are probably better courses available for this topic on our platform.

Description

Note: This course is a subset of our much longer course 'From 0 to 1: Data Structures & Algorithms' so please don't sign up for both:-)

This is an animated, visual and spatial way to learn data structures and algorithms

  • Our brains process different types of information differently - evolutionarily we are wired to absorb information best when it is visual and spatial i.e. when we can close our eyes and see it
  • More than most other concepts, Data Structures and Algorithms are best learnt visually. These are incredibly easy to learn visually, very hard to understand most other ways
  • This course has been put together by a team with tons of everyday experience in thinking about these concepts and using them at work at Google, Microsoft and Flipkart

Taught by a Stanford-educated ex-Googler.

The graph is a data structure that is used to model a very large number of real world problems. It's also an programming interview favorite. The study of graphs and algorithms associated with graphs forms an entire field of study called graph theory.

  • Directed and undirected graphs
  • Adjacency matrices, lists and sets
  • Breadth and Depth-First traversal
  • Topological sort
  • Djikstra's algorithm
  • Bellman-Ford algorithm
  • Prim's algorithm
  • Kruskal's algorithm

What you will learn

  • Design and implement software using canonical graph algorithms - Djikstra, Prim, Kruskal, Bellman Ford and topological sort
  • Understand the use-cases for the common graph algorithm

Requirements

  • Basic knowledge of programming is assumed, preferably in Java
Udemy logo
Available on

Udemy

With almost 200,000 courses and close to 50 million students, Udemy is one of the most visited online learning platforms. Popular topics include software development, the digital economy, but also more traditional topics like cooking and music.

Frequently asked questions

  • Price: $94.99
  • Platform: Udemy
  • Language: English
  • 5 hours 13 minutes
Byte-Sized-Chunks: Graph Algorithms and Problems in Java thumbnail

bestcourses score: 5.8/10

There might be better courses available for this topic.