👉 In the context of computer science, "proxysm" refers to a type of algorithm that is used for finding the shortest path between two nodes in an undirected graph. It is a variant of Dijkstra's algorithm, where instead of starting from the source node and going to all other possible intermediate nodes, it directly explores those nodes until it finds the desired shortest path. The term "proxysm" was coined by Peter Winkler in his 1980 paper titled "
