论文部分内容阅读
(一)问题 一个无向图中可能含许多简单回路(即点可重复边不可重复的回路),如一个田字就含有15种不同的简单回路子图:而一个7个顶点任两点都有一边相连的图则含32592种简单回路,那么如何编一程序求解所有的情况呢?
(A) Problem An undirected graph may contain many simple loops (that is, a point can be repeated non-repeatable loop), such as a field contains 15 different simple loop subgraph: and a seven vertices for any two points There are 32,592 simple circuits connected to one side of the plan, then how to program to solve all the problems?