Code example for SortedSet

Methods: contains

0
            if (!(graph.containsKey(from) && graph.containsKey(to)))
            { 
                throw new NoSuchElementException("Missing nodes from graph");
            } 
 
            return graph.get(from).contains(to);
        } 
 
        public Set<T> edgesFrom(T from)
        { 
            if (!graph.containsKey(from))
            { 
                throw new NoSuchElementException("Missing node from graph");
            } 
 
            return Collections.unmodifiableSortedSet(graph.get(from));
        } 
        @Override 
        public Iterator<T> iterator()
        { 
Contextual code suggestions in your IDE  Get Codota for Java