In this paper we present a new linear algorithm for finding the biconn
ected components of an undirected simple graph. The presentation of th
is algorithm is done as an exercise in the use of modem principles and
techniques for systematic development of algorithms.