Time complexity of undirected graph
0
$begingroup$
What will be the Efficient way to find the degree of the specified vertex in an undirected graph (V,E)?
I'm thinking of O(|E|)
graph-theory algorithms
asked Dec 18 '18 at 23:04
JuneJune
122
$endgroup$
add a comment |
0
$begingroup$
What will be the Efficient way to find the degree of the specified vertex in an undirected graph (V,E)?
I'm thinking of O(|E|)
graph-theory algorithms
asked Dec 18 '18 at 23:04
JuneJune
122
$endgroup$
3
$begingroup$
It depends on the representation of the graph. You can design natural representations that take O(|E|), O(|V|), or O(1) time.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:08
$begingroup$
ohh I can use O(|V|) also, that means I'm right with O(|E|) ?
$endgroup$
– June
Dec 18 '18 at 23:10
1
$begingroup$
Without knowing the representation of the graph, we can't answer. I think O(|E|) is the worst complexity for any reasonable representation, but one can definitely come up with representations that are much worse.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:20
$begingroup$
got it thank you
$endgroup$
– June
Dec 18 '18 at 23:21
add a comment |
0
0
0
$begingroup$
What will be the Efficient way to find the degree of the specified vertex in an undirected graph (V,E)?
I'm thinking of O(|E|)
graph-theory algorithms
asked Dec 18 '18 at 23:04
JuneJune
122
$endgroup$
What will be the Efficient way to find the degree of the specified vertex in an undirected graph (V,E)?
I'm thinking of O(|E|)
graph-theory algorithms
graph-theory algorithms
asked Dec 18 '18 at 23:04
JuneJune
122
asked Dec 18 '18 at 23:04
JuneJune
122
asked Dec 18 '18 at 23:04
JuneJune
122
asked Dec 18 '18 at 23:04
JuneJune
122
asked Dec 18 '18 at 23:04
JuneJune
122
122
3
$begingroup$
It depends on the representation of the graph. You can design natural representations that take O(|E|), O(|V|), or O(1) time.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:08
$begingroup$
ohh I can use O(|V|) also, that means I'm right with O(|E|) ?
$endgroup$
– June
Dec 18 '18 at 23:10
1
$begingroup$
Without knowing the representation of the graph, we can't answer. I think O(|E|) is the worst complexity for any reasonable representation, but one can definitely come up with representations that are much worse.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:20
$begingroup$
got it thank you
$endgroup$
– June
Dec 18 '18 at 23:21
add a comment |
3
$begingroup$
It depends on the representation of the graph. You can design natural representations that take O(|E|), O(|V|), or O(1) time.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:08
$begingroup$
ohh I can use O(|V|) also, that means I'm right with O(|E|) ?
$endgroup$
– June
Dec 18 '18 at 23:10
1
$begingroup$
Without knowing the representation of the graph, we can't answer. I think O(|E|) is the worst complexity for any reasonable representation, but one can definitely come up with representations that are much worse.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:20
$begingroup$
got it thank you
$endgroup$
– June
Dec 18 '18 at 23:21
3
3
$begingroup$
It depends on the representation of the graph. You can design natural representations that take O(|E|), O(|V|), or O(1) time.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:08
$begingroup$
It depends on the representation of the graph. You can design natural representations that take O(|E|), O(|V|), or O(1) time.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:08
$begingroup$
ohh I can use O(|V|) also, that means I'm right with O(|E|) ?
$endgroup$
– June
Dec 18 '18 at 23:10
$begingroup$
ohh I can use O(|V|) also, that means I'm right with O(|E|) ?
$endgroup$
– June
Dec 18 '18 at 23:10
1
1
$begingroup$
Without knowing the representation of the graph, we can't answer. I think O(|E|) is the worst complexity for any reasonable representation, but one can definitely come up with representations that are much worse.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:20
$begingroup$
Without knowing the representation of the graph, we can't answer. I think O(|E|) is the worst complexity for any reasonable representation, but one can definitely come up with representations that are much worse.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:20
$begingroup$
got it thank you
$endgroup$
– June
Dec 18 '18 at 23:21
$begingroup$
got it thank you
$endgroup$
– June
Dec 18 '18 at 23:21
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
});
}
});
draft saved
draft discarded
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%2f3045816%2ftime-complexity-of-undirected-graph%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
draft saved
draft discarded
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.
draft saved
draft discarded
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%2f3045816%2ftime-complexity-of-undirected-graph%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
3
$begingroup$
It depends on the representation of the graph. You can design natural representations that take O(|E|), O(|V|), or O(1) time.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:08
$begingroup$
ohh I can use O(|V|) also, that means I'm right with O(|E|) ?
$endgroup$
– June
Dec 18 '18 at 23:10
1
$begingroup$
Without knowing the representation of the graph, we can't answer. I think O(|E|) is the worst complexity for any reasonable representation, but one can definitely come up with representations that are much worse.
$endgroup$
– WhatToDo
Dec 18 '18 at 23:20
$begingroup$
got it thank you
$endgroup$
– June
Dec 18 '18 at 23:21