How to cite A* algorithm
Also: A star
search algorithm, computer science
Computer algorithm that is used to find the optimal path in the graph.
More informations about A* algorithm can be found at this link.
http://citebay.com/how-to-cite/algorithm/
Copy to clipboard: CTLR + C, then ENTER or click OK
Content
Citation in APA style
Citation in Vancouver style
Citation in Harvard style
Citation in Bibtex format
@article{Hart1968,
doi = {10.1109/tssc.1968.300136},
url = {https://doi.org/10.1109/tssc.1968.300136},
year = {1968},
publisher = {Institute of Electrical and Electronics Engineers ({IEEE})},
volume = {4},
number = {2},
pages = {100--107},
author = {Peter Hart and Nils Nilsson and Bertram Raphael},
title = {A Formal Basis for the Heuristic Determination of Minimum Cost Paths},
journal = {{IEEE} Transactions on Systems Science and Cybernetics}
}
doi = {10.1109/tssc.1968.300136},
url = {https://doi.org/10.1109/tssc.1968.300136},
year = {1968},
publisher = {Institute of Electrical and Electronics Engineers ({IEEE})},
volume = {4},
number = {2},
pages = {100--107},
author = {Peter Hart and Nils Nilsson and Bertram Raphael},
title = {A Formal Basis for the Heuristic Determination of Minimum Cost Paths},
journal = {{IEEE} Transactions on Systems Science and Cybernetics}
}
@article{Hart1968,
doi = {10.1109/tssc.1968.300136},
url = {https://doi.org/10.1109/tssc.1968.300136},
year = {1968},
publisher = {Institute of Electrical and Electronics Engineers ({IEEE})},
volume = {4},
number = {2},
pages = {100--107},
author = {Peter Hart and Nils Nilsson and Bertram Raphael},
title = {A Formal Basis for the Heuristic Determination of Minimum Cost Paths},
journal = {{IEEE} Transactions on Systems Science and Cybernetics}
}
doi = {10.1109/tssc.1968.300136},
url = {https://doi.org/10.1109/tssc.1968.300136},
year = {1968},
publisher = {Institute of Electrical and Electronics Engineers ({IEEE})},
volume = {4},
number = {2},
pages = {100--107},
author = {Peter Hart and Nils Nilsson and Bertram Raphael},
title = {A Formal Basis for the Heuristic Determination of Minimum Cost Paths},
journal = {{IEEE} Transactions on Systems Science and Cybernetics}
}
Copy to clipboard: CTLR + C, then ENTER or click OK
Citation in APA style
Citation in Vancouver style
Citation in Harvard style
Citation in Bibtex format
@article{Hart1972,
doi = {10.1145/1056777.1056779},
url = {https://doi.org/10.1145/1056777.1056779},
year = {1972},
month = dec,
publisher = {Association for Computing Machinery ({ACM})},
number = {37},
pages = {28--29},
author = {Peter E. Hart and Nils J. Nilsson and Bertram Raphael},
title = {$\less$u$\greater$Correction$\less$/u$\greater$ to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"},
journal = {{ACM} {SIGART} Bulletin}
}
doi = {10.1145/1056777.1056779},
url = {https://doi.org/10.1145/1056777.1056779},
year = {1972},
month = dec,
publisher = {Association for Computing Machinery ({ACM})},
number = {37},
pages = {28--29},
author = {Peter E. Hart and Nils J. Nilsson and Bertram Raphael},
title = {$\less$u$\greater$Correction$\less$/u$\greater$ to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"},
journal = {{ACM} {SIGART} Bulletin}
}
@article{Hart1972,
doi = {10.1145/1056777.1056779},
url = {https://doi.org/10.1145/1056777.1056779},
year = {1972},
month = dec,
publisher = {Association for Computing Machinery ({ACM})},
number = {37},
pages = {28--29},
author = {Peter E. Hart and Nils J. Nilsson and Bertram Raphael},
title = {$\less$u$\greater$Correction$\less$/u$\greater$ to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"},
journal = {{ACM} {SIGART} Bulletin}
}
doi = {10.1145/1056777.1056779},
url = {https://doi.org/10.1145/1056777.1056779},
year = {1972},
month = dec,
publisher = {Association for Computing Machinery ({ACM})},
number = {37},
pages = {28--29},
author = {Peter E. Hart and Nils J. Nilsson and Bertram Raphael},
title = {$\less$u$\greater$Correction$\less$/u$\greater$ to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"},
journal = {{ACM} {SIGART} Bulletin}
}
Copy to clipboard: CTLR + C, then ENTER or click OK
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.
