Actualizado README

1 files changed, 40 insertions, 11 deletions

diff --git a/si/n3.lyx b/si/n3.lyx
index 06957fb..91b18ae 100644
--- a/si/n3.lyx
+++ b/si/n3.lyx
@@ -1837,7 +1837,7 @@ SetKwFunction{Resolucion}{{}resolución}
 
 \begin_layout Plain Layout
 
-$R
+$G
 \backslash
 gets
 \backslash
@@ -1845,7 +1845,7 @@ gets
 \backslash
 }$
 \backslash
-tcp*{Por resolver}
+tcp*{Generados}
 \end_layout
 
 \begin_layout Plain Layout
@@ -1925,13 +1925,15 @@ leq F$}{
 
 	Tomar $n
 \backslash
-in R
+in G
 \backslash
 setminus
 \backslash
 text{Dom}b$
 \backslash
-;
+tcp*{{
+\backslash
+rm Esta es la frontera.}}
 \end_layout
 
 \begin_layout Plain Layout
@@ -1966,7 +1968,7 @@ emptyset$}{
 
 		$w_n
 \backslash
-gets F$
+gets 0$
 \backslash
 ;
 \end_layout
@@ -2029,7 +2031,7 @@ gets0$
 \backslash
 EnOtroCasoSi{$u
 \backslash
-notin R$}{
+notin G$}{
 \end_layout
 
 \begin_layout Plain Layout
@@ -2048,7 +2050,7 @@ gets h(u)$
 
 \begin_layout Plain Layout
 
-			Añadir $u$ a $R$
+			Añadir $u$ a $G$
 \backslash
 ;
 \end_layout
@@ -2098,6 +2100,19 @@ in M$ sin sucesores en $M$ y sacarlo de $M$
 
 \begin_layout Plain Layout
 
+		$c
+\backslash
+gets(w_u,[u
+\backslash
+in C])$
+\backslash
+tcp*{{
+\backslash
+rm $[P]$ devuelve un booleano que indica si $P$ es cierto.}}
+\end_layout
+
+\begin_layout Plain Layout
+
 		Tomar el $S$ con $(u,S)
 \backslash
 in A$ de menor $
@@ -2146,15 +2161,29 @@ subseteq C$}{añadir $u$ a $C$}
 
 \begin_layout Plain Layout
 
-		Añadir a $M$ los $v
+		
+\backslash
+lSSi{$c
+\backslash
+neq(w_u,[u
+\backslash
+in C])$}{%
+\end_layout
+
+\begin_layout Plain Layout
+
+			añadir a $M$ los $v
 \backslash
 in
 \backslash
 text{Dom}b$ con $u
 \backslash
-in b_v$
-\backslash
-;
+in b_v$%
+\end_layout
+
+\begin_layout Plain Layout
+
+		}
 \end_layout
 
 \begin_layout Plain Layout