Circular dependency and graphs

Should circular dependency be avoided on graphs ?

For instance, consideer a graph class embedding an array of vertex objects, each of them having an array of edge objects which point to a vertex.

Here, vertex and edge are circularly dependent. Is this a bad idea ? Should it and how could it be avoided ?