This chapter discusses frequently used graph-theoretical algorithms, with emphasis on those algorithms that are relevant to the text-processing applications addressed in Parts III and IV. The chapter covers graph-traversal, including depth-first and breadth-first strategies, minimum path length, and minimum spanning trees; flow-on graphs, including algorithms for mincut/max-flow; graph matching; random walks, with harmonic functions and electrical networks; and linear algebra on graphs.