Examples of BFS

Examples of org.patika.mada.algorithm.BFS

73
74
75
76
77
78
79
80
81
82
83
84
85
        selectedNodes.add(node);
      }
    }

    BFS bfs = new BFS(selectedNodes, null, false, 1);

    Map<GraphObject, Integer> map = bfs.run();

    for (GraphObject go : map.keySet())
    {
      go.setHighlight(true);
    }
View Full Code Here

Examples of progs.lib.BFS

33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
        "   ",
        "   ",
        "   ",
    };
    Graph graph = Graph.fromStringArray(array);
    Assert.assertEquals(2, new BFS(graph).distanceFrom(new Node(0, 0), new Node(2, 2)));
    Assert.assertEquals(2, new BFS(graph).distanceFrom(new Node(0, 0), new Node(0, 2)));
    array = new String[]{
        " ",
        "#",
        " "};
    graph = Graph.fromStringArray(array);
    Assert.assertEquals(10 /*graph size = 3; so 3 * 3 + 1*/,
        new BFS(graph).distanceFrom(new Node(0, 0), new Node(2, 0)));
  }
View Full Code Here

Examples of progs.lib.BFS

53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
  static class Solution {
    public Node solveFor(String[] room) {
      Graph graph = Graph.fromStringArray(room);
      List<Node> specialNodes = graph.getSpecialNodes();
      Set<Node> nodes = graph.getAllNodes();
      BFS bfs = new BFS(graph);
      int previousMinDistance = Integer.MAX_VALUE;
      Node bestNodeSoFar = null;
      for (Node node : nodes) {
        if (specialNodes.contains(node)) {
          continue;
        }
        int localDistance = 0;
        for (Node stationNode : specialNodes) {
          localDistance += bfs.distanceFrom(stationNode, node);
        }
        if (localDistance < previousMinDistance) {
          previousMinDistance = localDistance;
          bestNodeSoFar = node;
        }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.