private List reverse(List seq){
  LinkedList newSeq=new LinkedList();
  for (Iterator i=seq.iterator(); i.hasNext(); ) {
    DirectedEdge de=(DirectedEdge)i.next();
    newSeq.addFirst(de.getSym());
  }
  return newSeq;
}

private List reverse ( List seq ) { LinkedList newSeq = new LinkedList ( ) ; for ( Iterator i = seq . iterator ( ) ; i . hasNext ( ) ; ) { DirectedEdge de = ( DirectedEdge ) i . next ( ) ; newSeq . addFirst ( de . getSym ( ) ) ; } return newSeq ; }
reverse the sequence . this requires reversing the order of the diredges , and flipping each diredge as well
