@Override public Iterable<Transition<E, V>> transitionsFrom(final V state) { ArrayList<Transition<E, V>> transitions = new ArrayList<Transition<E, V>>(); for(GraphEdge<V, E> edge : dg.outgoingEdgesOf(state)){ transitions.add(Transition.create(state, edge.getEdgeValue(), edge.getVertex2())); } Collections.sort(transitions, new ComparatorTransitions()); return transitions; } };
@Override public Iterable<Transition<E, V>> transitionsFrom(final V state) { ArrayList<Transition<E, V>> transitions = new ArrayList<Transition<E, V>>(); for(GraphEdge<V, E> edge : dg.outgoingEdgesOf(state)){ transitions.add(Transition.create(state, edge.getEdgeValue(), edge.getVertex2())); } return transitions; } };
@Override public Iterable<Transition<E, V>> transitionsFrom(final V state) { ArrayList<Transition<E, V>> transitions = new ArrayList<Transition<E, V>>(); for(GraphEdge<V, E> edge : dg.outgoingEdgesOf(state)){ transitions.add(Transition.create(state, edge.getEdgeValue(), edge.getVertex2())); } return transitions; } };