Problem med en metod.

Hej, lyckas ej med denna metod vi har fått ett gäng klasser i en uppgift vi ej skall göra något med och byggt en klass Route och i klassen ListGraph har vi fått alla metoder vi skall bygga.

Nu har vi kört fast på en metod och suttit ett par timmar :) 

//Klassen Route


package se.su.inlupp;

import java.util.*;

public class Route<T> implements Edge<T>{
private String name;
private int weight;
private T destination;

public Route(String name, int weight, T destination) {
    this.destination = Objects.requireNonNull(destination);
    this.name = Objects.requireNonNull(name);

    if(Double.isNaN(weight)){
        throw new IllegalArgumentException();
    }
    this.weight = weight;

}
@Override
public T getDestination(){
    return destination;
    }
@Override
public int getWeight(){
    return weight;
}
@Override
public void setWeight(int weight){
    if(weight <0){
        throw new IllegalArgumentException(" Weight cannot be negative");
    }
    this.weight = weight;
}
@Override
public String getName(){
    return name;
}
@Override
public String toString(){
    return "Edge[destination=" + destination + ", name=" + name + " weight=" + weight + "]";
}
}



//Klassen ListGraph

package se.su.inlupp;

import java.util.*;

public class ListGraph<T> implements Graph<T> {

  private Map<T, Set<Route>> places = new HashMap<>();





  public void add(T node) {
    places.putIfAbsent(node, new HashSet<>());
  }


  public void connect(T node1, T node2, String name, int weight) {

    if(!places.containsKey(node1) || !places.containsKey(node2) ) {
      throw new NoSuchElementException();
    }
    if(weight <0){
      throw new IllegalArgumentException();
    }


    add(node1);
    add(node2);

    Set<Route> fromPlaces = places.get(node1);
    Set<Route> toPlaces = places.get(node2);

    //Kontrollera om en kant redan finns från node1 till node2 eller från node2 till node1
    for(Route route : toPlaces) {
      if(route.getDestination().equals(node1)) {
        throw new IllegalStateException();
      }
    }
    fromPlaces.add(new Route(name, weight, node2));
    toPlaces.add(new Route(name, weight, node1));

  }


  public void setConnectionWeight(T node1, T node2, int weight) {
    if(weight <0){
      throw new IllegalArgumentException();
    }
    if(!places.containsKey(node1) || !places.containsKey(node2) ) {
      throw new NoSuchElementException();
    }

    Set<Route> fromPlaces = places.get(node1);
    Set<Route> toPlaces = places.get(node2);
    boolean ran = false;

    for(Route route : toPlaces){
      if (route.getDestination().equals(node1)){
        route.setWeight(weight);
        ran = true;
      }

    }

    for(Route route : fromPlaces) {
      if (route.getDestination().equals(node2)) {
        route.setWeight(weight);
        ran = true;
      }
      if (!ran) {
        throw new NoSuchElementException();
      }
    }

  }


  public Set<T> getNodes(){
    return places.keySet();
  }

  @Override
  public Collection<Edge<T>> getEdgesFrom(T node) {
    if(!places.containsKey(node)) {
      throw new NoSuchElementException();
    }
    Set<Edge<T>> edges = new HashSet<>();
    Set<Route> fromPlaces = places.get(node);

    for(Edge<T> route : fromPlaces){
      if(route.getDestination().equals(node)){
        edges.add(route);
      }
    }
    return edges;
  }


  public Route<T> getEdgeBetween(T node1, T node2) {

    Set<Route> fromPlaces = places.get(node1);
    Set<Route> toPlaces = places.get(node2);

    if(!places.containsKey(node1) || !places.containsKey(node2)) {
      throw new NoSuchElementException();
    }
    for (Route route : toPlaces) {
      if (route.getDestination().equals(node1)) {
        return route;
      }
    }
    return null;
  }


  public void disconnect(T node1, T node2) {
    if(!places.containsKey(node1) || !places.containsKey(node2) ) {
      throw new NoSuchElementException();
    }
    Set<Route> fromPlaces = places.get(node1);
    Set<Route> toPlaces = places.get(node2);

    if(getEdgeBetween(node1, node2) != null) {
      for(Route route : fromPlaces){
        if(route.getDestination().equals(node1)){
          fromPlaces.remove(route);
          break;
        }
      }
      for(Route route : toPlaces){
        if(route.getDestination().equals(node2)){
          toPlaces.remove(route);
          break;
        }
      }
      for(Route route : fromPlaces){
        if(route.getDestination().equals(node2)){
          fromPlaces.remove(route);
          break;
        }
      }
      for(Route route : toPlaces){
        if(route.getDestination().equals(node1)){
          toPlaces.remove(route);
          break;
        }
      }
    }
    else{
      throw new IllegalStateException();
    }
  }


  public void remove(T node) {
    if(!places.containsKey(node)) {
      throw new NoSuchElementException();
    }

    places.remove(node);
  }


  public boolean pathExists(T from, T to) {
    throw new UnsupportedOperationException("Unimplemented method 'pathExists'");
  }


  public List<Edge<T>> getPath(T from, T to) {
    throw new UnsupportedOperationException("Unimplemented method 'getPath'");
  }

}

//Metoden i ListGraph vi ej får att fungera


 @Override
  public Collection<Edge<T>> getEdgesFrom(T node) {
    if(!places.containsKey(node)) {
      throw new NoSuchElementException();
    }
    Set<Edge<T>> edges = new HashSet<>();
    Set<Route> fromPlaces = places.get(node);

    for(Edge<T> route : fromPlaces){
      if(route.getDestination().equals(node)){
        edges.add(route);
      }
    }
    return edges;
  }


//Felmeddelandet vi får när vi kör tester

[ERROR]   GraphTest.test09_getEdgesFrom_existing_node_with_edges:244 expected: <2> but was: <0>

Tacksam för hjälp tack!