11//used for information pop up
22export default {
3- a : "A* pronounced A-Star was originally created in an attempt to create a general purpose robot as part of the Shakey\
3+ a : " ### A* Info\
4+ \nA* pronounced A-Star was originally created in an attempt to create a general purpose robot as part of the Shakey\
45 project in the 1960’s and 70’s. A* is a best-first search algorithm.\
56 \n### Runtime: \
67 \nThe time complexity is polynomial when the search space is a tree, there is a single goal state,\
@@ -11,25 +12,29 @@ export default {
1112 \n[The Coding Train (video part1)] (https://www.youtube.com/watch?v=aKYlikFAV4k&t=968s) \
1213 \n[Computerphile (video)] (https://www.youtube.com/watch?v=ySN5Wnu88nE )" ,
1314
14- BFS : "Breadth-First Search is a graph or tree traversing algorithm that looks at all nodes at the current level \
15+ BFS : "### BFS Info\
16+ \nBreadth-First Search is a graph or tree traversing algorithm that looks at all nodes at the current level \
1517 before moving onto the next deepest set of nodes. It was created by Konrad Zuse in 1945 and later reinvented by Edward F. Moore in 1959. \
1618 \n### Runtime:\
1719 \nO( | V | + | E |) where V is the number of nodes and E the number of edges.\
1820 \n### Helpful links: \
1921 \n[TheHippieCat (video)] (https://www.youtube.com/watch?v=WvR9voi0y2I)\
2022 \n[Nesbox (README)] (https://github.com/nesbox/TIC-80/wiki/Pathfinding%EA%9E%89-BFS-Algorithm)" ,
2123
22- DFS : "Depth-first search is a pathfinding or tree spanning algorithm that follows one branch to its deepest point before backtracking. \
24+ DFS : "### DFS Info\
25+ \nDepth-first search is a pathfinding or tree spanning algorithm that follows one branch to its deepest point before backtracking. \
2326 It was created in the 19th century by French mathematician Charles Pierre Trémaux. \
2427 \n### Runtime:\
2528 \nO( | V | + | E |) where V is the number of nodes and E the number of edges.\
2629 \n### Helpful links:\
2730 \n[Brilliant (articel)] (https://brilliant.org/wiki/depth-first-search-dfs)\
2831 \n[Go GATE IIT (video)](https://www.youtube.com/watch?v=iaBEKo5sM7w)" ,
2932
30- Djikstras : "Djikstra's shortest path first Algorithm is a pathfinding algorithm created by Edsger W. Djikstra in 1956. \
33+ Djikstras : "### Djikstra's Algorithm Info\
34+ \nDjikstra's shortest path first Algorithm is a pathfinding algorithm created by Edsger W. Djikstra in 1956. \
3135 It uses a min-priority queue to find the shortest path of a weighted graph. \
32- \n### Runtime: (Min-priority queue) O(| V | +| E |log| V |) (where | V | s the number of nodes and | E | is the number of edges)\
36+ \n### Runtime: \
37+ \n(Min-priority queue) O(| V | +| E |log| V |) (where | V | s the number of nodes and | E | is the number of edges)\
3338 \n(Array) O(V^2)\
3439 \n### Helpful links:\
3540 \n[Computerphile (video)](https://www.youtube.com/watch?v=GazC3A4OQTE)\
0 commit comments