diff --git a/src/lab/exp10/Tutorial.html b/src/lab/exp10/Tutorial.html index 66ff00566..1cc9de4ea 100644 --- a/src/lab/exp10/Tutorial.html +++ b/src/lab/exp10/Tutorial.html @@ -24,6 +24,9 @@ + + + diff --git a/src/lab/exp9/Illustration.html b/src/lab/exp9/Illustration.html index 6cf247bab..2028f8bb1 100644 --- a/src/lab/exp9/Illustration.html +++ b/src/lab/exp9/Illustration.html @@ -105,8 +105,8 @@

Hopfield models for solution to optimization probl associated with annealing of Hopfield model.

- +
-
+
Figure 1: Illustration of graph with 4 nodes before annealing.

@@ -114,16 +114,16 @@

Hopfield models for solution to optimization probl Figure 1 illustrates a graph with 4 nodes before the process of annealing. Figure 2 shows the input graph and the bipartitioned graph.

- +
-
+
Figure 2: Illustration of graph with 4 nodes after annealing.

We see that even if there exists a solution through annealing, it need not lead to the optimum solution of the bipartition. The graph still is not divided in parts containing equal number of nodes as illustrated in Figure 2.

- +
-
+
Figure 3: Illustration of graph with 14 nodes before annealing.

@@ -131,8 +131,8 @@

Hopfield models for solution to optimization probl Figuew 3 illustrates a graph with 14 nodes before the process of annealing. Figure 4 shows the input graph and the bipartitioned graph.

- +
-
+
Figure 4: Illustration of graph with 14 nodes after annealing.

@@ -149,7 +149,7 @@

Hopfield models for solution to optimization probl