Skip to content

Commit 9aac315

Browse files
authored
Corrected the image not visible issue in 2SAT.md
the image access was done wrongly
1 parent 862a10b commit 9aac315

File tree

1 file changed

+7
-2
lines changed

1 file changed

+7
-2
lines changed

src/graph/2SAT.md

Lines changed: 7 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,10 @@ b \Rightarrow a & \lnot b \Rightarrow \lnot a & b \Rightarrow \lnot a & c \Right
3939

4040
You can see the implication graph in the following image:
4141

42-
<center>!["Implication Graph of 2-SAT example"](2SAT.png)</center>
42+
<p align="center">
43+
<img src="2SAT.png" alt="Implication Graph of 2-SAT example">
44+
</p>
45+
4346

4447
It is worth paying attention to the property of the implication graph:
4548
if there is an edge $a \Rightarrow b$, then there also is an edge $\lnot b \Rightarrow \lnot a$.
@@ -59,7 +62,9 @@ The following image shows all strongly connected components for the example.
5962
As we can check easily, neither of the four components contain a vertex $x$ and its negation $\lnot x$, therefore the example has a solution.
6063
We will learn in the next paragraphs how to compute a valid assignment, but just for demonstration purposes the solution $a = \text{false}$, $b = \text{false}$, $c = \text{false}$ is given.
6164

62-
<center>!["Strongly Connected Components of the 2-SAT example"](2SAT_SCC.png)</center>
65+
<p align="center">
66+
<img src="2SAT_SCC.png" alt="Strongly Connected Components of the 2-SAT example">
67+
</p>
6368

6469
Now we construct the algorithm for finding the solution of the 2-SAT problem on the assumption that the solution exists.
6570

0 commit comments

Comments
 (0)