1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16 package org.rblasch.convert.graph;
17
18 import java.util.Iterator;
19 import java.util.LinkedList;
20 import java.util.List;
21
22 public class ListPath implements Path {
23 private final List
24
25 public ListPath(final List
26 this.path = path;
27 }
28
29 public Vertex getStart() {
30 return (Vertex) path.get(0);
31 }
32
33 public Vertex getEnd() {
34 return (Vertex) path.get(path.size() - 1);
35 }
36
37 public List
38 final List
39 for (final Iterator i = path.iterator(); i.hasNext();) {
40 final Object n = i.next();
41 if (n instanceof Vertex) {
42 vertices.add(n);
43 }
44 }
45 return vertices;
46 }
47
48 public List
49 final List
50 for (final Iterator i = path.iterator(); i.hasNext();) {
51 final Object n = i.next();
52 if (n instanceof Edge) {
53 edges.add(n);
54 }
55 }
56 return edges;
57 }
58
59 public Iterator
60 return path.iterator();
61 }
62 }