多连通图的参数化表示与分解算法  

Parametric Representation and Decomposition Algorithm for Multi-Connection Graph

作　　者：刘晓平[1] 程光春[1] 吴黄[1] 何士双[1] 

机构地区：[1]合肥工业大学计算机与信息学院VCC研究室,安徽合肥230009

出　　处：《工程图学学报》2009年第2期114-119,共6页Journal of Engineering Graphics

基　　金：国家自然科学基金资助项目(60573174;60673208)

摘　　要：在电器、电子线路图纸中,简单图通常被用于表示各导通回路,并将所有的简单图绘制在同一图纸上以表明其相互关系,导致电路结构复杂,不易修改。基于图论的相关知识,该文提出了多连通图和连通回路的概念,通过参数化,使得简单图具备表现多个连通子图的能力。在此基础上,给出了从多连通图中提取连通回路的算法,以验证该方法的有效性。该方法在工程实践中得到应用,效果良好。Electric appliance and automobile usually contain lots of circuits, and in order to represent the relationship among them, they are drawn on one diagram. Based on graph theory, a parametric representation of circuits, supported by multi-connection graph and connection loops, is put forward. Through the presented method, a simple graph is assigned the capacity to represent multi-connections, and the circuit design and modification are greatly facilitated. Algorithm for connection loop abstraction is given, along with an example.

关 键 词：计算机应用 多连通图 参数设计 连通回路 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]