List < Node > function ( Node arg0 ) { if ( ! pc . containsKey ( arg0 ) ) { pc . put ( arg0 , mmpc ( arg0 ) ) ; } if ( symmetric && ! trimmed . contains ( arg0 ) ) { trimPc ( arg0 ) ; trimmed . add ( arg0 ) ; } return pc . get ( arg0 ) ; }
returns a supserset of pc , or , if the symmetric algorithm is used , pc . concode_field_sep int numIndTests concode_elem_sep Node node concode_elem_sep List<Node> variables concode_elem_sep int depth concode_elem_sep Map<Node,List<Node>> pc concode_elem_sep boolean symmetric concode_elem_sep IndependenceTest independenceTest concode_elem_sep List<Node> assocSet concode_elem_sep Set<Node> trimmed concode_elem_sep Graph graph concode_field_sep List<Node> mmpc concode_elem_sep int getNumIndependenceTests concode_elem_sep List<Node> getAssocSet concode_elem_sep List<Node> mmmb concode_elem_sep List<Node> findMb concode_elem_sep MaxMinAssocResult maxMinAssoc concode_elem_sep double association concode_elem_sep Node getVariableForName concode_elem_sep List<Node> minAssoc concode_elem_sep String getAlgorithmName concode_elem_sep Node getNode concode_elem_sep void trimPc concode_elem_sep void backwardsConditioning