Byte-Sized-Chunks Graph Algorithms and Problems in Java

Byte-Sized-Chunks Graph Algorithms and Problems in Java

Details:

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


PS : If You got an error while extracting while others are working try diferent directory path in your PC. Somtimes if you got a long directory path while extracting it will giv you an error. To solve this issue , as an example just paste the tgz file in C drive and extract (just inside the C drive not with in any other folder). Hope your Understand

Update Torrent Stats to see Current Seeders and Leechers

Visit my account to download more apps and ebooks + magazines

If This Torrent Helpful Please Support the Authors by Purchasing It!.. Thanx