|
OpenQuizz
Une application de gestion des contenus pédagogiques
|


Public Member Functions | |
| def | __init__ (self) |
| def | __iter__ (self) |
| def | __len__ (self) |
| def | __contains__ (self, key) |
| def | copy (self) |
| def | add (self, key) |
| def | remove (self, key) |
| def | connected (self, f, t) |
| def | connect (self, f, t) |
| def | iter_edges (self) |
| def | iter_children (self, key) |
| def | iter_parents (self, key) |
A graph structure with directed edges.
| def __init__ | ( | self | ) |
| def __contains__ | ( | self, | |
| key | |||
| ) |
| def __iter__ | ( | self | ) |
| def __len__ | ( | self | ) |
| def add | ( | self, | |
| key | |||
| ) |
Add a new vertex to the graph.
| def connect | ( | self, | |
| f, | |||
| t | |||
| ) |
Connect two existing vertices. Nothing happens if the vertices are already connected.
| def connected | ( | self, | |
| f, | |||
| t | |||
| ) |
| def copy | ( | self | ) |
Return a shallow copy of this graph.
| def iter_children | ( | self, | |
| key | |||
| ) |
| def iter_edges | ( | self | ) |
| def iter_parents | ( | self, | |
| key | |||
| ) |
| def remove | ( | self, | |
| key | |||
| ) |
Remove a vertex from the graph, disconnecting all edges from/to it.