1 public class Subgraph {
3 private final LinkedList nodes = new LinkedList();
4 private final LinkedList border = new LinkedList();
5 private final LinkedList edges = new LinkedList();
10 public boolean existsNode(Node n) {
11 return nodes.contains(n);
14 public boolean existsBorder(Node b) {
15 return border.contains(b);
18 public boolean existsEdge(Edge_d e) {
19 return edges.contains(e);
22 public void addNode(Node n) {
26 public void addBorder(Node b) {
30 public void addEdge(Edge_d e) {
34 public LinkedList getNodes() {
38 public LinkedList getBorder() {
42 public LinkedList getEdges() {
53 public boolean allNodesStillInCompleteGraph() {
54 for( Iterator i = nodes.iterator(); i.hasNext(); ) {
55 Node node = (Node) i.next();
63 public HashSet newBad(EdgeGraph mesh) {
64 HashSet ret = new HashSet();
65 for (Iterator iter = nodes.iterator(); iter.hasNext();) {
66 Node node = (Node) iter.next();
67 Element element = (Element) mesh.getNodeData(node);