Hasse diagram max/greatest,topological sort
$begingroup$
A set S of jobs can be ordered by writing x≤y to mean that iether x = y or x must be done before y, for all x and y in S. given the hasse diagram, for this relation for a particular set S of jobs, show the following:
a) minimal,least,maximal and greatest elements
b) topological sort.
My answer:
a)
minimal: 1,9,2
maximal: 3
least: none
greatest:3
b)
topological order: (1,9,2,10,6,8,5,7,4,3)
Is this correct? or am i completely off
discrete-mathematics proof-verification order-theory
edited Dec 3 '18 at 1:14
Ethan Bolker
42.1k548111
asked Dec 3 '18 at 1:12
MasterYoshiMasterYoshi
606
$endgroup$
add a comment |
$begingroup$
A set S of jobs can be ordered by writing x≤y to mean that iether x = y or x must be done before y, for all x and y in S. given the hasse diagram, for this relation for a particular set S of jobs, show the following:
a) minimal,least,maximal and greatest elements
b) topological sort.
My answer:
a)
minimal: 1,9,2
maximal: 3
least: none
greatest:3
b)
topological order: (1,9,2,10,6,8,5,7,4,3)
Is this correct? or am i completely off
discrete-mathematics proof-verification order-theory
edited Dec 3 '18 at 1:14
Ethan Bolker
42.1k548111
asked Dec 3 '18 at 1:12
MasterYoshiMasterYoshi
606
$endgroup$
2
$begingroup$
Looks OK to me.
$endgroup$
– Ethan Bolker
Dec 3 '18 at 1:15
$begingroup$
How is topological order defined?
$endgroup$
– William Elliot
Dec 3 '18 at 2:39
add a comment |
$begingroup$
A set S of jobs can be ordered by writing x≤y to mean that iether x = y or x must be done before y, for all x and y in S. given the hasse diagram, for this relation for a particular set S of jobs, show the following:
a) minimal,least,maximal and greatest elements
b) topological sort.
My answer:
a)
minimal: 1,9,2
maximal: 3
least: none
greatest:3
b)
topological order: (1,9,2,10,6,8,5,7,4,3)
Is this correct? or am i completely off
discrete-mathematics proof-verification order-theory
edited Dec 3 '18 at 1:14
Ethan Bolker
42.1k548111
asked Dec 3 '18 at 1:12
MasterYoshiMasterYoshi
606
$endgroup$
A set S of jobs can be ordered by writing x≤y to mean that iether x = y or x must be done before y, for all x and y in S. given the hasse diagram, for this relation for a particular set S of jobs, show the following:
a) minimal,least,maximal and greatest elements
b) topological sort.
My answer:
a)
minimal: 1,9,2
maximal: 3
least: none
greatest:3
b)
topological order: (1,9,2,10,6,8,5,7,4,3)
Is this correct? or am i completely off
discrete-mathematics proof-verification order-theory
discrete-mathematics proof-verification order-theory
edited Dec 3 '18 at 1:14
Ethan Bolker
42.1k548111
asked Dec 3 '18 at 1:12
MasterYoshiMasterYoshi
606
edited Dec 3 '18 at 1:14
Ethan Bolker
42.1k548111
asked Dec 3 '18 at 1:12
MasterYoshiMasterYoshi
606
edited Dec 3 '18 at 1:14
Ethan Bolker
42.1k548111
edited Dec 3 '18 at 1:14
Ethan Bolker
42.1k548111
edited Dec 3 '18 at 1:14
Ethan Bolker
42.1k548111
42.1k548111
asked Dec 3 '18 at 1:12
MasterYoshiMasterYoshi
606
asked Dec 3 '18 at 1:12
MasterYoshiMasterYoshi
606
asked Dec 3 '18 at 1:12
MasterYoshiMasterYoshi
606
606
2
$begingroup$
Looks OK to me.
$endgroup$
– Ethan Bolker
Dec 3 '18 at 1:15
$begingroup$
How is topological order defined?
$endgroup$
– William Elliot
Dec 3 '18 at 2:39
add a comment |
2
$begingroup$
Looks OK to me.
$endgroup$
– Ethan Bolker
Dec 3 '18 at 1:15
$begingroup$
How is topological order defined?
$endgroup$
– William Elliot
Dec 3 '18 at 2:39
2
2
$begingroup$
Looks OK to me.
$endgroup$
– Ethan Bolker
Dec 3 '18 at 1:15
$begingroup$
Looks OK to me.
$endgroup$
– Ethan Bolker
Dec 3 '18 at 1:15
$begingroup$
How is topological order defined?
$endgroup$
– William Elliot
Dec 3 '18 at 2:39
$begingroup$
How is topological order defined?
$endgroup$
– William Elliot
Dec 3 '18 at 2:39
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
},
noCode: 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%2fmath.stackexchange.com%2fquestions%2f3023465%2fhasse-diagram-max-greatest-topological-sort%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics 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.
Use MathJax to format equations. MathJax reference.
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%2fmath.stackexchange.com%2fquestions%2f3023465%2fhasse-diagram-max-greatest-topological-sort%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
2
$begingroup$
Looks OK to me.
$endgroup$
– Ethan Bolker
Dec 3 '18 at 1:15
$begingroup$
How is topological order defined?
$endgroup$
– William Elliot
Dec 3 '18 at 2:39