Bye formula and the algorithm, we can partition a graph of LSI element into a group of minimum exposure element, to advance exposure efficiency and lithophotography quality.
由此可分割LSI单元图形成最少曝光单元，以提高曝光效率和版图光刻质量。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
We will use the concept of a data hierarchy graph, constructed by means of transaction analysis, to characterize the relationship between a database partition scheme and database transactions.
我们会通过处理分析的方式，使用数据层次图的概念，以描述数据库分区结构和数据库处理的关系。
应用推荐