1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
.. _digraph:
=========================================
DiGraph - Directed graphs with self loops
=========================================
Overview
========
.. currentmodule:: networkx
.. autofunction:: DiGraph
Adding and removing nodes and edges
===================================
.. autosummary::
:toctree: generated/
DiGraph.__init__
DiGraph.add_node
DiGraph.add_nodes_from
DiGraph.remove_node
DiGraph.remove_nodes_from
DiGraph.add_edge
DiGraph.add_edges_from
DiGraph.add_weighted_edges_from
DiGraph.remove_edge
DiGraph.remove_edges_from
DiGraph.add_star
DiGraph.add_path
DiGraph.add_cycle
DiGraph.clear
Iterating over nodes and edges
==============================
.. autosummary::
:toctree: generated/
DiGraph.nodes
DiGraph.nodes_iter
DiGraph.__iter__
DiGraph.edges
DiGraph.edges_iter
DiGraph.out_edges
DiGraph.out_edges_iter
DiGraph.in_edges
DiGraph.in_edges_iter
DiGraph.get_edge_data
DiGraph.neighbors
DiGraph.neighbors_iter
DiGraph.__getitem__
DiGraph.successors
DiGraph.successors_iter
DiGraph.predecessors
DiGraph.predecessors_iter
DiGraph.adjacency_list
DiGraph.adjacency_iter
DiGraph.nbunch_iter
Information about graph structure
=================================
.. autosummary::
:toctree: generated/
DiGraph.has_node
DiGraph.__contains__
DiGraph.has_edge
DiGraph.order
DiGraph.number_of_nodes
DiGraph.__len__
DiGraph.degree
DiGraph.degree_iter
DiGraph.in_degree
DiGraph.in_degree_iter
DiGraph.out_degree
DiGraph.out_degree_iter
DiGraph.size
DiGraph.number_of_edges
DiGraph.nodes_with_selfloops
DiGraph.selfloop_edges
DiGraph.number_of_selfloops
Making copies and subgraphs
===========================
.. autosummary::
:toctree: generated/
DiGraph.copy
DiGraph.to_undirected
DiGraph.to_directed
DiGraph.subgraph
DiGraph.reverse
|
