论文标题
在基于集合的图形中连接的组件。在对象中的应用 - 导向模型操作
Connected Components in Undirected Set--Based Graphs. Applications in Object--Oriented Model Manipulation
论文作者
论文摘要
这项工作引入了一种新型算法，用于查找图的连接组件，其中将顶点和边缘分组为定义基于集合图的集合。在对这些集合的某些限制下，该算法具有以顶点和边缘数量来实现恒定计算成本的显着特性。提到的限制与使用某些特定类型的地图来表示通过intension和边缘集的可能性相关的可能性。尽管这些限制可能会在一般环境中产生强大的限制，但通常在将连接转换为对象导向模型中的方程的问题时，这是所提出算法的主要应用。 除了描述新算法并研究其计算成本外，该作品还描述了其原型实现，并在不同的示例中显示了其应用。
This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set--Based Graph. The algorithm, under certain restrictions on those sets, has the remarkable property of achieving constant computational costs with the number of vertices and edges. The mentioned restrictions are related to the possibility of representing the sets of vertices by intension and the sets of edges using some particular type of maps. While these restrictions can result strong in a general context, they are usually satisfied in the problem of transforming connections into equations in object oriented models, which is the main application of the proposed algorithm. Besides describing the new algorithm and studying its computational cost, the work describes its prototype implementation and shows its application in different examples.
