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
|
.. _digraph:
=========================================
DiGraph---Directed graphs with self loops
=========================================
Overview
========
.. currentmodule:: networkx
.. autoclass:: DiGraph
Methods
=======
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.update
DiGraph.clear
DiGraph.clear_edges
Reporting nodes edges and neighbors
-----------------------------------
.. autosummary::
:toctree: generated/
DiGraph.nodes
DiGraph.__iter__
DiGraph.has_node
DiGraph.__contains__
DiGraph.edges
DiGraph.out_edges
DiGraph.in_edges
DiGraph.has_edge
DiGraph.get_edge_data
DiGraph.neighbors
DiGraph.adj
DiGraph.__getitem__
DiGraph.successors
DiGraph.succ
DiGraph.predecessors
DiGraph.pred
DiGraph.adjacency
DiGraph.nbunch_iter
Counting nodes edges and neighbors
----------------------------------
.. autosummary::
:toctree: generated/
DiGraph.order
DiGraph.number_of_nodes
DiGraph.__len__
DiGraph.degree
DiGraph.in_degree
DiGraph.out_degree
DiGraph.size
DiGraph.number_of_edges
Making copies and subgraphs
---------------------------
.. autosummary::
:toctree: generated/
DiGraph.copy
DiGraph.to_undirected
DiGraph.to_directed
DiGraph.subgraph
DiGraph.edge_subgraph
DiGraph.reverse
|
