equal
deleted
inserted
replaced
74 \skip addEdge |
74 \skip addEdge |
75 \until addEdge |
75 \until addEdge |
76 |
76 |
77 In the next few lines we add some more nodes and edges and to the graph we need. |
77 In the next few lines we add some more nodes and edges and to the graph we need. |
78 Those lines are not very interesting so we skip them, but you find the whole |
78 Those lines are not very interesting so we skip them, but you find the whole |
79 working program in file hello_lemon.cc in the demo section. |
79 working program in file hello_world.cc in the demo section. |
80 |
80 |
81 The next statement must be familiar. But what is that INVALID in the \c while |
81 The next statement must be familiar. But what is that INVALID in the \c while |
82 test statement? In LEMON we usually use the INVALID to check if an object |
82 test statement? In LEMON we usually use the INVALID to check if an object |
83 contains valid information. |
83 contains valid information. |
84 \skip current_node |
84 \skip current_node |