8.2.12.1. DiGraph

class DiGraph(nodes=None, adj=None)[source]

Methods

__delattr__

Implement delattr(self, name).

__dir__

Default dir() implementation.

__eq__

Return self==value.

__format__

Default object formatter.

__ge__

Return self>=value.

__getattribute__

Return getattr(self, name).

__getitem__

__getstate__

Helper for pickle.

__gt__

Return self>value.

__hash__

Return hash(self).

__init__

__init_subclass__

This method is called when a class is subclassed.

__le__

Return self<=value.

__lt__

Return self<value.

__ne__

Return self!=value.

__new__

__reduce__

Helper for pickle.

__reduce_ex__

Helper for pickle.

__repr__

Return repr(self).

__setattr__

Implement setattr(self, name, value).

__sizeof__

Size of object in memory, in bytes.

__str__

Return str(self).

__subclasshook__

Abstract classes can override this to customize issubclass().

_add_edge

_add_edge_fw

_add_node

_remove_node

add_edge

add_edge_fw

add_edges_from

add_node

add_nodes_from

copy

has_edge

remove_edge

remove_edges_from

remove_node

remove_nodes_from

subgraph

__init__(nodes=None, adj=None)[source]

Attributes

nodes

succ

pred

__annotations__

__doc__

__module__

__slots__

adj

edges

__slots__ = ('nodes', 'succ', 'pred')
__reduce__()[source]

Helper for pickle.

__init__(nodes=None, adj=None)[source]
nodes
pred
succ
__getitem__(item)[source]
property adj
_add_node(n, attr)[source]
_remove_node(n)[source]
add_node(n, **attr)[source]
remove_node(n)[source]
add_nodes_from(nodes_for_adding)[source]
remove_nodes_from(nodes)[source]
_add_edge(u, v, attr)[source]
_add_edge_fw(u, v, attr)[source]
add_edge_fw(u, v, **attr)[source]
add_edge(u, v, **attr)[source]
add_edges_from(ebunch_to_add)[source]
remove_edge(u, v)[source]
remove_edges_from(ebunch)[source]
property edges
has_edge(u, v)[source]
subgraph(nodes)[source]
__annotations__ = {}
__doc__ = None
__module__ = 'schedula.utils.graph'
copy()[source]