52、开发具有良好属性的 XML 文档

开发具有良好属性的 XML 文档

1. 二元算法

首先介绍的是用于生成方案树森林的第一个算法，该算法要求输入为仅含连接顶点的二元边且无显式泛化/特化的概念模型实例。

算法 1 - 二元算法

Input: a binary CM hypergraph H (with no explicit generalization/specialization).
Output: a scheme-tree forest.
Until all vertices and edges have been marked
    If one or more unmarked vertices remain
        Let V be a selected unmarked vertex in H;
        Mark V in H;
    Else
        Select an unmarked edge E;
        Let V be one of the two vertices of E;
        Make V the root node of a new scheme tree T ;
        Designate V in T as a continuation attribute;
    While there is an unmarked edge E = (A, B) in H
        such that A is a continuation attribute in T
        Mark E in H;