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

MP4 | Video: AVC 1280x720 | Audio: AAC 44KHz 2ch | Duration: 5 Hours | 1.57 GB

Genre: eLearning | Language: English

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

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