Consider the weighted directed graph with edges A→C (2), A→F (7), C→B (10), C→F (3), B→D (1), B→Z (15), F→D (1), F→E (6), D→Z (7), D→E (2), E→Z (4). In what order are the nodes traversed to find the shortest path from A to Z?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. A → C → F → D → E
Explanation
Expanding by the least path cost: A (0), C (2), F (5 via C), D (6 via F), E (8 via D), and then Z (12 via E). The shortest path is A-C-F-D-E-Z with cost 12.More Artificial Intelligence (AI) questions
- Which of the following describes the flow through the layers of a neural network? A. Information → Input layer → Hidden layer B. Bias → Out…
- Given below are two statements: one is labelled as Assertion A and the other as Reason R. A: Artificial neural networks are the backbone of…
- Overfitting is expected when we observe that
- The A* algorithm is optimal when
- Which artificial intelligence technique enables computers to understand the associations and relationships between objects and events?
- Where do the values of alpha–beta search get updated?