- A -

Addition of node into a net

- B -

Ban of the left turn at the T-junction

Ban of the right turn at the T-junction

Building a minimum path between the specified points (traveling salesman problem)

Building of minimum path

Building of remoteness graph

- C -

Control of road graph

Creation of a network edge

Creation of a network node

Creation of arcs (exits and U-turns)

- E -

Exit

- F -

Forming turns interdictions

- G -

Graph building

- M -

Moving of node from a net

- R -

Removing network

Replacement of an arc onto arc with one-way traffic

Replacing section onto parallel arcs

Revert (changing direction of digitizing)

Roads paralleling

- U -

Undo one step

Union of graphs