Loads a dictionary from a file located at *path* in the same manner as :doc:`graphskeleton`, but includes a step where it topologically orders the nodes.
(self, path)
| 42 | '''A list of [origin, destination] pairs of verties that constitute edges.''' |
| 43 | |
| 44 | def load(self, path): |
| 45 | '''Loads a dictionary from a file located at *path* in the same manner as :doc:`graphskeleton`, but includes a step where it topologically orders the nodes.''' |
| 46 | |
| 47 | self.dictload(path) |
| 48 | self.V = self.alldata["V"] |
| 49 | self.E = self.alldata["E"] |
| 50 | |
| 51 | # topologically order |
| 52 | self.toporder() |
| 53 | |
| 54 | # free unused memory |
| 55 | del self.alldata |