Computes the intersection, the union or the difference of two graphs : a
reference graph (R) and a query graph (Q). In case more than one arc exist
between two nodes, the program removes one of those.
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.
Column specifications (only for tab-delimited format)
Source and target column. Columns containing the source and target nodes.
Weight or label column. Column containing the weight or the label on the edge.
Requested output of the program : intersection, union, difference, intersection + reference graph or intersection + query graph.
The difference corresponds to the arcs of the reference graph that are not included in the query graph.
If either the union, the intersection + query or the intersection + reference is requested, each arc is labelled to indicate whether it belongs to the intersection (R.and.Q), to Q only (Q.not.R) or to R only (R.not.Q). Moreover, each arc is colored according to this label.
The R.and.Q arcs are colored in green, the Q.not.R arcs are colored in red and the R.not.Q arcs are colored in blue.
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.
Weight on the edges of the output graph
This option allows to specify the label of the edges of the output graph
- weights of the query graph
- weights of the reference graph
- sum of the weights of the two graphs
- mean of the weights of the two graphs
- geometrical mean of the weights of the two graphs
- minimum weight
- maximum weight
- weight of the two graphs
Indicates whether the graphs can admit self-loops, i.e., an arc from
a node to itself. Note that the graphs do not specially need to
contain actual self-loops, the question is whether it would or not
be acceptable for the considered input graphs to contain self-loops.
This parameter affects the computation of the maximal number of arcs
in the graph, and, thereby, the estimated probability of the