3 public class Subgraph {
8 public boolean existsNode(Node n) {
9 return nodes.contains(n);
12 public boolean existsBorder(Node b) {
13 return border.contains(b);
16 public boolean existsEdge(Edge e) {
17 return edges.contains(e);
20 public boolean addNode(Node n) {
24 public boolean addBorder(Node b) {
28 public void addEdge(Edge e) {
32 public LinkedList getNodes() {
36 public LinkedList getBorder() {
40 public LinkedList getEdges() {
50 public HashSet newBad(EdgeGraph mesh) {
51 HashSet ret = new HashSet();
52 for(Iterator iter = nodes.iterator(); iter.hasNext();) {
53 Node node = (Node)iter.next();
54 Element element = (Element)mesh.getNodeData(node);
62 private final LinkedList nodes = new LinkedList();
63 private final LinkedList border = new LinkedList();
64 private final LinkedList edges = new LinkedList();