Defined in File GraphDifference.hpp
public NetworKit::Algorithm
(Class Algorithm)
Calculate the edge difference between two graphs.
This calculates which graph edge additions or edge removals are necessary to transform one given graph into another given graph.
Both graphs need to have the same node set, directed graphs are not supported currently.
Note that edge weight differences are not detected but edge addition events set the correct edge weight.
Public Functions
Construct the edge edit difference with two graphs to compare.
G1 – The first graph to compare.
G2 – The second graph to compare.
Execute the algorithm and compute the difference.
Get the required edits.
A vector of graph events.
Get the required number of edits.
This is only the number of actual changes. In order to get correct node ids, more edits might be generated.
The number of edits.
Get the required number of node additions.
The number of node additions.
Get the required number of node removals.
The number of node removals.
Get the required number of node restorations.
The number of node restorations.
Get the required number of edge additions.
The number of edge additions.