code stringlengths 3 6.57k |
|---|
GF(4) |
SemimonomialTransformationGroup(F, 3) |
an_element() |
doctest
(0, 0, 1) |
b.apply_map(a.get_autom() |
self.codomain() |
a.get_perm() |
action(b) |
b.pairwise_product(self.codomain() |
a.get_v_inverse() |
SemimonomialActionMat(Action) |
__init__(self, G, M, check=True) |
GF(4) |
SemimonomialTransformationGroup(F, 3) |
an_element() |
MatrixSpace(F, 3) |
one() |
isinstance(G, SemimonomialTransformationGroup) |
ValueError('%s is not a semimonomial group' % G) |
isinstance(M, MatrixSpace) |
ValueError('%s is not a matrix space' % M) |
M.ncols() |
G.degree() |
M.base_ring() |
G.base_ring() |
ValueError('%s and %s have different base rings' % (M, G) |
Action.__init__(self, G, M) |
_act_(self, a, b) |
GF(4) |
SemimonomialTransformationGroup(F, 3) |
an_element() |
MatrixSpace(F, 3) |
one() |
self.codomain() |
b.rows() |
termination_fn(obs, act, next_obs) |
np.array([False]) |
repeat(len(obs) |
Copyright (C) |
join(['Aric Hagberg (hagberg@lanl.gov) |
Swart (swart@lanl.gov) |
Schult(dschult@colgate.edu) |
DiGraph(Graph) |
multiple
(parallel) |
arbitrary (hashable) |
None (default) |
optional (default= no attributes) |
structure (a "null graph") |
nx.DiGraph() |
G.add_node(1) |
G.add_nodes_from([2,3]) |
G.add_nodes_from(range(100,110) |
nx.Graph() |
H.add_path([0,1,2,3,4,5,6,7,8,9]) |
G.add_nodes_from(H) |
object
(except None) |
G.add_node(H) |
G.add_edge(1, 2) |
G.add_edges_from([(1,2) |
G.add_edges_from(H.edges() |
dictionary (the keys must be hashable) |
nx.DiGraph(day="Friday") |
add_node() |
add_nodes_from() |
G.add_node(1, time='5pm') |
G.add_nodes_from([3], time='2pm') |
G.nodes(data=True) |
add_edge() |
add_edges_from() |
G.add_edge(1, 2, weight=4.7 ) |
G.add_edges_from([(3,4) |
G.add_edges_from([(1,2,{'color':'blue'}) |
len(G) |
adjacency_iter() |
edges() |
G.adjacency_iter() |
nbrsdict.items() |
G.edges(data='weight') |
nodes() |
edges() |
neighbors() |
degree() |
Subclasses (Advanced) |
dict (node_dict) |
dict (adjlist) |
dict (edge_attr) |
class(!) |
optional (default: dict) |
optional (default: dict) |
optional (default: dict) |
OrderedNodeGraph(nx.Graph) |
OrderedNodeGraph() |
G.add_nodes_from( (2,1) |
G.nodes() |
G.add_edges_from( ((2,2) |
G.edges() |
OrderedGraph(nx.Graph) |
OrderedGraph() |
G.add_nodes_from( (2,1) |
G.nodes() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.