# Constructing and Manipulating Graphs

Constructing and Manipulating Graphs

This Demonstration lets you create and manipulate any undirected and directed graphs (including even bidirectional arrows and loops).

This is facilitated by a range of edit and display options that you can select, such as "distance" (i.e., degree of separation).

You can drag the vertices and the connecting edges will follow. You can add and delete, even split and join vertices!

You can also let the system find the shortest path between two points or the shortest closed path containing a given edge.

Each vertex and edge can have its own color. Vertices are numbered automatically and can carry text labels.

As an application, you are asked to find nice embeddings of five cubic graphs.