WIP: report part 3

2020-10-26 23:27:22 +02:00
parent 70ae98f31a
commit ebced2aa74
6 changed files with 123 additions and 43 deletions
@@ -309,10 +309,12 @@ class Edge {
 * its easy to find any closed loops. Using graph we transform the problem
 * of the closed room into the problem of finding a non simple graph.
 *
- * If the board has non connected wall structure then we would need more than
- * one graph to represent it.
+ * If the board has non connected wall structure then we would need a non
+ * coherent graph to represent it. This class provides constroctors and
+ * methods to create coherent graphs
 * 
- * An example graph we can create from the board bellow, starting from V=1 is:
+ * An example of the biggest coherent graph we can create from the board bellow,
+ * starting from V=1 is:
 * <pre>
 *    6---7   8                (1)
 *    |       |               /  \