Checking if Neo4j graph is coherent
I want to check if all my nodes in Neo4j database are coherently connected.
This means there should be only one graph, in which all nodes are. So there should be no seperate graphs.
How could I check this? I already searched in forum, but sadly didnt find a suitable answer for me. Also it should be a scalable and performant solution.
Thank you in advance!
graph neo4j cql
asked Nov 25 '18 at 21:05
marcels93marcels93
162
add a comment |
I want to check if all my nodes in Neo4j database are coherently connected.
This means there should be only one graph, in which all nodes are. So there should be no seperate graphs.
How could I check this? I already searched in forum, but sadly didnt find a suitable answer for me. Also it should be a scalable and performant solution.
Thank you in advance!
graph neo4j cql
asked Nov 25 '18 at 21:05
marcels93marcels93
162
Possible duplicate of Neo4j - extract all subgraphs from neo4j database
– Guy Coder
Nov 25 '18 at 21:16
I know the OP probably does not know that separate graphs are know as partitions, but once that is known, as I just noted, it should be obvious that the question is a duplicate. So if there is only one sub-graph then it would be coherent.
– Guy Coder
Nov 25 '18 at 21:17
THanks for the answer. I whink I can derive my solution from this. But could you tell me how to include that algo.unionFind procedure into neo4j? Because it doesnt seem to know this procedure on my system
– marcels93
Nov 25 '18 at 21:52
See: The Neo4j Graph Algorithms User Guide v3.4 1.2. Installation
– Guy Coder
Nov 25 '18 at 21:57
add a comment |
I want to check if all my nodes in Neo4j database are coherently connected.
This means there should be only one graph, in which all nodes are. So there should be no seperate graphs.
How could I check this? I already searched in forum, but sadly didnt find a suitable answer for me. Also it should be a scalable and performant solution.
Thank you in advance!
graph neo4j cql
asked Nov 25 '18 at 21:05
marcels93marcels93
162
I want to check if all my nodes in Neo4j database are coherently connected.
This means there should be only one graph, in which all nodes are. So there should be no seperate graphs.
How could I check this? I already searched in forum, but sadly didnt find a suitable answer for me. Also it should be a scalable and performant solution.
Thank you in advance!
graph neo4j cql
graph neo4j cql
asked Nov 25 '18 at 21:05
marcels93marcels93
162
asked Nov 25 '18 at 21:05
marcels93marcels93
162
asked Nov 25 '18 at 21:05
marcels93marcels93
162
asked Nov 25 '18 at 21:05
marcels93marcels93
162
asked Nov 25 '18 at 21:05
marcels93marcels93
162
162
Possible duplicate of Neo4j - extract all subgraphs from neo4j database
– Guy Coder
Nov 25 '18 at 21:16
I know the OP probably does not know that separate graphs are know as partitions, but once that is known, as I just noted, it should be obvious that the question is a duplicate. So if there is only one sub-graph then it would be coherent.
– Guy Coder
Nov 25 '18 at 21:17
THanks for the answer. I whink I can derive my solution from this. But could you tell me how to include that algo.unionFind procedure into neo4j? Because it doesnt seem to know this procedure on my system
– marcels93
Nov 25 '18 at 21:52
See: The Neo4j Graph Algorithms User Guide v3.4 1.2. Installation
– Guy Coder
Nov 25 '18 at 21:57
add a comment |
Possible duplicate of Neo4j - extract all subgraphs from neo4j database
– Guy Coder
Nov 25 '18 at 21:16
I know the OP probably does not know that separate graphs are know as partitions, but once that is known, as I just noted, it should be obvious that the question is a duplicate. So if there is only one sub-graph then it would be coherent.
– Guy Coder
Nov 25 '18 at 21:17
THanks for the answer. I whink I can derive my solution from this. But could you tell me how to include that algo.unionFind procedure into neo4j? Because it doesnt seem to know this procedure on my system
– marcels93
Nov 25 '18 at 21:52
See: The Neo4j Graph Algorithms User Guide v3.4 1.2. Installation
– Guy Coder
Nov 25 '18 at 21:57
Possible duplicate of Neo4j - extract all subgraphs from neo4j database
– Guy Coder
Nov 25 '18 at 21:16
Possible duplicate of Neo4j - extract all subgraphs from neo4j database
– Guy Coder
Nov 25 '18 at 21:16
I know the OP probably does not know that separate graphs are know as partitions, but once that is known, as I just noted, it should be obvious that the question is a duplicate. So if there is only one sub-graph then it would be coherent.
– Guy Coder
Nov 25 '18 at 21:17
I know the OP probably does not know that separate graphs are know as partitions, but once that is known, as I just noted, it should be obvious that the question is a duplicate. So if there is only one sub-graph then it would be coherent.
– Guy Coder
Nov 25 '18 at 21:17
THanks for the answer. I whink I can derive my solution from this. But could you tell me how to include that algo.unionFind procedure into neo4j? Because it doesnt seem to know this procedure on my system
– marcels93
Nov 25 '18 at 21:52
THanks for the answer. I whink I can derive my solution from this. But could you tell me how to include that algo.unionFind procedure into neo4j? Because it doesnt seem to know this procedure on my system
– marcels93
Nov 25 '18 at 21:52
See: The Neo4j Graph Algorithms User Guide v3.4 1.2. Installation
– Guy Coder
Nov 25 '18 at 21:57
See: The Neo4j Graph Algorithms User Guide v3.4 1.2. Installation
– Guy Coder
Nov 25 '18 at 21:57
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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
},
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%2fstackoverflow.com%2fquestions%2f53471980%2fchecking-if-neo4j-graph-is-coherent%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 Stack Overflow!
- 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%2fstackoverflow.com%2fquestions%2f53471980%2fchecking-if-neo4j-graph-is-coherent%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
Possible duplicate of Neo4j - extract all subgraphs from neo4j database
– Guy Coder
Nov 25 '18 at 21:16
I know the OP probably does not know that separate graphs are know as partitions, but once that is known, as I just noted, it should be obvious that the question is a duplicate. So if there is only one sub-graph then it would be coherent.
– Guy Coder
Nov 25 '18 at 21:17
THanks for the answer. I whink I can derive my solution from this. But could you tell me how to include that algo.unionFind procedure into neo4j? Because it doesnt seem to know this procedure on my system
– marcels93
Nov 25 '18 at 21:52
See: The Neo4j Graph Algorithms User Guide v3.4 1.2. Installation
– Guy Coder
Nov 25 '18 at 21:57