#### Description

Alter a graph either by adding or removing edges or nodes

#### Authors

#### Options

#### Input and output formats

The accepted input formats are GML, tab-delimited and adjacency matrix.
For more explanations about these, refer to the manual of convert-graph.

If the tab-delimited output is requested, the result graph displays a fourth column indicating whether the
edge comes from the original (*original*) graph or was added randomly by the program (*random*).

#### Column specifications (only for tab-delimited format)

**Source and target column**. Columns containing the source and target nodes.

**Label or weight column**. Columns containing the label or the weight of the edge.

#### Graph alteration

The number of edges or nodes to removed must be a strictly positive integer or a strictly positive percentage. For example : 30 or 50% but not 0.5

Note that, by removing nodes, edges are generally removed. In this case, the removed edges are comptabilized as already
removed edges and the number of edges that still has to be removed decreases.

Moreover, if you specify target nodes and a certain number of nodes to remove, the target nodes are comptabilized
as already removed nodes and the number of nodes that still has to be removed decreases.

#### Directed graph

Indicates whether the graphs must be considered as directed, i.e.,
an arc from node A to node B is different from an arc from B to A.

#### Self loops

Allows self loops (by default, self loops are not allowed)

#### Duplicated edges

Allows duplicated edges(by default, self loops are not allowed)

#### Targets

Nodes that have to be removed in the graph (if existing).