The original INTERCAL-72 compiler source code, as both scans and transcriptions, has been rediscovered and is now available. The article details the history of INTERCAL, its influence on esolangs, and the process of getting the original compiler running on a modern system.
After constructing the graph to model the repository, it is amenable to standard graph algorithms. For this approach, we’ll turn to a popular algorithm for identifying the “key” elements of a graph called betweenness centrality. This algorithm assigns an integer score to each vertex; the higher the score, the more “central” the vertex. A vertex score is incremented if it falls on the shortest path between any two other vertices in the graph.
