Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures

KO | EN

gitlite — search

#hacktoberfest #ai #golang #go #rust #deep-learning #macos #java #awesome #cli #security #ios #mcp #open-source

Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures

(★ 37)

Notebook for quick search

Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Coursera Stanford Graph Search, Shortest Paths and Data Structures

Course can be found in [Coursera](https://www.coursera.org/learn/algorithms-graphs-data-structures)

Quiz answers and notebook for quick search can be found in my blog [SSQ](https://ssq.github.io/2017/07/17/Coursera%20S%20Algorithms%20Specialization%20Notebook/)

- Week 1 Lecture slides:
  - 10: Graph Search and Connectivity
    - [Generic Graph Search](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/10.1-slides_algo-graphs-search_typed.pdf)
    - [Breadth-First Search (BFS)](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/10.2-slides_algo-graphs-bfs_typed.pdf), [Application: Shortest Paths](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/10.2-slides_algo-graphs-bfs_typed.pdf), [Application: Undirected Connectivity](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/10.2-slides_algo-graphs-bfs_typed.pdf)
    - [Depth-First Search](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/10.3-slides_algo-graphs-dfs_typed.pdf), [Application: Topological Sort](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/10.3-slides_algo-graphs-dfs_typed.pdf)
    - Strongly Connected Components(SCC),  [Kosaraju’s Two‐Pass Algorithm](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/10.4-slides_algo-graphs-scc_typed.pdf)
    - [ ] [Implementation]() by Python
    - (Optional)[Structure of the Web](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/10.6-slides_algo-graphs-web_typed.pdf)
- Week 2 Lecture slides:
  - 11: Dijkstra's Shortest-Path Algorithm
    - [Dijkstra’s Algorithm](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/11.1-slides_algo-dijkstra-basics_typed.pdf), [Correctness](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/11.2-slides_algo-dijkstra-correctness_typed.pdf), [Fast Implementation with Heap](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/11.3-slides_algo-dijkstra-runtime_typed.pdf)
    - [x] [Implementation](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/tree/master/Programming%20Assignment%20%202) by Python
- Week 3 Lecture slides:
  - 12: Heaps
    - [Heap: Supported Operations; Application: Sorting; Application: Event Manager; Application: Median Maintenence; Application: Speeding Up Dijkstra](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/12.2-slides_algo-ds-heaps-basics_typed.pdf)
    - [x] [Implementation Heap application: Median Maintenence](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/tree/master/Programming%20Assignment%203) by Python
    - [Array Implementation, Insert and Bubble‐Up, Extract‐Min and Bubble‐Down](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/12.3-slides_algo-ds-heaps-guts_typed.pdf)
  - 13: Balanced Binary Search Trees
    - [Balanced Search Trees: Supported Operations](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/13.1-slides_algo-ds-trees-ops-typed.pdf)
    - Binary Search Tree: [Searching and Inserting; Min, Max, Pred, And Succ; In-Order Traversal; Deletion; Select and Rank](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/13.2-slides_algo-ds-trees-basics-typed.pdf)
    - Balanced Search Trees: [Red-Black](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/13.3-slides_algo-ds-trees-redblack-typed.pdf)
    - (Optional)[Rotations: left rotation; right rotation](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/13.4-slides_algo-ds-trees-rotations-annotated.pdf)
    - (Optional)[Insertion In A Red-Black Tree](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/13.5-slides_algo-ds-trees-rbinsert-annotated.pdf)
- Week 4 Lecture slides:
  - 14: Hashing
    - [Hash Table: Supported Operations; Application: De‐Duplication; Application: The 2‐SUM Problem](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/14.1-slides_algo-ds-hash-basics_typed.pdf)
    - [x] [Implementation](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/tree/master/Programming%20Assignment%204) by Python
    - [Resolving Collisions; Good Hash Function: Bad Hash Function](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/14.2-slides_algo-ds-hash-guts_typed.pdf)
  - 15: Universal Hash Functions:
    - [Motivation](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/15.1-slides_algo-ds-hash-universal1-typed.pdf)
  - 16: Bloom Filters
    - [Bloom Filters](https://github.com/SSQ/Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures/blob/master/Lecture%20Slides/16.1-slides_algo-ds-bloom-typed.pdf)

Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures

Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures

Coursera-Stanford-Graph-Search-Shortest-Paths-and-Data-Structures Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README