Anvilcraft/equivalent-exchange-3
3
1
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

Again, for more review

Browse source
This commit is contained in:
pahimar 2013-05-29 14:00:06 -04:00
parent 4bd9ae52f2
commit 12e80773ed
1 changed files with 18 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
ee3_common/com/pahimar/ee3/emc/graph/WeightedDirectedGraph.java
View file

@ -10,7 +10,7 @@ import java.util.NoSuchElementException;
import java.util.SortedSet;
import java.util.TreeSet;
public class WeightedDirectedGraph<T, E> implements Iterable<T> {
public class WeightedDirectedGraph<T, E extends WeightedEdge<T>> implements Iterable<T> {
private final Map<T, SortedSet<E>> graph = new HashMap<T, SortedSet<E>>();
private List<T> orderedNodes = new ArrayList<T>();
@ -39,8 +39,24 @@ public class WeightedDirectedGraph<T, E> implements Iterable<T> {
{
throw new NoSuchElementException("Missing nodes from graph");
}
@SuppressWarnings("unchecked")
E edge = (E) new WeightedEdge<T>(1, to);
//graph.get(from).add((E) to);
graph.get(from).add(edge);
}
public void addEdge(T from, T to, int weight)
{
if (!(graph.containsKey(from) && graph.containsKey(to)))
{
throw new NoSuchElementException("Missing nodes from graph");
}
@SuppressWarnings("unchecked")
E edge = (E) new WeightedEdge<T>(weight, to);
graph.get(from).add(edge);
}
@Override