Brainscape
Find Flashcards
Make Flashcards
Why It Works
More
Educators
Businesses
Tutors & resellers
Content partnerships
Academy
About
Educators
Teachers & professors
Content partnerships
Tutors & resellers
Businesses
Employee training
Content partnerships
Tutors & resellers
Academy
About
Log in
Log in
Get Started
Brainscape's Knowledge Genome
TM
Entrance Exams
Professional Certifications
Foreign Languages
Medical & Nursing
Science
English
Humanities & Social Studies
Mathematics
Law
Vocations
Health & Fitness
Business & Finance
Technology & Engineering
Food & Beverage
Fine Arts
Random Knowledge
Top Flashcards (Certified)
All Flashcards
CS 3250
> Lecture 0-7: DFS & BFS > Flashcards
Lecture 0-7: DFS & BFS Flashcards
(0 cards)
Start Studying
CS 3250
(8 decks)
Lecture 8: DFS Tree of Discovery + Topological Sort
Lecture 9: T sort, Tarjan's Articulation Points Algorithm
Lecture 11: Kosaraju (SCCs) and Intro Prim's Algorithm (MST)
Lecture 12: Prim's MST algorithm
Lecture 13: Kruskal's algorithm + Union-Find Data structure
Lecture 14: Dijkstra's Shortest Path Algorithm
Lecture 0-7: DFS & BFS
Huffman Codes
