Package adt.graph

Examples of adt.graph.GraphNode

8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
import adt.graph.GraphNode;

public class Q003A_Clone_Graph_DFS {

  public static void main(String[] args) {
    GraphNode n0 = new GraphNode(0);
    GraphNode n1 = new GraphNode(1);
    GraphNode n2 = new GraphNode(2);
    GraphNode n3 = new GraphNode(3);
    GraphNode n4 = new GraphNode(4);
    GraphNode n5 = new GraphNode(5);
    GraphNode n6 = new GraphNode(6);
    GraphNode n7 = new GraphNode(7);
    GraphNode n8 = new GraphNode(8);
   
    n0.addNeighbors(new GraphNode[]{n1, n7});
    n1.addNeighbors(new GraphNode[]{n0, n2, n7});
    n2.addNeighbors(new GraphNode[]{n1, n3, n5, n8});
    n3.addNeighbors(new GraphNode[]{n2, n4, n5});
    n4.addNeighbors(new GraphNode[]{n3, n5});
    n5.addNeighbors(new GraphNode[]{n2, n3, n4, n6});
    n6.addNeighbors(new GraphNode[]{n5, n7, n8});
    n7.addNeighbors(new GraphNode[]{n0, n1, n6, n8});
    n8.addNeighbors(new GraphNode[]{n2, n6, n7});
   
    n0.printDFS();
   
    GraphNode copy1 = cloneGraph(n0, new HashMap<GraphNode, GraphNode>());
    copy1.printDFS();
   
    GraphNode copy2 = cloneGraph(n0);
    copy2.printDFS();
  }
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
  static GraphNode cloneGraph(GraphNode node, Map<GraphNode, GraphNode> map) {
    if (node == null) {
      return null;
    }
   
    GraphNode copy;
   
    // 如果这个节点还没被克隆，克隆它!
    if (!map.containsKey(node)) {
      copy = new GraphNode(node.index);
      map.put(node, copy);
    }
    else {
      copy = map.get(node);
    }
   
    for (int i = 0; i < node.neighbors.size(); i++) {
      GraphNode neighbor = node.neighbors.get(i);
     
      if (!map.containsKey(neighbor)) {
        cloneGraph(neighbor, map);
      }
     
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
   
    Stack<GraphNode> stack = new Stack<GraphNode>();
    stack.push(node);
   
    while (!stack.isEmpty()) {
      GraphNode curr = stack.pop();
      GraphNode copy;
     
      // 当前节点已经被克隆了
      if (map.containsKey(curr)) {
        copy = map.get(curr);
      }
      // 否则，克隆当前节点
      else {
        copy = new GraphNode(curr.index);
        map.put(curr, copy);
      }
     
      for (int i = 0; i < curr.neighbors.size(); i++) {
        GraphNode neighbor = curr.neighbors.get(i);
       
        if (!map.containsKey(neighbor)) {
          GraphNode neighbor_copy = new GraphNode(neighbor.index);
          map.put(neighbor, neighbor_copy);
          stack.push(neighbor);
        }
       
        copy.neighbors.add(map.get(neighbor));
View Full Code Here
TOP

Related Classes of adt.graph.GraphNode

  • problems.geeks.graph.Q003A_Clone_Graph_DFS
    • Copyright © 2018 www.massapicom. 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.