code stringlengths 3 6.57k |
|---|
zip(range(0,3) |
range(1,4) |
G.add_edges_from(e) |
G.add_edges_from([(1,2) |
G.add_edges_from([(3,4) |
attr_dict.update(attr) |
len(e) |
hasattr(dd,"update") |
self.adjlist_dict_factory() |
self.adjlist_dict_factory() |
self.adjlist_dict_factory() |
self.adjlist_dict_factory() |
get(v,self.edge_attr_dict_factory() |
datadict.update(attr_dict) |
datadict.update(dd) |
remove_edge(self, u, v) |
nx.Graph() |
G.add_path([0,1,2,3]) |
G.remove_edge(0,1) |
G.remove_edge(*e) |
G.remove_edge(*e[:2]) |
NetworkXError("The edge %s-%s not in graph."%(u,v) |
remove_edges_from(self, ebunch) |
tuples (u,v) |
tuples (u,v,k) |
nx.Graph() |
G.add_path([0,1,2,3]) |
G.remove_edges_from(ebunch) |
has_successor(self, u, v) |
return (u in self.succ and v in self.succ[u]) |
has_predecessor(self, u, v) |
return (u in self.pred and v in self.pred[u]) |
successors_iter(self,n) |
neighbors_iter() |
successors_iter() |
iter(self.succ[n]) |
NetworkXError("The node %s is not in the digraph."%(n,) |
predecessors_iter(self,n) |
iter(self.pred[n]) |
NetworkXError("The node %s is not in the digraph."%(n,) |
successors(self, n) |
neighbors() |
successors() |
list(self.successors_iter(n) |
predecessors(self, n) |
list(self.predecessors_iter(n) |
edges_iter(self, nbunch=None, data=False, default=None) |
order (node, neighbor, data) |
optional (default= all nodes) |
optional (default=False) |
tuple (u,v,ddict[data]) |
tuple (u,v,ddict) |
tuple (u,v) |
optional (default=None) |
of (u,v) |
or (u,v,d) |
be (quietly) |
nx.DiGraph() |
G.add_path([0,1,2]) |
G.add_edge(2,3,weight=5) |
G.edges_iter() |
list(G.edges_iter(data=True) |
list(G.edges_iter(data='weight', default=1) |
list(G.edges_iter([0,2]) |
list(G.edges_iter(0) |
self.adj.items() |
self.nbunch_iter(nbunch) |
nbrs.items() |
yield (n,nbr,ddict) |
nbrs.items() |
yield (n,nbr,d) |
yield (n,nbr) |
in_edges_iter(self, nbunch=None, data=False) |
optional (default= all nodes) |
optional (default=False) |
tuple (u,v,data) |
of (u,v) |
or (u,v,d) |
self.pred.items() |
self.nbunch_iter(nbunch) |
nbrs.items() |
yield (nbr,n,data) |
yield (nbr,n) |
in_edges(self, nbunch=None, data=False) |
list(self.in_edges_iter(nbunch, data) |
degree_iter(self, nbunch=None, weight=None) |
for (node, degree) |
optional (default=all nodes) |
optional (default=None) |
of (node, degree) |
nx.DiGraph() |
G.add_path([0,1,2,3]) |
list(G.degree_iter(0) |
list(G.degree_iter([0,1]) |
zip(iter(self.succ.items() |
iter(self.pred.items() |
self.nbunch_iter(nbunch) |
self.nbunch_iter(nbunch) |
for (n,succ) |
yield (n,len(succ) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.