Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

Trees and Graphs

This class was created by Brainscape user Benjamin Janes. Visit their profile to learn more about the creator.

By: Benjamin Janes
Start Studying

Decks in this class (16)

Graphs and Their Representations
What is a graph in computer scien...,
What are the components of a graph 2,
What is a directed graph digraph 3
21  cards
Graph_Traversals_Breadth_First_Search_Flashcards
Define graph traversal 1,
How does breadth first search bfs...,
Which data structure powers bfs 3
16  cards
Depth_First_Search_Flashcards
Front 1,
What is the main idea behind dfs 2,
What data structure is typically ...
20  cards
Topological Sort Flashcards
Front 1,
What is a topological sort 2,
What type of graph allows a topol...
16  cards
Strongly Connected Components Flashcards
What is a strongly connected comp...,
What is the condition for a subse...,
What is a maximal strongly connec...
10  cards
Maximum Strongly Connected Components Flashcards
Front 1,
What is a strongly connected comp...,
What is a maximal strongly connec...
12  cards
Strongly Connected Components Kosaraju Algorithm
Front 1,
What is a strongly connected comp...,
What is a maximal strongly connec...
14  cards
Amortized Analysis Flashcards
What is amortized analysis 1,
How is amortized analysis differe...,
When is amortized analysis useful 3
44  cards
Spanning Trees and Minimal Spanning Trees with Applications
What is a spanning tree 1,
How many edges does a spanning tr...,
What is a minimal spanning tree m...
20  cards
Kruskal’s Algorithm for Finding Minimal Spanning Trees
What is the goal of kruskal s alg...,
What is a minimum spanning tree m...,
What data structure does kruskal ...
15  cards
Nodes, Trees, and Forests
What is a node 1,
What is a tree 2,
What is a forest 3
10  cards
Shortest Path Flashcards
Front 1,
What is the shortest path problem 2,
Why is the shortest path problem ...
21  cards
Bellman Ford Algorithm for Single Source Shortest Paths
What problem does the bellman for...,
What is the core operation of the...,
How are distances initialized in ...
13  cards
Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights
What is the main purpose of dijks...,
What type of graph can dijkstra s...,
What type of algorithm is dijkstr...
29  cards
DAG Shortest Path
What is a directed acyclic graph ...,
Why can we optimize shortest path...,
What is the key idea for finding ...
16  cards
Floyd Warshall All Pairs Shortest Path
Term 1,
All pairs shortest path apsp 2,
Distance matrix d 3
16  cards

More about
Trees and Graphs

  • Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study Benjamin Janes's Trees and Graphs flashcards now!

How studying works.

Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.

Learn more about spaced repetition

Add your own flashcards.

Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!

What's Brainscape anyway?

Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.

We use an adaptive study algorithm that is proven to help you learn faster and remember longer....

Looking for something else?

SHHS - Science - Graphs - Year 7
  • 4 decks
  • 52 flashcards
  • 2109 learners
Decks: Graphs, Looking At Data Tables, Looking At Data Graphs, And more!
Memoria Press The Book of Trees
  • 31 decks
  • 830 flashcards
  • 42 learners
Decks: Lesson 1, Lesson 2, Lesson 2 Review, And more!
Graph Theory
  • 6 decks
  • 319 flashcards
  • 17 learners
Decks: Chapter 2 Walks, Chapter 3 Algorithms, Chapter 4 Graphs On Surfaces, And more!
Find Flashcards
Make Flashcards
Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions