src/main/java/org/jboss/util/graph/Graph.java
public boolean insertBiEdge(Vertex<T> from, Vertex<T> to, int cost)
      throws IllegalArgumentException
   {
      return addEdge(from, to, cost) && addEdge(to, from, cost);
   }
public boolean insertBiEdge(Vertex<T> from, Vertex<T> to, int cost)
      throws IllegalArgumentException
   {
      return addEdge(from, to, cost) && addEdge(to, from, cost);
   }
public boolean insertBiEdge ( Vertex < T > from , Vertex < T > to , int cost ) throws IllegalArgumentException { return addEdge ( from , to , cost ) && addEdge ( to , from , cost ) ; }
Insert a bidirectional Edge<T> in the graph

@param from - the Edge<T> starting vertex
@param to - the Edge<T> ending vertex
@param cost - the Edge<T> weight/cost
@return true if edges between both nodes were added, false otherwise
@throws IllegalArgumentException if from/to are not verticies in
the graph
Insert a bidirectional Edge<T > in the graph