如果您确定结构是树(节点不能有多个父节点),则会按深度优先顺序列出节点:
public static List returnAllNodes(Node node){
List listOfNodes = new ArrayList();
addAllNodes(node, listOfNodes);
return listOfNodes;
}
private static void addAllNodes(Node node, List listOfNodes) {
if (node != null) {
listOfNodes.add(node);
List children = node.getChildren();
if (children != null) {
for (Node child: children) {
addAllNodes(child, listOfNodes);
}
}
}
}
如果节点可以有多个父节点,请将addAllNodes的第一行更改为:
if (node != null && !listOfNodes.contains(node)) {
广度优先算法如下:
public static List returnAllNodes(Node node){
List listOfNodes = new ArrayList();
if (node != null) {
listOfNodes.add(node);
for(int i = 0; i < listOfNodes.size(); ++i) {
Node n = listOfNodes.get(i);
List children = n.getChildren();
if (children != null) {
for (Node child: children) {
if (!listOfNodes.contains(child)) {
listOfNodes.add(child);
}
}
}
}
}
return listOfNodes;
}