Algorithms - Optimisation (Dijkstra)

In a weighted graph what is an edge?

• A node or dot.

• A connecting line.

Can I run Dijkstra on a non-weighted graph?

• Yes

• No

Before looping through the nodes, what do we set as the values for the weights for all the nodes?

• The weights on the edges

• Set them all to infinity.

• Set them all to infinity and the starting one to zero.

• Set them all to infinity and leave the starting nodes' weight.

What algorithm does Google Maps use?

• Dijkstra's

• Distance-Vector

• A*

• D*

Optimisation algorithms are designed to find the ______ path from a start node to any other node

Select all correct applications of a shortest-path algorithm

• Navigation

• NPC control in gaming

• Sending data packets

• Financial investment choices

• AI neural network training

Each node within a shortest path algorithm is ______

• Weighted

• Heavy

• Valued

• Numbered

Which of the following could a weighted node represent within a path finding algorithm?

• Time

• Cost

• Steps

• Distance

Which type of queue is used in Dijkstra's Algorithm?

• Priority

• Circular

• Linear

Which symbol is used to represent a temporary distance when calculating the shortest path?

• ∞

• !=

• ⊻

• R