[CourseClub.NET] Coursera - Algorithms on Graphs

Torrent Hash:
656CD7D02FE651F46A14BEE2590D2454171A250D
Number of Files:
253
Content Size:
828.63MB
Convert On:
2019-07-12
Magnet Link:
W3siaWQiOiJhZHN0X2JfTV8zMDB4NTAiLCJhZHNwb3QiOiJiX01fMzAweDUwIiwid2VpZ2h0IjoiNSIsImZjYXAiOmZhbHNlLCJzY2hlZHVsZSI6ZmFsc2UsIm1heFdpZHRoIjoiNzY4IiwibWluV2lkdGgiOmZhbHNlLCJ0aW1lem9uZSI6ZmFsc2UsImV4Y2x1ZGUiOmZhbHNlLCJkb21haW4iOmZhbHNlLCJjb2RlIjoiPHNjcmlwdCB0eXBlPVwidGV4dFwvamF2YXNjcmlwdFwiPlxyXG4gIGF0T3B0aW9ucyA9IHtcclxuICAgICdrZXknIDogJzdkMWNjMGUxYjk4MWM5NzY4ZGI3ODUxZmM1MzVhMTllJyxcclxuICAgICdmb3JtYXQnIDogJ2lmcmFtZScsXHJcbiAgICAnaGVpZ2h0JyA6IDUwLFxyXG4gICAgJ3dpZHRoJyA6IDMyMCxcclxuICAgICdwYXJhbXMnIDoge31cclxuICB9O1xyXG4gIGRvY3VtZW50LndyaXRlKCc8c2NyJyArICdpcHQgdHlwZT1cInRleHRcL2phdmFzY3JpcHRcIiBzcmM9XCJodHRwJyArIChsb2NhdGlvbi5wcm90b2NvbCA9PT0gJ2h0dHBzOicgPyAncycgOiAnJykgKyAnOlwvXC93d3cuYm5odG1sLmNvbVwvaW52b2tlLmpzXCI+PFwvc2NyJyArICdpcHQ+Jyk7XHJcbjxcL3NjcmlwdD4ifV0=
File Name
Size
01_decomposition-of-graphs-1/01_welcome/01_welcome_instructions.html
3.96KB
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.en.srt
7.21KB
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.en.txt
4.6KB
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.mp4
8.55MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.zh-CN.srt
6.26KB
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.zh-CN.txt
3.65KB
01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.en.srt
15.08KB
01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.en.txt
9.55KB
01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.mp4
18.51MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
01_decomposition-of-graphs-1/02_graph-basics/03_slides-and-external-references_09_graph_decomposition_1_basics.pdf
2.73MB
01_decomposition-of-graphs-1/02_graph-basics/03_slides-and-external-references_09_graph_decomposition_2_representations.pdf
207.86KB
01_decomposition-of-graphs-1/02_graph-basics/03_slides-and-external-references_instructions.html
1.73KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.en.srt
23.08KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.en.txt
14.41KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.mp4
25.4MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.en.srt
9.14KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.en.txt
5.73KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.mp4
9.6MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.en.srt
11.96KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.en.txt
7.42KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.mp4
12.24MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_09_graph_decomposition_3_explore.pdf
565.6KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_09_graph_decomposition_4_connectivity.pdf
394.88KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_09_graph_decomposition_5_pre-and-post-orders.pdf
427.06KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_DFS.html
2.79KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_instructions.html
1.72KB
01_decomposition-of-graphs-1/04_programming-assignment/01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_problems_1.pdf
280.66KB
01_decomposition-of-graphs-1/04_programming-assignment/01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_starter_files_1.zip
280.92KB
01_decomposition-of-graphs-1/04_programming-assignment/01_programming-assignment-1-decomposition-of-graphs_instructions.html
1.72KB
02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.en.srt
12.26KB
02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.en.txt
7.68KB
02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.mp4
13.13MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.en.srt
13.9KB
02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.en.txt
8.64KB
02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.mp4
16.14MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.en.srt
12.04KB
02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.en.txt
7.5KB
02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.mp4
12.56MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.en.srt
16.24KB
02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.en.txt
10.06KB
02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.mp4
18.86MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_6_dags.pdf
234.23KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_7_topological-sort.pdf
657.84KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_8_strongly-connected-components.pdf
206.88KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_9_computing-sccs.pdf
650.49KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_ConnectedComponent.html
2.81KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_TopoSortDFS.html
2.8KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_TopoSortIndegree.html
2.82KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_instructions.html
2.31KB
02_decomposition-of-graphs-2/02_programming-assignment/01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_problems_2.pdf
478.59KB
02_decomposition-of-graphs-2/02_programming-assignment/01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_starter_files_2.zip
4.07KB
02_decomposition-of-graphs-2/02_programming-assignment/01_programming-assignment-2-decomposition-of-graphs_instructions.html
1.33KB
03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.en.srt
12.17KB
03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.en.txt
7.69KB
03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.mp4
17.8MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.en.srt
10.31KB
03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.en.txt
6.49KB
03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.mp4
16.37MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.en.srt
8.54KB
03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.en.txt
5.3KB
03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.mp4
12.82MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.en.srt
11.89KB
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.en.txt
7.52KB
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.mp4
21.55MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.ne.srt
11.89KB
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.ne.txt
7.52KB
03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.en.srt
9.15KB
03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.en.txt
5.6KB
03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.mp4
14.65MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.en.srt
7.24KB
03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.en.txt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.mp4
12.46MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.en.srt
7.79KB
03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.en.txt
4.91KB
03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.mp4
13.58MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.de.srt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.de.txt
2.81KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.en.srt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.en.txt
2.81KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.et.srt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.et.txt
2.81KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ja.srt
4.57KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ja.txt
2.82KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.kk.srt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.kk.txt
2.81KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.lt.srt
4.55KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.lt.txt
2.8KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mn.srt
4.83KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mn.txt
3.08KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mp4
7.94MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ne.srt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ne.txt
2.81KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ro.srt
4.55KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ro.txt
2.8KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sk.srt
4.55KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sk.txt
2.8KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sq.srt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sq.txt
2.81KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sr.srt
4.55KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sr.txt
2.8KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sv.srt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sv.txt
2.81KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ta.srt
4.72KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ta.txt
2.97KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.te.srt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.te.txt
2.81KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.th.srt
4.6KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.th.txt
2.85KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.tr.srt
4.56KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.tr.txt
2.81KB
03_paths-in-graphs-1/01_most-direct-route/09_slides-and-external-references_10_shortest_paths_in_graphs_1_bfs.pdf
2.12MB
03_paths-in-graphs-1/01_most-direct-route/09_slides-and-external-references_BFS.html
2.78KB
03_paths-in-graphs-1/01_most-direct-route/09_slides-and-external-references_instructions.html
1.87KB
03_paths-in-graphs-1/02_programming-assignment/01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_problems_1.pdf
363.3KB
03_paths-in-graphs-1/02_programming-assignment/01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_starter_files_1.zip
2.5KB
03_paths-in-graphs-1/02_programming-assignment/01_programming-assignment-3-paths-in-graphs_instructions.html
1.38KB
04_paths-in-graphs-2/01_fastest-route/01_fastest-route.en.srt
8.57KB
04_paths-in-graphs-2/01_fastest-route/01_fastest-route.en.txt
5.39KB
04_paths-in-graphs-2/01_fastest-route/01_fastest-route.mp4
14.95MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.en.srt
13.3KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.en.txt
8.28KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.mp4
23.92MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.sq.srt
13.3KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.sq.txt
8.28KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.te.srt
13.3KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.te.txt
8.28KB
04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.en.srt
9.71KB
04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.en.txt
6.02KB
04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.mp4
15.67MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.en.srt
4.41KB
04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.en.txt
2.76KB
04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.mp4
8.12MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.en.srt
6.25KB
04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.en.txt
3.9KB
04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.mp4
10.8MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.en.srt
9.16KB
04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.en.txt
5.91KB
04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.mp4
15.94MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/01_fastest-route/07_slides-and-external-references_10_shortest_paths_in_graphs_2_dijkstra.pdf
1.09MB
04_paths-in-graphs-2/01_fastest-route/07_slides-and-external-references_Dijkstra.html
2.79KB
04_paths-in-graphs-2/01_fastest-route/07_slides-and-external-references_instructions.html
1.48KB
04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.en.srt
7.68KB
04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.en.txt
4.8KB
04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.mp4
12.78MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.en.srt
10.12KB
04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.en.txt
6.43KB
04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.mp4
16.15MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.en.srt
7.66KB
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.en.txt
4.65KB
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.mp4
11.48MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.ru.srt
11.71KB
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.ru.txt
8.69KB
04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.en.srt
6.93KB
04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.en.txt
4.38KB
04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.mp4
13.03MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.en.srt
9.45KB
04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.en.txt
5.97KB
04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.mp4
15.45MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.en.srt
13.32KB
04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.en.txt
8.44KB
04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.mp4
21.85MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
04_paths-in-graphs-2/02_currency-exchange/07_slides-and-external-references_10_shortest_paths_in_graphs_3_bellman_ford.pdf
548.67KB
04_paths-in-graphs-2/02_currency-exchange/07_slides-and-external-references_instructions.html
1.31KB
04_paths-in-graphs-2/03_programming-assignment/01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_problems_2.pdf
355.56KB
04_paths-in-graphs-2/03_programming-assignment/01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_starter_files_2.zip
4.48KB
04_paths-in-graphs-2/03_programming-assignment/01_programming-assignment-4-paths-in-graphs_instructions.html
1.32KB
05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.en.srt
11.94KB
05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.en.txt
7.36KB
05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.mp4
15.74MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.en.srt
4.75KB
05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.en.txt
2.87KB
05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.mp4
8.84MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.en.srt
10.39KB
05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.en.txt
6.5KB
05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.mp4
22.56MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.en.srt
17.95KB
05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.en.txt
11.15KB
05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.mp4
27.5MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.en.srt
15.35KB
05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.en.txt
9.44KB
05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.mp4
24.09MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
05_minimum-spanning-trees/01_minimum-spanning-trees/06_slides-and-external-references_11_1_minimum_spanning_trees.pdf
493.03KB
05_minimum-spanning-trees/01_minimum-spanning-trees/06_slides-and-external-references_Kruskal.html
2.8KB
05_minimum-spanning-trees/01_minimum-spanning-trees/06_slides-and-external-references_instructions.html
1.46KB
05_minimum-spanning-trees/02_programming-assignment/01_programming-assignment-5-minimum-spanning-trees_11_spanning_trees_starter_files.zip
2.48KB
05_minimum-spanning-trees/02_programming-assignment/01_programming-assignment-5-minimum-spanning-trees_instructions.html
1.26KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.en.srt
2.19KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.en.txt
1.4KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.mp4
2.99MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.en.srt
12.96KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.en.txt
8.15KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.mp4
19.64MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.en.srt
8.94KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.en.txt
5.66KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.mp4
15.05MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.en.srt
7.37KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.en.txt
4.56KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.mp4
11.87MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.en.srt
10.47KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.en.txt
6.65KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.mp4
13.27MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.en.srt
3.13KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.en.txt
1.98KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.mp4
5.42MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/07_slides-and-external-references_19_advanced_shortest_paths_1_bidirectional_dijkstra.pdf
1.75MB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/07_slides-and-external-references_instructions.html
1.34KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.en.srt
13.63KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.en.txt
8.71KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.mp4
22.07MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.en.srt
2.64KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.en.txt
1.69KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.mp4
4.78MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.en.srt
8.13KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.en.txt
4.92KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.mp4
14.61MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.en.srt
7.89KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.en.txt
5.04KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.mp4
13.76MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.en.srt
12.44KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.en.txt
7.86KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.mp4
25.34MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/06_slides-and-external-references_19_advanced_shortest_paths_2_A_star.pdf
759.58KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/06_slides-and-external-references_instructions.html
1.38KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.en.srt
10.25KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.en.txt
6.53KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.mp4
15.22MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.en.srt
10.39KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.en.txt
6.46KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.mp4
16.28MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.en.srt
12.11KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.en.txt
7.57KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.mp4
21.44MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.en.srt
11.31KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.en.txt
7.18KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.mp4
17.64MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.en.srt
11.34KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.en.txt
7.11KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.mp4
20.99MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.en.srt
20.51KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.en.txt
12.62KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.mp4
30.25MB
W3siaWQiOiJleG9jX2JfUExBWSIsImFkc3BvdCI6ImJfUExBWSIsIndlaWdodCI6IjEiLCJmY2FwIjpmYWxzZSwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjwhLS1cclxuPGEgaHJlZj1cImh0dHBzOlwvXC9zeW5kaWNhdGlvbi5keW5zcnZ0YmcuY29tXC9zcGxhc2gucGhwP2lkem9uZT0xOTYxMDkyJnJldHVybl91cmw9aHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2J0c1wiICBjbGFzcz1cImJ0biBidG4td2FybmluZ1wiIHRhcmdldD1cIl9ibGFua1wiPjxzcGFuIGNsYXNzPVwiZ2x5cGhpY29uIGdseXBoaWNvbi1wbGF5XCI+PFwvc3Bhbj4gUGxheSBOb3c8XC9hPlxyXG4tLT4ifV0=
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_19_advanced_shortest_paths_3_contraction_hierarchies.pdf
1.62MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_HL-TR.pdf
1.58MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_contract.pdf
359.11KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_download.shtml
19.3KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_instructions.html
2.22KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_midas-werneck.pdf
6.02MB
06_advanced-shortest-paths-project-optional/04_programming-project/01_advanced-shortest-paths_Advanced_Shortest_Paths.pdf
1.83MB
06_advanced-shortest-paths-project-optional/04_programming-project/01_advanced-shortest-paths_Advanced_Shortest_Paths.zip
35.19KB
06_advanced-shortest-paths-project-optional/04_programming-project/01_advanced-shortest-paths_instructions.html
1.79KB
07_Resources/01_partner-specialization/01__resources.html
1.25KB
[CourseClub.NET].url
123B
[DesireCourse.Com].url
51B

Latest Search:

W3siaWQiOiJhZHN0X2JfTV8zMDB4NTAiLCJhZHNwb3QiOiJiX01fMzAweDUwIiwid2VpZ2h0IjoiNSIsImZjYXAiOmZhbHNlLCJzY2hlZHVsZSI6ZmFsc2UsIm1heFdpZHRoIjoiNzY4IiwibWluV2lkdGgiOmZhbHNlLCJ0aW1lem9uZSI6ZmFsc2UsImV4Y2x1ZGUiOmZhbHNlLCJkb21haW4iOmZhbHNlLCJjb2RlIjoiPHNjcmlwdCB0eXBlPVwidGV4dFwvamF2YXNjcmlwdFwiPlxyXG4gIGF0T3B0aW9ucyA9IHtcclxuICAgICdrZXknIDogJzdkMWNjMGUxYjk4MWM5NzY4ZGI3ODUxZmM1MzVhMTllJyxcclxuICAgICdmb3JtYXQnIDogJ2lmcmFtZScsXHJcbiAgICAnaGVpZ2h0JyA6IDUwLFxyXG4gICAgJ3dpZHRoJyA6IDMyMCxcclxuICAgICdwYXJhbXMnIDoge31cclxuICB9O1xyXG4gIGRvY3VtZW50LndyaXRlKCc8c2NyJyArICdpcHQgdHlwZT1cInRleHRcL2phdmFzY3JpcHRcIiBzcmM9XCJodHRwJyArIChsb2NhdGlvbi5wcm90b2NvbCA9PT0gJ2h0dHBzOicgPyAncycgOiAnJykgKyAnOlwvXC93d3cuYm5odG1sLmNvbVwvaW52b2tlLmpzXCI+PFwvc2NyJyArICdpcHQ+Jyk7XHJcbjxcL3NjcmlwdD4ifV0=
W3siaWQiOiJhZHN0X2JfUE9QVU5ERVIiLCJhZHNwb3QiOiJiX1BPUFVOREVSIiwid2VpZ2h0IjoiNTkiLCJmY2FwIjoiMiIsInNjaGVkdWxlIjpmYWxzZSwibWF4V2lkdGgiOmZhbHNlLCJtaW5XaWR0aCI6Ijc2OCIsInRpbWV6b25lIjpmYWxzZSwiZXhjbHVkZSI6ZmFsc2UsImRvbWFpbiI6ZmFsc2UsImNvZGUiOiI8c2NyaXB0IHR5cGU9J3RleHRcL2phdmFzY3JpcHQnIHNyYz0nXC9cL2luY3JlYXNpbmdseWNvY2tyb2FjaHBvbGljeS5jb21cL2RlXC9jOFwvZjRcL2RlYzhmNGVmM2MyZGU4NDVhN2FkNDAwZmVlYTc4MGUzLmpzJz48XC9zY3JpcHQ+In0seyJpZCI6ImNsaWNfYl9QT1BVTkRFUiIsImFkc3BvdCI6ImJfUE9QVU5ERVIiLCJ3ZWlnaHQiOiI2MCIsImZjYXAiOiIyIiwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IiJ9LHsiaWQiOiJqYXZfYl9QT1BVTkRFUiIsImFkc3BvdCI6ImJfUE9QVU5ERVIiLCJ3ZWlnaHQiOiI1MiIsImZjYXAiOiIxIiwic2NoZWR1bGUiOmZhbHNlLCJtYXhXaWR0aCI6ZmFsc2UsIm1pbldpZHRoIjpmYWxzZSwidGltZXpvbmUiOmZhbHNlLCJleGNsdWRlIjpmYWxzZSwiZG9tYWluIjpmYWxzZSwiY29kZSI6IjxzY3JpcHQ+XHJcbiQoZG9jdW1lbnQuYm9keSkub24oXCJjbGlja1wiLCBmdW5jdGlvbihldmVudCkge1xyXG4gIHdpbmRvdy5vcGVuKFwiaHR0cHM6XC9cL3RlbGxtZS5wd1wvZ29cL2phdlwiKTtcclxuICAkKHRoaXMpLm9mZihcImNsaWNrXCIpO1xyXG59KTtcclxuPFwvc2NyaXB0PiJ9XQ==