import java.util.*;

class ListGraph<E extends Comparable<E>> implements Graph<E>{
	private Map<E,List<ListEdge<E>>> nodes = new TreeMap<E, List<ListEdge<E>>>();
	
	
	public void addNode(E node){
		if(!(nodes.get(node)==null)){
			return;
		}else{
			nodes.put(node, new ArrayList<ListEdge<E>>());
		}
	}//addNode
	
	public void connect(E from, E to, String name, int weight){
		List<ListEdge<E>> toList = nodes.get(to);
		List<ListEdge<E>> fromList = nodes.get(from);
		if(nodes.get(from)==null || nodes.get(to)==null){
			throw new NoSuchElementException("connect failure. node missing");
		}	
		for(ListEdge<E> tmp : fromList){
			if(tmp.getDest().toString().equals(to.toString())){
			throw new IllegalStateException("connect failure. connection already present");
			}
		}
		ListEdge<E> fromEdge = new ListEdge<E>(to, name, weight);
		fromList.add(fromEdge);
		ListEdge<E> toEdge = new ListEdge<E>(from, name, weight);		
		toList.add(toEdge);
	}//connect
	
	public Map<E,List<ListEdge<E>>> getNodes(){
		Map<E,List<ListEdge<E>>> temp = nodes;
		return temp;
	}//getNodes
	
	public List<ListEdge<E>> getEdgesFrom(E e){
		List<ListEdge<E>> tmp = nodes.get(e);
		return tmp;
	}//getEdgesFrom
	
	public ListEdge<E> getEdge(E e1, E e2){
		ListEdge<E> rtrn=null;
		if(nodes.get(e1)==null || nodes.get(e2)==null){
			throw new NoSuchElementException("getEdge failure. node missing");
		}
		for(ListEdge<E> cmp : nodes.get(e1)){
			if(cmp.getDest().compareTo(e2)==0){
				rtrn = cmp;
			}
		}
		return rtrn;
	}//getEdge
	public String getEdgeName(E e1, E e2){
		String rtrn=null;
		if(nodes.get(e1)==null || nodes.get(e2)==null){
			throw new NoSuchElementException("getEdgeName failure. node missing");
		}
		for(ListEdge<E> cmp : nodes.get(e1)){
			if(cmp.getDest().compareTo(e2)==0){
				rtrn = cmp.getName();
			}
		}
		return rtrn;
	}//getEdgeName
	
	public int getEdgeWeight(E e1, E e2){
		int rtrn=-1;
		if(nodes.get(e1)==null || nodes.get(e2)==null){
			throw new NoSuchElementException("getEdgeWeight failure. node missing");
		}
		for(ListEdge<E> cmp : nodes.get(e1)){
			if(cmp.getDest().compareTo(e2)==0){
				rtrn = cmp.getWeight();
			}
		}
		return rtrn;
	}//getEdgeWeight
	
	public void setEdgeWeight(E e1, E e2, int i){
		ListEdge<E> temp=null;
		boolean ok = false;
		if(nodes.get(e1)==null || nodes.get(e2)==null){
			throw new NoSuchElementException("setEdgeWeight failure. node missing");
		}
		if(i<0){
			throw new IllegalArgumentException("setEdgeWeight failure. int i < 0");
		}
			for(ListEdge<E> cmp : nodes.get(e1)){
				if(cmp.getDest().compareTo(e2)==0){
					cmp.setWeight(i);
					temp=cmp;
					for(ListEdge<E> cmp2 : nodes.get(e2)){
						if(cmp2.getDest().compareTo(e1)==0){
							cmp2.setWeight(i);
						}
					}//for
				}//if
			}//for	
		if(temp==null){
			throw new NoSuchElementException("setEdgeWeight failure. connection not present");
		}
	}//setEdgeWeight
	
	public String toString(){
		String temp = "";
		for(Map.Entry<E,List<ListEdge<E>>> entry : nodes.entrySet()){
			temp+="from "+entry.getKey()+": ";
			for(ListEdge<E> cmp : entry.getValue()){
				temp+=cmp.toString()+", ";
			}
			temp+="\n";
		}
		return temp;
	}//toString
}