def build_petersons_graph():
graph = build_5_cycle_graph()<EOL>for _ in range(<NUM_LIT:5>):<EOL><INDENT>graph.new_node()<EOL><DEDENT>graph.new_edge(<NUM_LIT:6>, <NUM_LIT:8>)<EOL>graph.new_edge(<NUM_LIT:6>, <NUM_LIT:9>)<EOL>graph.new_edge(<NUM_LIT:7>, <NUM_LIT:9>)<EOL>graph.new_edge(<NUM_LIT:7>, <NUM_LIT:10>)<EOL>graph.new_edge(<NUM_LIT:8>, <NUM_LIT:10>)<EOL>graph.new_edge(<NUM_LIT:1>, <NUM_LIT:6>)<EOL>graph.new_edge(<NUM_LIT:2>, <NUM_LIT:7>)<EOL>graph.new_edge(<NUM_LIT:3>, <NUM_LIT:8>)<EOL>graph.new_edge(<NUM_LIT:4>, <NUM_LIT:9>)<EOL>graph.new_edge(<NUM_LIT:5>, <NUM_LIT:10>)<EOL>return graph<EOL>
Builds a non-planar test graph that does not contain K5 or K3,3 as a subgraph (Peterson's Graph).
       Ref: http://mathworld.wolfram.com/PetersenGraph.html