- package om.eshore.sweetop.minpath;
- public class BellmanFord extends Graphics {
- public BellmanFord(Vertex...vs){
- for (Vertex v : vs) {
- list.add(v);
- }
- }
- @Override
- public boolean minPath(Vertex v) {
- initSingleSource(v);
- for (int i = 0; i < list.size() - 1; i++) {
- for (Vertex u : list) {
- for (Vertex w : u.getV()) {
- this.relax(u, w);
- }
- }
- }
- for (Vertex u : list) {
- for (Vertex w : u.getV()) {
- if (w.getD() > u.getD() + u.weight(w)) {
- return false;
- }
- }
- }
- return true;
- }
- }
单源最短路径(二)————BellmanFord算法
最新推荐文章于 2022-05-22 18:38:01 发布