/// <summary>
/// Performs the first step of the algorithm - Merging the connected components in the TypeInference graph.
/// For more details, see <see cref="Efficient Inference of Static Types for Java Bytecode.pdf"/>.
/// </summary>
protected void MergeConnectedComponents()
{
ConnectedComponentsFinder finder = new ConnectedComponentsFinder(inferenceGraph);
IEnumerable <ICollection <ClassHierarchyNode> > components = finder.GetConnectedComponents();
foreach (ICollection <ClassHierarchyNode> component in components)
{
///Merge component.
MergeNodes(component);
}
}
/// <summary>
/// Performs the first step of the algorithm - Merging the connected components in the TypeInference graph.
/// For more details, see <see cref="Efficient Inference of Static Types for Java Bytecode.pdf"/>.
/// </summary>
protected void MergeConnectedComponents()
{
ConnectedComponentsFinder finder = new ConnectedComponentsFinder(inferenceGraph);
IEnumerable<ICollection<ClassHierarchyNode>> components = finder.GetConnectedComponents();
foreach (ICollection<ClassHierarchyNode> component in components)
{
///Merge component.
MergeNodes(component);
}
}