Searched refs:Edge (Results 1 - 5 of 5) sorted by relevance

/ec/ECSpooler/backends/junit/junit_libs/
H A DWeightedGraph.java6 protected class Edge { class in class:WeightedGraph
11 protected Edge(GraphNode d, double c) { method in class:WeightedGraph.Edge
36 private List<Edge> edges = new LinkedList<Edge>();
38 public List<Edge> getEdges() {
44 this.edges = new LinkedList<Edge>();
49 for (Edge n : edges)
116 protected Edge getEdge(GraphNode node, String label) {
117 for (Edge e : node.getEdges()) {
142 for (Edge e
[all...]
H A DGraphOriginal.java29 * GraphOriginal auf Edge zugreifen koennen.
31 protected class Edge { class in class:GraphOriginal
35 public Edge(int d, int c) { method in class:GraphOriginal.Edge
46 * @see Edge Kommentar
60 * @see Edge Kommentar
78 protected List<List<Edge>> nodes;
86 * Wir definieren nun, dass eine ArrayList unbestimmte List-Instanzen mit Edge-Objekten haelt.
90 * "generelle List-Instanz von einer generellen List-Instanz von Edge-Objekten" ist.
93 * nodes.add(new LinkedList<Edge>());
94 * nodes.add(new ArrayList<Edge>());
[all...]
H A DGraphOriginal2.java17 protected class Edge { class in class:GraphOriginal2
21 public Edge(int d, int c) { method in class:GraphOriginal2.Edge
53 protected List<List<Edge>> nodes;
57 nodes = new ArrayList<List<Edge>>();
67 nodes.add(new ArrayList<Edge>());
80 nodes.get(getNodeID(src)).add((new Edge(getNodeID(dest), cost)));
96 for (Edge e : nodes.get(u)) {
127 for (Edge e : nodes.get(nr)) {
144 for (Edge edge : nodes.get(nodeID)) {
157 for (Edge
[all...]
H A Djdsl.jarMETA-INF/ META-INF/MANIFEST.MF jdsl/core/algo/sorts/ArrayMergeSort.class ArrayMergeSort.java ...
/ec/ECSpooler/backends/sql/lib/
H A Ddbunit-2.4.8.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/dbunit/ org/dbunit/ant/ org/dbunit/assertion/ org/ ...

Completed in 18 milliseconds