kruskal's+algorithm

См. также в других словарях:

• Kruskal's algorithm — is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is… …   Wikipedia

• Kruskal — can refer to any one of three brothers:* William Kruskal (1919 2005), American mathematician and statistician * Martin Kruskal (1925 2006), American mathematician and physicist * Joseph Kruskal (born 1928), American mathematician and computer… …   Wikipedia

• Kruskal-Algorithmus — Der Algorithmus von Kruskal ist ein Algorithmus der Graphentheorie zur Berechnung minimaler Spannbäume von ungerichteten Graphen. Der Graph muss dazu zusätzlich zusammenhängend, kantengewichtet und endlich sein. Der Algorithmus stammt von Joseph… …   Deutsch Wikipedia

• Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

• Maze generation algorithm — Maze generation algorithms are automated methods for the creation of mazes. This maze generated by modified version of Prim s algorithm, below. Contents 1 Graph theory based methods …   Wikipedia

• Joseph Kruskal — Joseph Bernard Kruskal, Jr. (born January 29 1928) is an American mathematician, statistician, and psychometrician. He was a student at the University of Chicago and at Princeton University, where he completed his Ph.D. in 1954, nominally under… …   Wikipedia

• Reverse-delete algorithm — The reverse delete algorithm is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge weighed graph. If the graph is disconnected, this algorithm will find a minimum spanning tree for each disconnected… …   Wikipedia

• Prim's algorithm — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …   Wikipedia

• Martin David Kruskal — Born September 28, 1925(1925 09 28) New York City …   Wikipedia

• Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… …   Wikipedia

• Borůvka's algorithm — is an algorithm for finding a minimum spanning tree in a graph for which all edge weights are distinct.It was first published in 1926 by Otakar Borůvka as a method of constructing an efficient electricity network for Moravia. [cite journal | last …   Wikipedia