Cite Bay
How to cite Kruskal's algorithm
graph theory, search algorithm
Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest.
More informations about Kruskal's algorithm can be found at this link.
Content
Citation in APA style
Citation in Vancouver style
Citation in Harvard style
Citation in Bibtex format
@article{kruskal1956shortest,
title={On the shortest spanning subtree of a graph and the traveling salesman problem},
author={Kruskal, Joseph B},
journal={Proceedings of the American Mathematical society},
volume={7},
number={1},
pages={48--50},
year={1956},
publisher={JSTOR}
}
title={On the shortest spanning subtree of a graph and the traveling salesman problem},
author={Kruskal, Joseph B},
journal={Proceedings of the American Mathematical society},
volume={7},
number={1},
pages={48--50},
year={1956},
publisher={JSTOR}
}
Copy
Citation in APA style
Citation in Vancouver style
Citation in Harvard style
Citation in Bibtex format
@book{cormen2009introduction,
title={Introduction to algorithms},
author={Cormen, Thomas H and Leiserson, Charles E and Rivest, Ronald L and Stein, Clifford},
year={2009},
publisher={MIT press}
}
title={Introduction to algorithms},
author={Cormen, Thomas H and Leiserson, Charles E and Rivest, Ronald L and Stein, Clifford},
year={2009},
publisher={MIT press}
}
Copy
Do you like it?
Unprofitable
Please consider a donation – we do it in our free time. Do it easily Support.
Join us
Suggestions are always welcome! You can also help us with writing and became a part of the team.
Share science!
Just tell your friends about us.
