references to the element objects the reason this structure is called the edge list structure is that the simplest and most common implementation of the edge collection is with list even soin order to be able to conveniently search for specific objects associated with edgeswe may wish to implement with dictionary (whose entries store the element as the key and the edge as the valuein spite of our calling this the "edge list we may also wish to implement the collection as dictionary for the same reason stillin keeping with traditionwe call this structure the edge list structure