true/false
An unweighted path length measures the number of edges in a graph. |
||
Breadth first search traverses the graph in "layers", beginning with the closest nodes to the ending location first. |
||
The computer knows about neighbors by checking the graph storage (such as the adjacency matrix or the adjacency list). |
||
Breadth first traversals use a stack to process nodes. |
||
The weighted path length is the sum of the edge costs on a path. |
||
Dijkstra's shortest path algorithm can be used to find the shortest path in a weighted graph with positive edges. |
||
Dijkstra's shortest path algorithm uses a FIFO queue like the BFS. |
||
A negative cost cycle means that we can keep shortening a path by going in an infinite loop. |
||
Graphs with negative edge costs, but no negative cost cycle, can use Bellman-Ford's shortest path algorithm. |
||
A topological sort orders verticies in a DAG so that if there is a path from node 1 to node 2, node 2 comes before node 1. |
||
A graph with a cycle cannot have a topological sort. |
||
The in-degree of a node is the number of incoming edges. |
||
Critical path analysis is another method for calculating the shortest path. |
||
Slack time is the amount of time a task can be delayed without delaying the project. |
||
Zero slack activities are on the critical path. |
False.
True.
True
False.
True
True
False
False
True.
True
True
True
False
True
False
Get Answers For Free
Most questions answered within 1 hours.