An uncertain graph is a simple graphs whose edges (solid lines) and nonedges (dashed lines) are defined while their union is not necessarily the complete graph. All the remaining edges are considered as "uncertain" (gray lines).
The motivation of building this page is from the study of forbidden graph structures, in which we sequentially determine the uncertain edges to be an edge or an nonedge. I hope this project will make the future research easier, including the drawing and the data input, so that I can make some contribution in return to many kind people I met in University of Victoria and Simon Fraser University.
The JavaScript source code of this page is built on Radoslav Kirov's JavaScript Graph Editor. Many thanks to the author and the contributors of the JS Graph Editor project.
Use the sage code here to translate between JSON data and Sage UncertainGraph.
Input from Sage: run graph_to_JSON and copy the output below.
Output to Sage: Copy the JSON data below to Sage and run JSON_to_graph.