private HasseEdge MakeEdge(HasseNode N1, HasseNode N2)
{
// returns new edge. If already exists, returns null
if ((N1 == null) || (N2 == null))
{
throw new Exception("MakeEdge with null argument");
}
if (ExistsEdge(N1, N2))
{
return(null);
}
HasseEdge E = new HasseEdge();
E.LowerNode = N1;
E.UpperNode = N2;
N1.EdgesToCovering.Add(E);
N2.EdgesToCovered.Add(E);
// analyse difference between smaller and larger.
// output can be the *-marked smaller node + all difference fragments
// or can be partial
if ((LABEL_EDGES_WITH_DIFFERENCE) && (N1 != RootNode))
{
string[] EdgeLabels = N1.GetDifferenceString(N2);
E.LabelText = String.Join(", ", EdgeLabels);
foreach (string s in EdgeLabels)
{
if (E.LabelText.Contains("~~~")) //for debug
{
System.Diagnostics.Debugger.Break();
}
// For difference fragments, add link between fragment and those
// edges giving this Node as difference.
// The link is for efficient updates of difference items, it is not an edge in hasse diagram
//if (N1 != RootNode) // do not make difference here
//{
HasseNode DifferenceNode = null;
if (DifferenceNodes.ContainsKey(s)) // if such node already exists in differenc nodes
{
DifferenceNode = DifferenceNodes[s]; // get that node
}
else
if (HasseDiagramNodes.ContainsKey(s)) // if already exists in diagram nodes
{
DifferenceNode = HasseDiagramNodes[s]; // get reference
// add difference type
DifferenceNode.AddNodeType(HasseNode.HasseNodeTypes.DIFFERENCE_FRAGMENT);
// and add to difference catalog
DifferenceNodes.Add(DifferenceNode.KeyString, DifferenceNode);
}
else // not exist anywhere
{
// create and add to differene node catalog
// need to create to get keystring - not same as s!
DifferenceNode = this.differenceNodeFactory.NewNode(s, HasseNode.HasseNodeTypes.FRAGMENT | HasseNode.HasseNodeTypes.DIFFERENCE_FRAGMENT, "diff");
if (DifferenceNodes.ContainsKey(DifferenceNode.KeyString))
{
DifferenceNode = DifferenceNodes[DifferenceNode.KeyString];
}
else
{
DifferenceNodes.Add(DifferenceNode.KeyString, DifferenceNode);
}
// DifferenceNode = new StringHasseNode(HasseNode.HasseNodeTypes.FRAGMENT | HasseNode.HasseNodeTypes.DIFFERENCE_FRAGMENT,this.ElementaryHasseNodes);
// s, HasseNode.HasseNodeTypes.FRAGMENT | HasseNode.HasseNodeTypes.DIFFERENCE_FRAGMENT,
// this.ElementaryHasseNodes);
}
DifferenceNode.AddLinkToEdge(E); // create the link
//}
}
}
return(E);
}
