->

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

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

 

Byte-Sized-Chunks: Graph Algorithms and Problems in Java
Byte-Sized-Chunks Graph Algorithms and Problems in Java.part1.rar
Byte-Sized-Chunks Graph Algorithms and Problems in Java.part2.rar
Byte-Sized-Chunks Graph Algorithms and Problems in Java.part3.rar
Byte-Sized-Chunks Graph Algorithms and Problems in Java.part4.rar
Byte-Sized-Chunks Graph Algorithms and Problems in Java.part5.rar
Byte-Sized-Chunks Graph Algorithms and Problems in Java.part6.rar
Byte-Sized-Chunks Graph Algorithms and Problems in Java.part7.rar


 TO MAC USERS: If RAR password doesn't work, use this archive program: 

RAR Expander 0.8.5 Beta 4  and extract password protected files without error.


 TO WIN USERS: If RAR password doesn't work, use this archive program: 

Latest Winrar  and extract password protected files without error.


 nagy   |  

Information
Members of Guests cannot leave comments.




rss