Q: What are the Prim and Kruskal algorithms?

Write your answer...

Submit

Still have questions?

Continue Learning about Other Math

Well, first of all, 30 and 40 are not prim numbers. Here is a list of prim numbers in that general neighborhood. There are others before and after these, but the answer to your question is most likely here in this list: . . . 19 . . 23 . . 29 . . 31 . . 37 . . 41 . . 43 . . 47 . . 53 . . 59 . . 61 . . .

AES

It makes problem solving become easier especial when counting large numbers

Cryptography is the study of hiding information using mathematical algorithms in such a way that the original information cannot be assertained from the resulting 'cyphercode' without knowledge of the specific 'key' required to undo the changes made by the algorithm.The algorithms used in cryptography are related to math, being mathematically founded, and so, by extension, cryptography is related to math.

A twiddle factor, in fast Fourier transform (FFT) algorithms, is any of the trigonometric constant coefficients that are multiplied by the data in the course of the algorithm.

Related questions

Both algorithms have the same efficiency and both are based on the same greedy approach. But Kruskal's algorithm is much easier to implement.

"What are difference between Prim's algorithm and Kruskal's algorithm for finding the minimum spanning tree of a graph?" Prim's method starts with one vertex of a graph as your tree, and adds the smallest edge that grows your tree by one more vertex. Kruskal starts with all of the vertices of a graph as a forest, and adds the smallest edge that joins two trees in the forest. Prim's method is better when * You can only concentrate on one tree at a time * You can concentrate on only a few edges at a time Kruskal's method is better when * You can look at all of the edges at once * You can hold all of the vertices at once * You can hold a forest, not just one tree Basically, Kruskal's method is more time-saving (you can order the edges by weight and burn through them fast), while Prim's method is more space-saving (you only hold one tree, and only look at edges that connect to vertices in your tree).

http://wiki.answers.com/Differences_between_prim's_and_kruskal'sexample http://wiki.answers.com/Differences_between_prim's_and_kruskal's

Complexity prim = O(E+ V logV). E edge and V vertex. kurskal = O(E lgV ).

The correctness of either Prim's or Kruskal's algorithm, is not affected by negative edges in the graph. They both work fine with negative edges. The question boils down to "Does a Priority Queue of numbers work with negative numbers?" because of the fact that both Prim's and Kruskal's algorithm use a priority queue. Of course -- as negative numbers are simply numbers smaller than 0. The "<" sign will still work with negative numbers.

William Kruskal was born in 1919.

Joseph Kruskal died in 2010.

Joseph Kruskal was born in 1928.

William Kruskal died in 2005.

Clyde Kruskal was born on 1954-05-25.

Martin David Kruskal was born on 1925-09-28.

Martin David Kruskal died on 2006-12-26.