Mini-indexes for literate programs
Programming Languages
2008-02-03 v1
Abstract
This paper describes how to implement a documentation technique that helps readers to understand large programs or collections of programs, by providing local indexes to all identifiers that are visible on every two-page spread. A detailed example is given for a program that finds all Hamiltonian circuits in an undirected graph.
Cite
@article{arxiv.cs/9401102,
title = {Mini-indexes for literate programs},
author = {Donald E. Knuth},
journal= {arXiv preprint arXiv:cs/9401102},
year = {2008}
}