# data[].attributes.body
Using Hungarian Algorithm, showing all steps

# data[].attributes.attachment_link.title
Solve the assignment problem online - HungarianAlgorithm.com

# data[].attributes.attachment_link.description
Fill in the cost matrix of an assignment problem and get the steps of the Hungarian algorithm and the optimal assignment

# data[].attributes.body
By Mark Judd

# data[].attributes.attachment_link.description
A basic introduction to forward and backward scanning of networks, critical path and float times. Suitable as an introductory to VCE Further Maths

# data[].attributes.body
Forward/backward scanning, & crashing

# data[].attributes.attachment_link.description
Two examples looking at critical paths, forward and backward scanning and crashing.

# data[].attributes.body
by VCE Further Maths (NOTE: a few errors in second example, but the method is good)

# data[].attributes.attachment_link.description
Some examples and past VCAA questions relating to maximum flow using the miminum cut method

# data[].attributes.body
Alternative approach - the zero path method, plus a past exam question involving two sources and two sinks

# data[].attributes.attachment_link.entities[].name
Algorithm Single Source Shortest Path Graph Algorithm

# data[].attributes.attachment_link.description
Alternative method to minimum cut which takes the 'trial and error' element out of the picture

# data[].attributes.headline
Video: Minimum spanning tree - Prim' Algorithm

# data[].attributes.subject
Video: Minimum spanning tree - Prim' Algorithm

# data[].attributes.attachment_link.description
An example of how to apply Prim's Algorithm to find the minimum spanning tree for a connected graph.

# data[].attributes.body
By Nathaniel Fan

# data[].attributes.attachment_link.description
Describes how Dijkstra's Algorithm works.

# data[].attributes.body
by Mathispower4u

# data[].attributes.attachment_link.description
This lesson explains how to apply Dijkstra's algorithm to find the shortest path from one vertex to another using a graph. Site: http://mathispower4u.com

# data[].attributes.body
(watch from time 1:10)

# data[].attributes.attachment_link.entities[].name
Algorithm Single Source Shortest Path Graph Algorithm

# data[].attributes.attachment_link.description
Uploaded by Mr Steve Dennis - STEM Learning on 2014-10-02.

# data[].attributes.attachment_link.description
(a) Find a Hamiltonian path that starts at A and ends at G. (b) Find a Hamiltonian circuit beginning at A.

# data[].attributes.body
By Nova PBS Official

# data[].attributes.attachment_link.description
Science shows it's a small world after all-and nature's networks follow a similar pattern. NOVA Facebook: https://www.facebook.com/NOVAonline NOVA Twitter: https://www.twitter.com/novapbs Follow Mark Zastrow on Twitter: @MarkZastrow PRODUCTION CREDITS Writer, Producer, and Narrator Mark Zastrow Music by Mark Zastrow Editorial Help from Anna Rothschild Original Footage © WGBH Educational Foundation 2014 MEDIA CREDITS Mississippi River watershed National Park Service Diffusion tensor images Human Connectome Project, NIH, Massachusetts General Hospital, Meredith Reid (University of Alabama--Birmingham) Neurons, In Vitro Color!

# data[].attributes.headline
Video: The Science of Six Degrees of Separation

# data[].attributes.subject
Video: The Science of Six Degrees of Separation

# data[].attributes.body
by Veritasium

# data[].attributes.attachment_link.title
The Science of Six Degrees of Separation