Compare two nodes based on their names.
| 39 | |
| 40 | // Compare two nodes based on their names. |
| 41 | struct NodeComparatorName { |
| 42 | bool operator()(const Node* n1, const Node* n2) const { |
| 43 | return n1->name() < n2->name(); |
| 44 | } |
| 45 | }; |
| 46 | |
| 47 | // Perform a depth-first-search on g starting at the source node. |
| 48 | // If enter is not empty, calls enter(n) before visiting any children of n. |
no outgoing calls