How to cite Dijkstra's algorithm
Also: Dijkstra's Shortest Path First algorithm, SPF algorithm
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph.
More informations about Dijkstra's algorithm can be found at this link.
http://citebay.com/how-to-cite/dijkstras-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{dijkstra1959note,
title={A note on two problems in connexion with graphs},
author={Dijkstra, Edsger W},
journal={Numerische mathematik},
volume={1},
number={1},
pages={269--271},
year={1959},
publisher={Springer}
}
title={A note on two problems in connexion with graphs},
author={Dijkstra, Edsger W},
journal={Numerische mathematik},
volume={1},
number={1},
pages={269--271},
year={1959},
publisher={Springer}
}
@article{dijkstra1959note,
title={A note on two problems in connexion with graphs},
author={Dijkstra, Edsger W},
journal={Numerische mathematik},
volume={1},
number={1},
pages={269--271},
year={1959},
publisher={Springer}
}
title={A note on two problems in connexion with graphs},
author={Dijkstra, Edsger W},
journal={Numerische mathematik},
volume={1},
number={1},
pages={269--271},
year={1959},
publisher={Springer}
}
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.
