def build_k33_graph():
graph = UndirectedGraph()<EOL>for _ in range(<NUM_LIT:1>, <NUM_LIT:7>):<EOL><INDENT>graph.new_node()<EOL><DEDENT>graph.new_edge(<NUM_LIT:1>, <NUM_LIT:4>)<EOL>graph.new_edge(<NUM_LIT:1>, <NUM_LIT:5>)<EOL>graph.new_edge(<NUM_LIT:1>, <NUM_LIT:6>)<EOL>graph.new_edge(<NUM_LIT:2>, <NUM_LIT:4>)<EOL>graph.new_edge(<NUM_LIT:2>, <NUM_LIT:5>)<EOL>graph.new_edge(<NUM_LIT:2>, <NUM_LIT:6>)<EOL>graph.new_edge(<NUM_LIT:3>, <NUM_LIT:4>)<EOL>graph.new_edge(<NUM_LIT:3>, <NUM_LIT:5>)<EOL>graph.new_edge(<NUM_LIT:3>, <NUM_LIT:6>)<EOL>return graph<EOL>
Makes a new K3,3 graph.
       Ref: http://mathworld.wolfram.com/UtilityGraph.html