1
Q
Djikstras algorithm
A
Answers shortest path for weighted graphs
2
Q
Weight
A
A number associated with each edge on a graph
3
Q
Weighted vs unweighted graphs
A
A weighted graph has…weights ; )
4
Q
Cycle
A
Circles
When you can follow a node and end up at a previous node
5
Q
Undirected graphs and cycles.
A
Undirected graphs are cycles because the nodes point to each other
6
Q
Djikstras algorithm and cycles
A
It only works with no cycles or with positive weight cycles.
7
Q
Bellman-ford algorithm
A
Works with negative weight edges
Algorithms
flashcards
Decks in class (12)
# Cards
