Kruskal's algorithm
From Wiktionary, the free dictionary
Jump to navigation
Jump to search
English
[
edit
]
English
Wikipedia
has an article on:
Kruskal's algorithm
Wikipedia
Proper noun
[
edit
]
Kruskal
's
algorithm
An algorithm in discrete mathematics/graph theory that is used to generate the minumum spanning tree in a given direction of two paths. It translates a forest from the nodes in the graph, considering each node as its own tree.
Categories
:
English lemmas
English proper nouns
English uncountable nouns
English multiword terms
English eponyms
Hidden categories:
English terms with non-redundant non-automated sortkeys
English entries with language name categories using raw markup
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Entry
Discussion
English
Views
Read
Edit
History
More
Search
Navigation
Main Page
Community portal
Requested entries
Recent changes
Random entry
Help
Glossary
Donations
Contact us
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Print/export
Create a book
Download as PDF
Printable version
In other languages
Magyar
Malagasy
