\manpage {graph\_misc} {} { Miscellaneous Graph Functions} 
 
\func  bool Is\_Bidirected {( graph\ G, \ edge\_array\<edge\>\&\ rev)}
           {  computes for every edge $e = (v,w)$ in $G$ its
		reversal $rev[e] = (w,v)$ in $G$ ( nil if
		not present). Returns true if every edge has a
		reversal and false otherwise.  }
 
 
\func  bool Is\_Simple {(graph\&\ G)}
           {  returns true if $G$ is simple, i.e., has no parallel
           edges.  }
 
 
\func  void Make\_Simple {(graph\&\ G)}
           {  makes $G$ simple by removing one of each pair of
           parallel edges from $G$.  }
 
 
