1:00
Click the first and last characters of the items you find.
en
WO
22
Dijkstra : ________’s graph search algorithm solves the single-source shortest path problem for a graph with non-negative edge path costs.
Travelling salesman : The problem which answers the question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? (2 words)
Shortest path : The problem of finding a path between two vertices in a graph such that the sum of the weights of its edges is minimized. (2 words)
Bellmanford : An algorithm that solves the single-source shortest path problem for weighted graphs with positive or negative edge weights.
Negative edges : Bellman-Ford is different from Dijkstra’s algorithm because it can handle these. (2 words)
Negative cycles : Bellman-Ford is able to detect and report the existence of ________ _____, but it cannot produce a correct answer if they are present. (2 words)
Relaxation : A process in which an approximation to the correct distance is gradually replaced by more accurate values until the optimum solution is reached.
Prim : ____’s algorithm finds a minimum spanning tree for a connected weighted undirected graph. It finds a subset of the edges that forms a tree including every vertex, where the total weight of all edges in the tree is minimized. It adds one vertex at a time to the tree.
Greedy : Prim’s and Kruskal’s are _____ algorithms.
Kruskal : _______’s algorithm finds a minimum spanning tree for a connected weighted graph. It finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. It started by making each vertex a separate tree in a forest.
Depthfirst search : A graph traversal algorithm that visits the child nodes before visiting the sibling nodes; it traverses the depth of any particular path before exploring other paths. (2 words)
Stack : Depth-first search is generally implemented using this data structure.
Breadthfirst search : A graph traversal algorithm that visits sibling nodes before visiting the child nodes. (2 words)
Queue : Breadth-first search is generally implemented using this data structure.
Floydwarshall : An algorithm that solves the all-pairs shortest path problem for weighted graphs with positive or negative edge weights.
Transitive closure : A concept used to answer questions of reachability: can one get from node d to node b in one or more hops? It usually uses an adjacency matrix. (2 words)
Matrix : Algorithms for dense graphs use an adjacency _____.
List : Algorithms for sparse graphs use an adjacency ____.
Topological : Repeatedly removing vertices with in-degree of 0 and their edges from the graph will produce this type of sort.
Maximum flow : This type of problem involves finding a feasible flow through a single-source, single-sink flow network that is maximum. (2 words)
Eulerian : A graph which contains a circuit that visits every edge of the graph once and only once, and ends on the same vertex it began on.
hamiltonian : A graph which contains a circuit that visits every vertex exactly once and ends at the vertex where it started.
A | O | Q | R | U | P | I | W | I | V | Y | V | D | G | D | T | F | Z | D | C | E | X | H | M | N | I | V | G | W | T |
U | U | D | B | R | E | A | D | T | H | F | I | R | S | T | S | E | A | R | C | H | E | I | E | M | Q | T | E | G | O |
G | D | W | B | Z | I | Z | N | F | V | L | N | R | B | U | V | L | L | O | A | P | R | K | O | H | G | R | U | L | P |
P | N | X | Q | Z | Z | B | G | G | U | T | S | M | Y | J | M | L | L | Q | R | P | C | C | G | O | A | A | L | R | O |
S | P | Q | B | E | L | L | M | A | N | F | O | R | D | Y | A | N | D | I | U | K | Y | D | T | S | A | V | E | V | L |
B | T | A | H | J | A | P | K | E | N | G | J | E | T | H | X | E | M | U | U | Z | E | I | G | U | F | E | R | O | O |
R | E | L | A | X | A | T | I | O | N | N | O | M | S | O | I | G | B | I | N | U | B | J | D | G | J | L | I | H | G |
O | S | Z | Q | M | B | C | U | D | M | H | I | R | J | T | M | A | Q | G | S | U | Y | K | W | G | J | L | A | O | I |
D | R | N | T | I | O | E | F | X | C | M | A | T | W | U | U | T | R | D | P | J | S | S | J | I | P | I | N | C | C |
L | A | E | M | A | K | B | W | V | O | W | Q | U | V | V | M | I | J | U | V | K | E | T | K | Q | G | N | Z | G | A |
X | M | G | Z | F | P | N | M | I | D | F | Q | J | Y | Z | F | V | Z | K | F | D | E | R | T | L | X | G | O | O | L |
U | Y | A | U | C | T | E | B | Y | L | M | V | B | M | O | L | E | G | J | K | B | H | A | O | C | M | S | M | T | Z |
T | Q | T | M | K | T | N | O | K | B | V | G | S | V | B | O | E | Z | G | J | V | K | Y | Y | V | A | A | S | D | T |
B | D | I | Y | X | R | L | C | Z | D | J | R | H | R | T | W | D | C | U | F | P | P | A | R | Z | T | L | X | P | R |
P | E | V | D | B | F | A | Q | C | W | E | R | O | E | T | T | G | H | J | D | E | A | X | F | C | B | E | E | H | A |
N | U | E | U | S | T | F | S | V | J | H | P | R | B | H | T | E | D | L | U | N | H | H | V | M | Z | S | A | V | N |
R | R | C | R | S | X | N | H | Q | X | D | L | T | H | J | N | S | M | C | W | X | K | A | Q | Q | E | M | E | E | S |
R | S | Y | K | P | A | C | A | J | U | N | L | E | H | X | T | V | U | L | Y | G | I | R | M | A | C | A | U | Z | I |
I | U | C | C | M | V | M | M | V | G | K | D | S | N | F | Z | Y | T | P | T | Q | X | U | U | I | Q | N | X | Z | T |
I | L | L | F | C | L | J | I | R | Q | U | Y | T | O | H | I | A | I | K | M | Q | U | X | N | S | W | B | H | D | I |
E | M | E | R | T | I | G | L | D | Z | W | X | P | Q | P | J | R | Z | U | U | X | F | E | Z | V | K | E | K | G | V |
O | Q | S | D | W | S | P | T | Q | S | J | M | A | T | R | I | X | S | G | J | Q | C | V | U | G | V | A | W | R | E |
U | N | G | V | O | T | R | O | P | Q | A | H | T | O | R | D | N | E | T | S | X | F | U | X | E | O | Q | L | E | C |
W | S | Y | W | Y | W | W | N | A | O | W | X | H | U | Z | B | L | M | E | S | O | M | F | J | A | G | T | I | E | L |
C | P | X | U | B | J | Y | I | S | M | W | I | W | I | X | G | Z | B | N | L | E | V | S | B | M | E | R | B | D | O |
R | V | I | A | B | W | W | A | P | F | F | Q | B | E | Y | C | T | D | D | T | H | A | Z | F | G | P | P | R | Y | S |
B | U | E | T | O | M | Q | N | C | I | Y | O | K | Y | F | O | M | L | D | X | U | T | R | P | B | J | J | L | T | U |
C | Y | K | R | V | M | P | T | A | C | P | E | S | I | J | O | J | L | K | L | V | D | Q | C | X | V | O | B | I | R |
Y | I | R | K | Q | B | R | B | F | Y | S | T | Z | N | Y | H | Z | A | C | H | B | Z | B | X | H | H | P | I | R | E |
S | M | Y | J | N | I | I | Y | S | A | A | U | N | W | Z | C | N | E | M | M | T | A | R | C | G | P | C | M | E | S |
- Prim’s and Kruskal’s are _____ algorithms.
- Algorithms for dense graphs use an adjacency _____.
- Algorithms for sparse graphs use an adjacency ____.
- Depth-first search is generally implemented using this data structure.
- Breadth-first search is generally implemented using this data structure.
- Bellman-Ford is different from Dijkstra’s algorithm because it can handle these. (2 words)
- A graph traversal algorithm that visits sibling nodes before visiting the child nodes. (2 words)
- A graph which contains a circuit that visits every vertex exactly once and ends at the vertex where it started.
| - Repeatedly removing vertices with in-degree of 0 and their edges from the graph will produce this type of sort.
- An algorithm that solves the all-pairs shortest path problem for weighted graphs with positive or negative edge weights.
- An algorithm that solves the single-source shortest path problem for weighted graphs with positive or negative edge weights.
- ________’s graph search algorithm solves the single-source shortest path problem for a graph with non-negative edge path costs.
- A graph which contains a circuit that visits every edge of the graph once and only once, and ends on the same vertex it began on.
- This type of problem involves finding a feasible flow through a single-source, single-sink flow network that is maximum. (2 words)
- The problem of finding a path between two vertices in a graph such that the sum of the weights of its edges is minimized. (2 words)
| - A process in which an approximation to the correct distance is gradually replaced by more accurate values until the optimum solution is reached.
- Bellman-Ford is able to detect and report the existence of ________ _____, but it cannot produce a correct answer if they are present. (2 words)
- A concept used to answer questions of reachability: can one get from node d to node b in one or more hops? It usually uses an adjacency matrix. (2 words)
- A graph traversal algorithm that visits the child nodes before visiting the sibling nodes; it traverses the depth of any particular path before exploring other paths. (2 words)
- The problem which answers the question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? (2 words)
- ____’s algorithm finds a minimum spanning tree for a connected weighted undirected graph. It finds a subset of the edges that forms a tree including every vertex, where the total weight of all edges in the tree is minimized. It adds one vertex at a time to the tree.
- _______’s algorithm finds a minimum spanning tree for a connected weighted graph. It finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. It started by making each vertex a separate tree in a forest.
|
© 2013
PuzzleFast.com, Noncommercial Use Only
A | O | Q | R | U | P | I | W | I | V | Y | V | D | G | D | T | F | Z | D | C | E | X | H | M | N | I | V | G | W | T |
U | U | D | B | R | E | A | D | T | H | F | I | R | S | T | S | E | A | R | C | H | E | I | E | M | Q | T | E | G | O |
G | D | W | B | Z | I | Z | N | F | V | L | N | R | B | U | V | L | L | O | A | P | R | K | O | H | G | R | U | L | P |
P | N | X | Q | Z | Z | B | G | G | U | T | S | M | Y | J | M | L | L | Q | R | P | C | C | G | O | A | A | L | R | O |
S | P | Q | B | E | L | L | M | A | N | F | O | R | D | Y | A | N | D | I | U | K | Y | D | T | S | A | V | E | V | L |
B | T | A | H | J | A | P | K | E | N | G | J | E | T | H | X | E | M | U | U | Z | E | I | G | U | F | E | R | O | O |
R | E | L | A | X | A | T | I | O | N | N | O | M | S | O | I | G | B | I | N | U | B | J | D | G | J | L | I | H | G |
O | S | Z | Q | M | B | C | U | D | M | H | I | R | J | T | M | A | Q | G | S | U | Y | K | W | G | J | L | A | O | I |
D | R | N | T | I | O | E | F | X | C | M | A | T | W | U | U | T | R | D | P | J | S | S | J | I | P | I | N | C | C |
L | A | E | M | A | K | B | W | V | O | W | Q | U | V | V | M | I | J | U | V | K | E | T | K | Q | G | N | Z | G | A |
X | M | G | Z | F | P | N | M | I | D | F | Q | J | Y | Z | F | V | Z | K | F | D | E | R | T | L | X | G | O | O | L |
U | Y | A | U | C | T | E | B | Y | L | M | V | B | M | O | L | E | G | J | K | B | H | A | O | C | M | S | M | T | Z |
T | Q | T | M | K | T | N | O | K | B | V | G | S | V | B | O | E | Z | G | J | V | K | Y | Y | V | A | A | S | D | T |
B | D | I | Y | X | R | L | C | Z | D | J | R | H | R | T | W | D | C | U | F | P | P | A | R | Z | T | L | X | P | R |
P | E | V | D | B | F | A | Q | C | W | E | R | O | E | T | T | G | H | J | D | E | A | X | F | C | B | E | E | H | A |
N | U | E | U | S | T | F | S | V | J | H | P | R | B | H | T | E | D | L | U | N | H | H | V | M | Z | S | A | V | N |
R | R | C | R | S | X | N | H | Q | X | D | L | T | H | J | N | S | M | C | W | X | K | A | Q | Q | E | M | E | E | S |
R | S | Y | K | P | A | C | A | J | U | N | L | E | H | X | T | V | U | L | Y | G | I | R | M | A | C | A | U | Z | I |
I | U | C | C | M | V | M | M | V | G | K | D | S | N | F | Z | Y | T | P | T | Q | X | U | U | I | Q | N | X | Z | T |
I | L | L | F | C | L | J | I | R | Q | U | Y | T | O | H | I | A | I | K | M | Q | U | X | N | S | W | B | H | D | I |
E | M | E | R | T | I | G | L | D | Z | W | X | P | Q | P | J | R | Z | U | U | X | F | E | Z | V | K | E | K | G | V |
O | Q | S | D | W | S | P | T | Q | S | J | M | A | T | R | I | X | S | G | J | Q | C | V | U | G | V | A | W | R | E |
U | N | G | V | O | T | R | O | P | Q | A | H | T | O | R | D | N | E | T | S | X | F | U | X | E | O | Q | L | E | C |
W | S | Y | W | Y | W | W | N | A | O | W | X | H | U | Z | B | L | M | E | S | O | M | F | J | A | G | T | I | E | L |
C | P | X | U | B | J | Y | I | S | M | W | I | W | I | X | G | Z | B | N | L | E | V | S | B | M | E | R | B | D | O |
R | V | I | A | B | W | W | A | P | F | F | Q | B | E | Y | C | T | D | D | T | H | A | Z | F | G | P | P | R | Y | S |
B | U | E | T | O | M | Q | N | C | I | Y | O | K | Y | F | O | M | L | D | X | U | T | R | P | B | J | J | L | T | U |
C | Y | K | R | V | M | P | T | A | C | P | E | S | I | J | O | J | L | K | L | V | D | Q | C | X | V | O | B | I | R |
Y | I | R | K | Q | B | R | B | F | Y | S | T | Z | N | Y | H | Z | A | C | H | B | Z | B | X | H | H | P | I | R | E |
S | M | Y | J | N | I | I | Y | S | A | A | U | N | W | Z | C | N | E | M | M | T | A | R | C | G | P | C | M | E | S |
- GREEDY
- MATRIX
- LIST
- STACK
- QUEUE
- NEGATIVEEDGES
- BREADTHFIRSTSEARCH
- HAMILTONIAN
| - TOPOLOGICAL
- FLOYDWARSHALL
- BELLMANFORD
- DIJKSTRA
- EULERIAN
- MAXIMUMFLOW
- SHORTESTPATH
| - RELAXATION
- NEGATIVECYCLES
- TRANSITIVECLOSURE
- DEPTHFIRSTSEARCH
- TRAVELLINGSALESMAN
- PRIM
- KRUSKAL
|
© 2013
PuzzleFast.com, Noncommercial Use Only