readme update
This commit is contained in:
@@ -148,6 +148,12 @@ assert set(sub["D"]) == {"E"}
|
|||||||
assert set(sub["E"]) == {"F"}
|
assert set(sub["E"]) == {"F"}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
`subgraph()` returns an independent snapshot of the successor closure, including the seeds. Only edges whose endpoints belong to that closure are retained; incoming dependencies from outside it are excluded.
|
||||||
|
|
||||||
|
Unlike the earlier shared-set behavior, mutations to a subgraph do not change its parent, and later parent mutations do not change the subgraph. `sub.reverse` remains a live reverse view of the subgraph itself.
|
||||||
|
|
||||||
|
Node objects and callback functions are not copied. The subgraph retains the parent's `on_add` and `on_remove` callbacks without invoking them during extraction, so any external side effects of those callbacks remain shared.
|
||||||
|
|
||||||
## `DAGSetView` as a Standalone Type
|
## `DAGSetView` as a Standalone Type
|
||||||
|
|
||||||
`DAGSetView` can also be used directly as a mutable set wrapper.
|
`DAGSetView` can also be used directly as a mutable set wrapper.
|
||||||
|
|||||||
Reference in New Issue
Block a user