Algorithms
Dijkstra Algorithm
This is a paragraph! Here's how you make a link: Neocities.
1 function Dijkstra(Graph, source):
2 create vertex set Q
3 for each vertex v in Graph: // Initialization
4 dist[v] ← INFINITY // Unknown distance from source to v
5 prev[v] ← UNDEFINED // Previous node in optimal path from source
6 add v to Q // All nodes initially in Q (unvisited nodes)
7 dist[source] ← 0 // Distance from source to source
8 while Q is not empty:
9 u ← vertex in Q with min dist[u] // Node with the least distance
10 // will be selected first
15 remove u from Q
17 for each neighbor v of u: // where v is still in Q.
18 alt ← dist[u] + length(u, v)
19 if alt < dist[v]: // A shorter path to v has been found
20 dist[v] ← alt
21 prev[v] ← u
23 return dist[], prev[]
Binary Search
Here's how you can make bold and italic text.
Here's how you can add an image:
Here's how to make a list:
- First thing
- Second thing
- Third thing
To learn more HTML/CSS, check out these tutorials!