public static Graph randomGraphUniform(int numNodes,int numLatentConfounders,int maxNumEdges,int maxDegree,int maxIndegree,int maxOutdegree,boolean connected){
  List<Node> nodes=new ArrayList<>();
  for (int i=0; i < numNodes; i++) {
    nodes.add(new GraphNode("X" + (i + 1)));
  }
  return randomGraphUniform(nodes,numLatentConfounders,maxNumEdges,maxDegree,maxIndegree,maxOutdegree,connected);
}

public static Graph randomGraphUniform ( int numNodes , int numLatentConfounders , int maxNumEdges , int maxDegree , int maxIndegree , int maxOutdegree , boolean connected ) { List < Node > nodes = new ArrayList < > ( ) ; for ( int i = 0 ; i < numNodes ; i ++ ) { nodes . add ( new GraphNode ( "X" + ( i + 1 ) ) ) ; } return randomGraphUniform ( nodes , numLatentConfounders , maxNumEdges , maxDegree , maxIndegree , maxOutdegree , connected ) ; }
implements the method in melancon and dutour , " random generation of directed graphs , " with optional biases added .
