How to get the end in algorithm2e
I am using algorithm2e to typeset an algorithm. I like the appearance of the following, but I am not able to get the end
to close the `
begin
`. Any way to do this?
documentclass{article}
usepackage[longend,ruled,vlined]{algorithm2e}
begin{document}
begin{algorithm}
caption{PHORIZONTAL Algorithm}label{alg:phorizontal}
KwIn{$R$: relation; $Pr$: set of simple predicates}
KwOut{$F_{R}$: set of horizontal fragments of $R$}
Begin{
$Pr' leftarrow $COM_MIN($R, Pr$) ;
determine the set $M$ of minterm predicates ;
determine the set $I$ of implications among $p_i in Pr'$ ;
ForEach{$m_{i} in M$}{
If{ $m_{i}$ is contradictory according to $I$}{$M leftarrow M - m_{i}$}
}
$F_{R} = {R_{i} | sigma_{m_{i}} R, m_{i} in M}, forall m_{i} in M$ ;
}
end{algorithm}
end{document}
algorithm2e
add a comment |
I am using algorithm2e to typeset an algorithm. I like the appearance of the following, but I am not able to get the end
to close the `
begin
`. Any way to do this?
documentclass{article}
usepackage[longend,ruled,vlined]{algorithm2e}
begin{document}
begin{algorithm}
caption{PHORIZONTAL Algorithm}label{alg:phorizontal}
KwIn{$R$: relation; $Pr$: set of simple predicates}
KwOut{$F_{R}$: set of horizontal fragments of $R$}
Begin{
$Pr' leftarrow $COM_MIN($R, Pr$) ;
determine the set $M$ of minterm predicates ;
determine the set $I$ of implications among $p_i in Pr'$ ;
ForEach{$m_{i} in M$}{
If{ $m_{i}$ is contradictory according to $I$}{$M leftarrow M - m_{i}$}
}
$F_{R} = {R_{i} | sigma_{m_{i}} R, m_{i} in M}, forall m_{i} in M$ ;
}
end{algorithm}
end{document}
algorithm2e
PlaceSetAlgoLined
at the inception point of your algorithm.
– Siba Mishra
Mar 30 at 12:53
THanks. Will try that as well.
– ozsu
Mar 30 at 16:29
add a comment |
I am using algorithm2e to typeset an algorithm. I like the appearance of the following, but I am not able to get the end
to close the `
begin
`. Any way to do this?
documentclass{article}
usepackage[longend,ruled,vlined]{algorithm2e}
begin{document}
begin{algorithm}
caption{PHORIZONTAL Algorithm}label{alg:phorizontal}
KwIn{$R$: relation; $Pr$: set of simple predicates}
KwOut{$F_{R}$: set of horizontal fragments of $R$}
Begin{
$Pr' leftarrow $COM_MIN($R, Pr$) ;
determine the set $M$ of minterm predicates ;
determine the set $I$ of implications among $p_i in Pr'$ ;
ForEach{$m_{i} in M$}{
If{ $m_{i}$ is contradictory according to $I$}{$M leftarrow M - m_{i}$}
}
$F_{R} = {R_{i} | sigma_{m_{i}} R, m_{i} in M}, forall m_{i} in M$ ;
}
end{algorithm}
end{document}
algorithm2e
I am using algorithm2e to typeset an algorithm. I like the appearance of the following, but I am not able to get the end
to close the `
begin
`. Any way to do this?
documentclass{article}
usepackage[longend,ruled,vlined]{algorithm2e}
begin{document}
begin{algorithm}
caption{PHORIZONTAL Algorithm}label{alg:phorizontal}
KwIn{$R$: relation; $Pr$: set of simple predicates}
KwOut{$F_{R}$: set of horizontal fragments of $R$}
Begin{
$Pr' leftarrow $COM_MIN($R, Pr$) ;
determine the set $M$ of minterm predicates ;
determine the set $I$ of implications among $p_i in Pr'$ ;
ForEach{$m_{i} in M$}{
If{ $m_{i}$ is contradictory according to $I$}{$M leftarrow M - m_{i}$}
}
$F_{R} = {R_{i} | sigma_{m_{i}} R, m_{i} in M}, forall m_{i} in M$ ;
}
end{algorithm}
end{document}
algorithm2e
algorithm2e
asked Mar 30 at 12:18
ozsuozsu
1,13111126
1,13111126
PlaceSetAlgoLined
at the inception point of your algorithm.
– Siba Mishra
Mar 30 at 12:53
THanks. Will try that as well.
– ozsu
Mar 30 at 16:29
add a comment |
PlaceSetAlgoLined
at the inception point of your algorithm.
– Siba Mishra
Mar 30 at 12:53
THanks. Will try that as well.
– ozsu
Mar 30 at 16:29
Place
SetAlgoLined
at the inception point of your algorithm.– Siba Mishra
Mar 30 at 12:53
Place
SetAlgoLined
at the inception point of your algorithm.– Siba Mishra
Mar 30 at 12:53
THanks. Will try that as well.
– ozsu
Mar 30 at 16:29
THanks. Will try that as well.
– ozsu
Mar 30 at 16:29
add a comment |
1 Answer
1
active
oldest
votes
Referring to the answert by @egreg in End word is hidden in algorithm block , the vlined
option suppresses the printing of “end”. Just remove the option:
documentclass{article}
usepackage[longend,ruled]{algorithm2e}
begin{document}
begin{algorithm}
caption{PHORIZONTAL Algorithm}label{alg:phorizontal}
KwIn{$R$: relation; $Pr$: set of simple predicates}
KwOut{$F_{R}$: set of horizontal fragments of $R$}
Begin{
$Pr' leftarrow $COM_MIN($R, Pr$) ;
determine the set $M$ of minterm predicates ;
determine the set $I$ of implications among $p_i in Pr'$ ;
ForEach{$m_{i} in M$}{
If{ $m_{i}$ is contradictory according to $I$}{$M leftarrow M - m_{i}$}
}
$F_{R} = {R_{i} | sigma_{m_{i}} R, m_{i} in M}, forall m_{i} in M$ ;
}
end{algorithm}
end{document}
Thank you. I was hoping I could keep both, but apparently that is not possible.
– ozsu
Mar 30 at 16:02
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "85"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2ftex.stackexchange.com%2fquestions%2f482246%2fhow-to-get-the-end-in-algorithm2e%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Referring to the answert by @egreg in End word is hidden in algorithm block , the vlined
option suppresses the printing of “end”. Just remove the option:
documentclass{article}
usepackage[longend,ruled]{algorithm2e}
begin{document}
begin{algorithm}
caption{PHORIZONTAL Algorithm}label{alg:phorizontal}
KwIn{$R$: relation; $Pr$: set of simple predicates}
KwOut{$F_{R}$: set of horizontal fragments of $R$}
Begin{
$Pr' leftarrow $COM_MIN($R, Pr$) ;
determine the set $M$ of minterm predicates ;
determine the set $I$ of implications among $p_i in Pr'$ ;
ForEach{$m_{i} in M$}{
If{ $m_{i}$ is contradictory according to $I$}{$M leftarrow M - m_{i}$}
}
$F_{R} = {R_{i} | sigma_{m_{i}} R, m_{i} in M}, forall m_{i} in M$ ;
}
end{algorithm}
end{document}
Thank you. I was hoping I could keep both, but apparently that is not possible.
– ozsu
Mar 30 at 16:02
add a comment |
Referring to the answert by @egreg in End word is hidden in algorithm block , the vlined
option suppresses the printing of “end”. Just remove the option:
documentclass{article}
usepackage[longend,ruled]{algorithm2e}
begin{document}
begin{algorithm}
caption{PHORIZONTAL Algorithm}label{alg:phorizontal}
KwIn{$R$: relation; $Pr$: set of simple predicates}
KwOut{$F_{R}$: set of horizontal fragments of $R$}
Begin{
$Pr' leftarrow $COM_MIN($R, Pr$) ;
determine the set $M$ of minterm predicates ;
determine the set $I$ of implications among $p_i in Pr'$ ;
ForEach{$m_{i} in M$}{
If{ $m_{i}$ is contradictory according to $I$}{$M leftarrow M - m_{i}$}
}
$F_{R} = {R_{i} | sigma_{m_{i}} R, m_{i} in M}, forall m_{i} in M$ ;
}
end{algorithm}
end{document}
Thank you. I was hoping I could keep both, but apparently that is not possible.
– ozsu
Mar 30 at 16:02
add a comment |
Referring to the answert by @egreg in End word is hidden in algorithm block , the vlined
option suppresses the printing of “end”. Just remove the option:
documentclass{article}
usepackage[longend,ruled]{algorithm2e}
begin{document}
begin{algorithm}
caption{PHORIZONTAL Algorithm}label{alg:phorizontal}
KwIn{$R$: relation; $Pr$: set of simple predicates}
KwOut{$F_{R}$: set of horizontal fragments of $R$}
Begin{
$Pr' leftarrow $COM_MIN($R, Pr$) ;
determine the set $M$ of minterm predicates ;
determine the set $I$ of implications among $p_i in Pr'$ ;
ForEach{$m_{i} in M$}{
If{ $m_{i}$ is contradictory according to $I$}{$M leftarrow M - m_{i}$}
}
$F_{R} = {R_{i} | sigma_{m_{i}} R, m_{i} in M}, forall m_{i} in M$ ;
}
end{algorithm}
end{document}
Referring to the answert by @egreg in End word is hidden in algorithm block , the vlined
option suppresses the printing of “end”. Just remove the option:
documentclass{article}
usepackage[longend,ruled]{algorithm2e}
begin{document}
begin{algorithm}
caption{PHORIZONTAL Algorithm}label{alg:phorizontal}
KwIn{$R$: relation; $Pr$: set of simple predicates}
KwOut{$F_{R}$: set of horizontal fragments of $R$}
Begin{
$Pr' leftarrow $COM_MIN($R, Pr$) ;
determine the set $M$ of minterm predicates ;
determine the set $I$ of implications among $p_i in Pr'$ ;
ForEach{$m_{i} in M$}{
If{ $m_{i}$ is contradictory according to $I$}{$M leftarrow M - m_{i}$}
}
$F_{R} = {R_{i} | sigma_{m_{i}} R, m_{i} in M}, forall m_{i} in M$ ;
}
end{algorithm}
end{document}
answered Mar 30 at 12:50
subham sonisubham soni
4,91683187
4,91683187
Thank you. I was hoping I could keep both, but apparently that is not possible.
– ozsu
Mar 30 at 16:02
add a comment |
Thank you. I was hoping I could keep both, but apparently that is not possible.
– ozsu
Mar 30 at 16:02
Thank you. I was hoping I could keep both, but apparently that is not possible.
– ozsu
Mar 30 at 16:02
Thank you. I was hoping I could keep both, but apparently that is not possible.
– ozsu
Mar 30 at 16:02
add a comment |
Thanks for contributing an answer to TeX - LaTeX Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2ftex.stackexchange.com%2fquestions%2f482246%2fhow-to-get-the-end-in-algorithm2e%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Place
SetAlgoLined
at the inception point of your algorithm.– Siba Mishra
Mar 30 at 12:53
THanks. Will try that as well.
– ozsu
Mar 30 at 16:29