What Adjective Is Applied To Algorithms, Such As Dijkstra's Algorithm, That Make The Locally Optimal Choice At Every Step? Kruskal's Algorithm And Prim's Algorithm, Used To Find A Graph’S Minimum Spanning Tree, Are Examples Of This Kind Of Algorithm.

🎲 Try a Random Question  |  Total Questions in Quiz: 15073  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Online Quiz League (OQL) Question Bank — practice the complete quiz, review flashcards, or try a random question.

The Online Quiz League (UK) is a well known weekly team quiz league. 


1. What Adjective Is Applied To Algorithms, Such As Dijkstra's Algorithm, That Make The Locally Optimal Choice At Every Step? Kruskal's Algorithm And Prim's Algorithm, Used To Find A Graph’S Minimum Spanning Tree, Are Examples Of This Kind Of Algorithm.