Abstract. This paper discusses the steps of constructing simple graphs on graph theory application development. Most graphs constructing on application development use an adjacency matrix and an adjacency list before the graph is constructed. However, it is considerably difficult to construct a graph in such way. The steps of constructing a graph in this work were started by directly construct a graph on stage. The graph was constructed by creating the vertices and every edge can be created after creating two vertices as its endpoint. The graphs can be changed by moving the vertex and deleting vertices and edges. Furthermore, the graph can be changed by adding vertices and edges. The adjacency list is then obtained from the given graph and used for further processes. The steps of constructing graph are interactive so that constructing graph can be made easier and more efficient.

No abstract