First, the algorithm mines the data for frequent sequences and computes an adjacency lattice.
首先,该算法挖掘频繁序列的数据并计算一个邻接格。
After turning it into a Designate Problem and analyzing the opposite angles of a rectangle in the Adjacency Matrix about its figure, this paper gives an approximate algorithm about it.
本文把它转化为增加限制条件的指派问题,对图邻接矩阵矩形对角进行分析,给出了这一问题的一个较好近似算法。
According to the property of the adjacency list of graphs, the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented.
根据图的邻接表的性质,提出了基于邻接表存储结构的“潜藏通路”搜索算法。
应用推荐