/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/approximation/tests/ |
H A D | test_dominating_set.py | 10 graph = nx.Graph() 11 graph.add_edge(1, 2) 12 graph.add_edge(1, 5) 13 graph.add_edge(2, 3) 14 graph.add_edge(2, 5) 15 graph.add_edge(3, 4) 16 graph.add_edge(3, 6) 17 graph.add_edge(5, 6) 21 dom_set = apxa.min_weighted_dominating_set(graph) 23 neighbors = set(graph [all...] |
H A D | test_clique.py | 6 graph = nx.complete_graph(10) 7 i, cs = apxa.clique_removal(graph) 8 idens = nx.density(graph.subgraph(i)) 11 cdens = nx.density(graph.subgraph(clique)) 14 graph = nx.trivial_graph(nx.Graph()) 15 i, cs = apxa.clique_removal(graph) 16 idens = nx.density(graph.subgraph(i)) 20 cdens = nx.density(graph.subgraph(clique)) 23 graph = nx.barbell_graph(10, 5, nx.Graph()) 24 i, cs = apxa.clique_removal(graph) [all...] |
H A D | test_ramsey.py | 6 # this should only find the complete graph 7 graph = nx.complete_graph(10) 8 c, i = apxa.ramsey_R2(graph) 9 cdens = nx.density(graph.subgraph(c)) 11 idens = nx.density(graph.subgraph(i)) 14 # this trival graph has no cliques. should just find i-sets 15 graph = nx.trivial_graph(nx.Graph()) 16 c, i = apxa.ramsey_R2(graph) 17 cdens = nx.density(graph.subgraph(c)) 19 idens = nx.density(graph [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/tests/ |
H A D | test_swap.py | 6 graph = barabasi_albert_graph(200,1) 7 degrees = sorted(graph.degree().values()) 8 G = double_edge_swap(graph, 40) 9 assert_equal(degrees, sorted(graph.degree().values())) 12 graph = barabasi_albert_graph(200,1) 13 degrees = sorted(graph.degree().values()) 14 G = connected_double_edge_swap(graph, 40) 15 assert_true(is_connected(graph)) 16 assert_equal(degrees, sorted(graph.degree().values()))
|
H A D | test_matching.py | 12 """Empty graph""" 30 """Small graph""" 212 graph = nx.Graph() 213 graph.add_edge(0, 1) 214 graph.add_edge(0, 2) 215 graph.add_edge(0, 3) 216 graph.add_edge(0, 4) 217 graph.add_edge(0, 5) 218 graph.add_edge(1, 2) 219 matching = nx.maximal_matching(graph) [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/readwrite/json_graph/ |
H A D | adjacency.py | 20 G : NetworkX graph 52 data['graph'] = list(G.graph.items()) 69 """Return graph from adjacency data format. 74 Adjacency list formatted graph data 78 G : NetworkX graph 79 A NetworkX graph object 82 If True, and direction not specified in data, return a directed graph. 101 graph = nx.MultiGraph() 103 graph [all...] |
H A D | node_link.py | 19 G : NetworkX graph 51 data['graph'] = list(G.graph.items()) 64 """Return graph from node-link data format. 69 node-link formatted graph data 72 If True, and direction not specified in data, return a directed graph. 79 G : NetworkX graph 80 A NetworkX graph object 96 graph = nx.MultiGraph() 98 graph [all...] |
H A D | tree.py | 20 G : NetworkX graph 74 """Return graph from tree data format. 79 Tree formatted graph data 96 graph = nx.DiGraph() 100 graph.add_edge(parent, child) 106 graph.add_node(child,attr_dict=nodedata) 111 graph.add_node(root, attr_dict=nodedata) 113 return graph
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/approximation/ |
H A D | clique.py | 22 G : NetworkX graph 23 Undirected graph 28 The apx-maximum clique of the graph 32 A clique in an undirected graph G = (V, E) is a subset of the vertex set 38 A maximum clique is a clique of the largest possible size in a given graph. 39 The clique number `\omega(G)` of a graph G is the number of 53 raise ValueError("Expected NetworkX graph!") 55 # finding the maximum clique in a graph is equivalent to finding 56 # the independent set in the complementary graph 62 """ Repeatedly remove cliques from the graph [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/classes/ |
H A D | __init__.py | 1 from networkx.classes.graph import Graph
|
H A D | function.py | 1 """Functional interface to graph methods and assorted utilities. 24 """Return a copy of the graph nodes in a list.""" 28 """Return an iterator over the graph nodes.""" 60 """Return the number of nodes in the graph.""" 64 """Return the number of edges in the graph. """ 68 r"""Return the density of a graph. 86 The density is 0 for a graph without edges and 1 for a complete graph. 108 G : Networkx graph 109 A graph [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/readwrite/json_graph/tests/ |
H A D | test_serialize.py | 17 G.graph['foo']='bar' 18 G.graph[1]='one' 21 assert_equal(H.graph['foo'],'bar') 22 assert_equal(H.graph[1],'one') 34 assert_equal(H.graph['foo'],'bar') 35 assert_equal(H.graph[1],'one')
|
H A D | test_node_link.py | 17 G.graph[1]='one' 18 G.graph['foo']='bar' 21 assert_equal(H.graph['foo'],'bar') 27 assert_equal(H.graph['foo'],'bar') 28 assert_equal(H.graph[1],'one')
|
H A D | test_adjacency.py | 17 G.graph['foo']='bar' 18 G.graph[1]='one' 21 assert_equal(H.graph['foo'],'bar') 27 assert_equal(H.graph['foo'],'bar') 28 assert_equal(H.graph[1],'one')
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/readwrite/tests/ |
H A D | test_gpickle.py | 12 G.graph['number']=1 24 assert_equal(G.graph,Gin.graph)
|
H A D | test_pajek.py | 20 self.G.graph['name']='Tralala' 49 assert_equal(self.G.graph,Gin.graph)
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/classes/tests/ |
H A D | test_function.py | 61 assert_equal(G.graph,{}) 66 assert_equal(G.graph,{}) 145 graph = nx.complete_graph(100) 146 pop = random.sample(graph.nodes(), 1) 147 nbors = list(nx.neighbors(graph, pop[0])) 148 # should be all the other vertices in the graph 149 assert_equal(len(nbors), len(graph) - 1) 151 graph = nx.path_graph(100) 152 node = random.sample(graph.nodes(), 1)[0] 153 nbors = list(nx.neighbors(graph, nod [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/x86_64-w64-mingw32/32/bits/ |
H A D | ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/x86_64-w64-mingw32/bits/ |
H A D | ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/32/bits/ |
H A D | ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/bits/ |
H A D | ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/operators/ |
H A D | binary.py | 25 G,H : graph 26 A NetworkX graph 28 create_using : NetworkX graph 29 Use specified graph for result. Otherwise 37 Specify the name for the union graph 41 U : A union graph with the same type as G. 49 to the union graph. If a graph attribute is present in both 62 # rename graph to obtain disjoint node labels 63 def add_prefix(graph, prefi [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/drawing/ |
H A D | nx_agraph.py | 36 """Return a NetworkX Graph or DiGraph from a PyGraphviz graph. 41 A graph created with PyGraphviz 43 create_using : NetworkX graph class instance 44 The output is created using the given graph class instance 102 # add default attributes for graph, nodes, and edges 104 N.graph['graph']=dict(A.graph_attr) 105 N.graph['node']=dict(A.node_attr) 106 N.graph['edge']=dict(A.edge_attr) 110 """Return a pygraphviz graph fro [all...] |
/prebuilts/eclipse/maven/apache-maven-3.2.1/lib/ |
H A D | aether-util-0.9.0.M2.jar | ... org/eclipse/aether/util/graph/transformer/ org/eclipse/aether/util/graph/traverser/ org/eclipse/aether/util/graph/visitor/ org/eclipse/aether ... |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/operators/tests/ |
H A D | test_all.py | 10 g.graph['name'] = 'g' 13 h.graph['name'] = 'h' 14 h.graph['attr'] = 'attr' 18 j.graph['name'] = 'j' 19 j.graph['attr'] = 'attr' 25 graph, node = n 26 assert_equal( ghj.node[n], eval(graph).node[int(node)] ) 28 assert_equal(ghj.graph['attr'],'attr') 29 assert_equal(ghj.graph['name'],'j') # j graph attribute [all...] |