PROGRAMMING:Delete arc
Suppose the directed graph is stored in adjacency table, try to write an algorithm to delete arcs and traverse depth first【 Test case: IOT engineering level 16 [Zhang Xuliang]
###Input format:
Enter an n to indicate the number of arcs to be deleted. Enter V1 in turn, and V2 to indicate the arc tail and arc head.
###Output format:
Output traversal results, each output unit with a space
###Input example:
Here is a set of inputs. For example:
```in
three
0 1 0
0 0 1
1 0 0
one
one
0 1
```
###Output example:
The corresponding output is given here. For example:
```out
1 2 0
```
answer：If there is no answer, please comment
###Input format:
Enter an n to indicate the number of arcs to be deleted. Enter V1 in turn, and V2 to indicate the arc tail and arc head.
###Output format:
Output traversal results, each output unit with a space
###Input example:
Here is a set of inputs. For example:
```in
three
0 1 0
0 0 1
1 0 0
one
one
0 1
```
###Output example:
The corresponding output is given here. For example:
```out
1 2 0
```
answer：If there is no answer, please comment