我想将以下图形数据存储在数据库中,
graph.makeEdge( "s", "c", "cost", (double) 7 );
graph.makeEdge( "c", "e", "cost", (double) 7 );
graph.makeEdge( "s", "a", "cost", (double) 2 );
graph.makeEdge( "a", "b", "cost", (double) 7 );
graph.makeEdge( "b", "e", "cost", (double) 2 );
然后从 Web servlet 运行 Dijskra 算法,以使用存储的图形数据查找最短路径计算。然后我将打印来自 servlet 的 html 文件的路径。
Dijkstra<Double> dijkstra = getDijkstra( graph, 0.0, "s", "e" );