|
|
| __init__ (self) |
| |
|
| __iter__ (self) |
| |
|
| __len__ (self) |
| |
|
| __contains__ (self, key) |
| |
| | copy (self) |
| |
| | add (self, key) |
| |
| | remove (self, key) |
| |
|
| connected (self, f, t) |
| |
| | connect (self, f, t) |
| |
|
| iter_edges (self) |
| |
|
| iter_children (self, key) |
| |
|
| iter_parents (self, key) |
| |
|
|
| _vertices |
| |
|
| _forwards |
| |
|
| _backwards |
| |
A graph structure with directed edges.
◆ add()
| pip._vendor.resolvelib.structs.DirectedGraph.add |
( |
|
self, |
|
|
|
key |
|
) |
| |
Add a new vertex to the graph.
◆ connect()
| pip._vendor.resolvelib.structs.DirectedGraph.connect |
( |
|
self, |
|
|
|
f, |
|
|
|
t |
|
) |
| |
Connect two existing vertices.
Nothing happens if the vertices are already connected.
◆ copy()
| pip._vendor.resolvelib.structs.DirectedGraph.copy |
( |
|
self | ) |
|
Return a shallow copy of this graph.
◆ remove()
| pip._vendor.resolvelib.structs.DirectedGraph.remove |
( |
|
self, |
|
|
|
key |
|
) |
| |
Remove a vertex from the graph, disconnecting all edges from/to it.
The documentation for this class was generated from the following file:
- docs/help/help-venv/lib/python3.12/site-packages/pip/_vendor/resolvelib/structs.py