graph.zip

package common.subject1; import java.util.ArrayList; import java.util.List; public class App1 { // node number public static int nodeNum = 6; public static Node[] data = new Node[nodeNum]; public static void main(String[] args) { initData(); Queue computeQueue = new Queue(nodeNum); List<String> resultQueue = new ArrayList<>(nodeNum); for (Node node : data) { if (listIsEmpty(node.getPreNames())) computeQueue.add(node); } while (!computeQueue.isEmpty() && resultQueue.size() != nodeNum) { Node node = computeQueue.poll(); if (listIsEmpty(node.getPreNames())) { resultQueue.add(node.getName()); } if (listIsEmpty(node.getNextNames())) { continue; } for (String name : node.getNextNames()) { Node nodeByName = findNodeByName(name); if (nodeByName == null) { continue; } nodeByName.removePreNode(node.getName()); if (listIsEmpty(nodeByName.getPreNames())) { computeQueue.add(nodeByName); } } } printf(resultQueue); } public static void printf(List<String> list){ for (int i = 0; i < list.size(); i++) { if (i == list.size() - 1) { System.out.print(list.get(i)); }else { System.out.print(list.get(i) + " => "); } } } public static boolean listIsEmpty(List list){ return list == null || list.size() == 0; } public static Node findNodeByName(String name){ for (Node node : data) { if (name.equals(node.getName())) return node; } return null; } public static Node[] initData(){ int index = 0; // template // data[index++] = new Node("", "", ""); data[index++] = new Node("A", null,"C,D"); data[index++] = new Node("B", "C","E"); data[index++] = new Node("C", "A","B,F"); data[index++] = new Node("D", "A,E,F",null); data[index++] = new Node("E", "B,F","D" ); data[index++] = new Node("F", "C","D,E"); // data[index++] = new Node("1", null, "2,3"); // data[index++] = new Node("2", "1", "3,5"); // data[index++] = new Node("3", "1,2", "4,6"); // data[index++] = new Node("4", "3", "5"); // data[index++] = new Node("5", "2,4,6", null); // data[index++] = new Node("6", "3", "5"); return data; } }