Kruskal's Algorithm Flashcards

Beschreibung

AS level Further Maths (Decision 1) Karteikarten am Kruskal's Algorithm Flashcards, erstellt von Ezra Dorland am 10/09/2017.
Ezra Dorland
Karteikarten von Ezra Dorland, aktualisiert more than 1 year ago
Ezra Dorland
Erstellt von Ezra Dorland vor fast 7 Jahre
1
0

Zusammenfassung der Ressource

Frage Antworten
Define Graph A collection of vertices connected by arcs
Define subgraph A part of a graph
What is also a type of subgraph? One that has all vertices but not all arcs
Define cycle A closed path where the end vertex of the last arc is the start vertex of the first arc
Define tree a connected graph with no cycles
Define weight A property arcs may have e.g. cost, distance
Define minimum spanning tree a sub graph in which all vertices are connected without cycles and have the lowest total weight of any spanning tree
What is Kruskal's Algorithm? Sort all arcs in ascending weight Arc with least weight is start of tree If the next lowest arc does not form a cycle, add it Stop when all vertices are connected
Zusammenfassung anzeigen Zusammenfassung ausblenden

ähnlicher Inhalt

GCSE Subjects
KimberleyC
General questions on photosynthesis
Fatima K
GoConqr Getting Started Guide
Norman McBrien
Biological Definitions
Yamminnnn
MODE, MEDIAN, MEAN, AND RANGE
Elliot O'Leary
New Possibilities with ExamTime's Flashcard Maker
Andrea Leyden
Making the Most of GoConqr Flashcards
Sarah Egan
CITAÇÕES DE GRANDES FILÓSOFOS
miminoma
Flashcards for CPXP exam
Lydia Elliott, Ed.D
Theories of Religion
Heloise Tudor
A-LEVEL ENGLISH LANGUAGE : Key Theorists
Eleanor H