def FsAll(n, p): global seed, type G, graph, GA = mg.gph(n, p, seed, type) ccs, accs = mtcs.CCs(G) points, bridges = mtcs.pointsBridges(G) degree = mtcs.nodeDegree(G) return ccs, accs, points, bridges, degree, graph
def Fs(n, p): global seed, type G, graph, GA = mg.gph(n, p, seed, type) scc, scci = sccg.tarjan(G) size = 0 for s in scc: size += len(s) size /= len(scc) return len(scc), size, sccg.averange(GA, scci), graph
def FsTT(n, p): global seed, type G, graph, GA = mg.gph(n, p, seed, type) triangles, triplets = mtcs.figure(G, 3), mtcs.triplets(G) return triangles, triplets, graph
def FsPoints(n, p): global seed, type G, graph, GA = mg.gph(n, p, seed, type) points, bridges = mtcs.pointsBridges(G) return points
def FsACCs(n, p): global seed, type G, graph, GA = mg.gph(n, p, seed, type) ccs, accs = mtcs.CCs(G) return accs