Modular boundary models are a class of object representations that describe a solid object as a collection of face-abutting components. The face-to-face relationships between components are described in the form of a graph, called the connection graph. The paper addresses the problem of extracting adjacency information from a description of a solid object in terms of a modular boundary model, the FFC model. The encoding structure of the connection graph in such a model is described, and a set of structure-accessing algorithms for retrieving the adjacency relationships from the resulting data structure is defined. Finally, an extension to the connection graph to support instances is briefly presented, and the problems related to the development of adjacency-finding algorithms for such a structure are discussed.