Shortest in the BFS, Dijkstra algorithm. Better network algorithm calculates a path for network problems to achieve efficient allocation of resources of great value. Title is: Given a weighted directed graph G (V, E), V is the set of vertices, E is set to have the edge, each side has to have a weight. For a given vertex s, t, and V subset V , looking s to t acyclic directed path P, such that P through V in all vertices (elapsed V nodes in order not to Claim). If there is a directed path P, the output is no solution, the shorter the time the program runs, the more the result is considered excellent if there is a directed path P, the resulting output path, the path of the right weight is smaller, it is considered more excellent results in the output path weight the same premise, the shorter the time the program runs, the more the result is considered excellent.

Test
....\.classpath
....\.project
....\.settings
....\.........\org.eclipse.core.resources.prefs
....\.........\org.eclipse.jdt.core.prefs
....\a.csv
....\b.csv
....\bin
....\...\deal
....\...\....\CrateModel.class
....\...\....\ProcessModel.class
....\...\....\ProcessResultSet.class
....\...\entity
....\...\......\Edage.class
....\...\......\Model.class
....\...\......\Result.class
....\...\......\Rule.class
....\...\......\Vertex.class
....\...\main
....\...\....\Main.class
....\...\util
....\...\....\FileUtil.class
....\src
....\...\deal
....\...\....\CrateModel.java
....\...\....\ProcessModel.java
....\...\....\ProcessResultSet.java
....\...\entity
....\...\......\Edage.java
....\...\......\Model.java
....\...\......\Result.java
....\...\......\Rule.java
....\...\......\Vertex.java
....\...\main
....\...\....\Main.java
....\...\util
....\...\....\FileUtil.java

• 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．