Implement the algorithm to solve the chinese postman problem in directed graphs.

Chinese_Postman\.classpath
...............\.project
...............\.umlproject
...............\bin
...............\Chinese_Postman.uml
...............\CPP_ClassDiagram.ucd
...............\Library
...............\.......\junit-4.7.jar
...............\Random_Graph_10000_Edges_1.txt
...............\src
...............\...\cpp_package
...............\...\...........\CPP.java
...............\...\...........\Edge.java
...............\...\...........\exceptions
...............\...\...........\..........\InvalidDataException.java
...............\...\...........\..........\LoopException.java
...............\...\...........\..........\NegativeEdgeException.java
...............\...\...........\..........\WeakConnectivityException.java
...............\...\...........\Graph.java
...............\...\...........\Node.java
...............\...\...........\ShortestWay.java
...............\...\...........\test
...............\...\...........\....\CPPTest.java
...............\...\...........\....\GraphTest.java
...............\...\...........\....\GraphTestEuler.java
...............\...\...........\....\GraphTestInput.java
...............\...\...........\....\GraphTestShortestWay.java
...............\...\...........\....\NumericalRecipesRandom.java
...............\...\...........\....\PerformanceTest.java
...............\...\...........\....\RandomGraph.java
...............\...\...........\....\Stopwatch.java
...............\...\Testcase
...............\...\........\dead_end_graph.txt
...............\...\........\disconnected_graph.txt
...............\...\........\invalid_edge_graph.txt
...............\...\........\isolated_node_graph.txt
...............\...\........\loop_graph.txt
...............\...\........\negative_edge_graph.txt
...............\...\........\unreached_node_graph.txt
...............\...\........\valid_euler_graph_1.txt
...............\...\........\valid_euler_graph_2.txt
...............\...\........\valid_euler_graph_3.txt
...............\...\........\valid_notEuler_graph.txt
...............\...\........\valid_notEuler_graph_1.txt
...............\Testcase
...............\........\dead_end_graph.txt
...............\........\disconnected_graph.txt
...............\........\invalid_edge_graph.txt
...............\........\isolated_node_graph.txt
...............\........\loop_graph.txt
...............\........\negative_edge_graph.txt
...............\........\shortest_way_1.txt
...............\........\shortest_way_2.txt
...............\........\unreached_node_graph.txt
...............\........\valid_euler_graph_1.jpg
...............\........\valid_euler_graph_1.txt
...............\........\valid_euler_graph_2.txt
...............\........\valid_euler_graph_3.txt
...............\........\valid_euler_graph_4.txt
...............\........\valid_notEuler_graph_1.jpg
...............\........\valid_notEuler_graph_1.txt
...............\........\valid_notEuler_graph_1_output
...............\........\valid_notEuler_graph_1_output.jpg
...............\........\valid_notEuler_graph_1_output_new
...............\........\valid_notEuler_graph_2.jpg
...............\........\valid_notEuler_graph_2.txt
...............\........\valid_notEuler_graph_3.jpg
...............\........\valid_notEuler_graph_3.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．