This dissertation introduces an analytic approach to the problem of circuit network pattern recognition. The approach involves a two-stage methodology which is described in detail. Initially, a theoretical process is used to generate a bench mark, or yardstick, to which descriptions of form can be oriented; secondly, a link-by-link examination of circuit network structure is undertaken to determine each link's relationship to the bench mark. The graphs composing the bench mark have a continuous structural distribution, ranging from completely connected to rudimentary graphs. A comprehensive description of these graphs is presented, and several properties of the bench mark are examined and compared to those of known families of circuit graphs. It is argued that the bench mark introduced here is more flexible than other yardsticks because its generative process creates a continuous spectrum of graph structures. The internal link-by-link approach also allows comparisons to be made within the link structure of the empirical network and thus an intra-network examination of the network's pattern is possible. Such comparison aids in revealing trends within the link structure of a given empirical circuit network. Finally, an illustration of the application of the proposed approach is presented. Three road networks, all located in western Canada, are chosen as examples of empirical planar networks and the major airline network of Canada is used as a non-planar example. / Arts, Faculty of / Geography, Department of / Graduate