@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 : graph.edgesOf(state)){ V oppositeVertex = edge.getVertex1().equals(state) ? edge.getVertex2() : edge.getVertex1(); transitions.add(Transition.create(state, edge.getEdgeValue(), oppositeVertex)); } 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 : graph.edgesOf(state)){ V oppositeVertex = edge.getVertex1().equals(state) ? edge.getVertex2() : edge.getVertex1(); transitions.add(Transition.create(state, edge.getEdgeValue(), oppositeVertex)); } 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 : graph.edgesOf(state)){ V oppositeVertex = edge.getVertex1().equals(state) ? edge.getVertex2() : edge.getVertex1(); transitions.add(Transition.create(state, edge.getEdgeValue(), oppositeVertex)); } return transitions; } };