check whether the subgraph of graph induced by the given vertices is complete , i.e. a clique . concode_field_sep Set<E> fillEdges concode_elem_sep LinkedList<V> meo concode_elem_sep List<V> generators concode_elem_sep Map<Set<V>,Integer> fullComponentCount concode_elem_sep Set<Set<V>> separators concode_elem_sep UndirectedGraph<V,E> graph concode_elem_sep UndirectedGraph<V,E> chordalGraph concode_elem_sep Set<Set<V>> atoms concode_field_sep Set<Set<V>> getAtoms concode_elem_sep UndirectedGraph<V,E> getGraph concode_elem_sep Set<E> getFillEdges concode_elem_sep LinkedList<V> getMeo concode_elem_sep UndirectedGraph<V,E> getMinimalTriangulation concode_elem_sep UndirectedGraph<V,E> copyAsSimpleGraph concode_elem_sep List<V> getGenerators concode_elem_sep V getMaxLabelVertex concode_elem_sep Set<Set<V>> getSeparators concode_elem_sep Map<Set<V>,Integer> getFullComponentCount concode_elem_sep void computeAtoms concode_elem_sep void addToReach concode_elem_sep void computeMinimalTriangulation concode_elem_sep boolean isChordal
boolean function ( UndirectedGraph < V , E > arg0 , Set < V > arg1 ) { for ( V loc0 : arg1 ) { for ( V loc1 : arg1 ) { if ( ( loc0 != loc1 ) && ( arg0 . getEdge ( loc0 , loc1 ) == null ) ) { return false ; } } } return true ; }