Associate vertex coordinates and labelsHow to add vertex/edge labels to existing graphPlace graph vertex...
Why is Shelob considered evil?
How to achieve physical gender equality?
Boss asked me to sign a resignation paper without a date on it along with my new contract
Taking an academic pseudonym?
Aligning Systems of Equations
Are all power cords made equal?
How can changes in personality/values of a person who turned into a vampire be explained?
How can I differentiate duration vs starting time
Why is the meaning of kanji 閑 "leisure"?
Is corrosion inhibitor paste conductive?
Using font-relative distances in tikzpictures
The Late Queen Gives in to Remorse - Reverse Hangman
Cryptic cross... with words
Coworker is trying to get me to sign his petition to run for office. How to decline politely?
Why is Bernie Sanders maximum accepted donation on actblue $5600?
How can I create unencrypted addresses?
Build ASCII Podiums
How bad is a Computer Science course that doesn't teach Design Patterns?
Almost normal subgroups: Is there any notion which is weaker than normal subgroup?
Which was the first story to feature space elevators?
Why didn't Lorentz conclude that no object can go faster than light?
Multiplying elements of a list
What is formjacking?
How should I ship cards?
Associate vertex coordinates and labels
How to add vertex/edge labels to existing graphPlace graph vertex labels in circlesExtracting vertex coordinates from an automatically laid out graphCalculating the median difference between elements with a (particular pair) of consecutive integer indices residing in the same sublistVertex labels versus vertex names in VertexRenderingFunctionVertex Names as Labels in GraphPlotsVertices overlap with vertex labelsPermutations on graph vertex labelsVertex labels of graph: {index,weight}Positioning of vertex labels on graph
$begingroup$
This sounds easy (in which case I will delete my question) and maybe I am getting a bit tired, but I can't find an easy way to create a list from an automatically-generated graph where vertices labels and coordinates are associated, e.g. {index_vertex, {x,y}}
.
From this image...
...here is my code so far:
image = Import["https://i.stack.imgur.com/5ZNrE.png"];
mask = FillingTransform[Thinning[Binarize[ColorReplace[image, White -> Black, .055], 0]], CornerNeighbors -> True];
skel = Thinning[mask];
morphograph = MorphologicalGraph[skel, VertexSize -> 2, VertexLabels -> "Index"];
newtreegraph = TreeGraph[DeleteCases[EdgeList[morphograph], x_ [UndirectedEdge] x_], VertexCoordinates -> GraphEmbedding[morphograph], VertexSize -> 5, VertexLabels -> "Index"]
that generates this nice TreeGraph
From that, I can obtain the EdgeList
and vertices coordinates via GraphEmbedding
but cannot easily connect the two... There must be an easy way I can't find ... Thanks
list-manipulation graphs-and-networks
$endgroup$
add a comment |
$begingroup$
This sounds easy (in which case I will delete my question) and maybe I am getting a bit tired, but I can't find an easy way to create a list from an automatically-generated graph where vertices labels and coordinates are associated, e.g. {index_vertex, {x,y}}
.
From this image...
...here is my code so far:
image = Import["https://i.stack.imgur.com/5ZNrE.png"];
mask = FillingTransform[Thinning[Binarize[ColorReplace[image, White -> Black, .055], 0]], CornerNeighbors -> True];
skel = Thinning[mask];
morphograph = MorphologicalGraph[skel, VertexSize -> 2, VertexLabels -> "Index"];
newtreegraph = TreeGraph[DeleteCases[EdgeList[morphograph], x_ [UndirectedEdge] x_], VertexCoordinates -> GraphEmbedding[morphograph], VertexSize -> 5, VertexLabels -> "Index"]
that generates this nice TreeGraph
From that, I can obtain the EdgeList
and vertices coordinates via GraphEmbedding
but cannot easily connect the two... There must be an easy way I can't find ... Thanks
list-manipulation graphs-and-networks
$endgroup$
add a comment |
$begingroup$
This sounds easy (in which case I will delete my question) and maybe I am getting a bit tired, but I can't find an easy way to create a list from an automatically-generated graph where vertices labels and coordinates are associated, e.g. {index_vertex, {x,y}}
.
From this image...
...here is my code so far:
image = Import["https://i.stack.imgur.com/5ZNrE.png"];
mask = FillingTransform[Thinning[Binarize[ColorReplace[image, White -> Black, .055], 0]], CornerNeighbors -> True];
skel = Thinning[mask];
morphograph = MorphologicalGraph[skel, VertexSize -> 2, VertexLabels -> "Index"];
newtreegraph = TreeGraph[DeleteCases[EdgeList[morphograph], x_ [UndirectedEdge] x_], VertexCoordinates -> GraphEmbedding[morphograph], VertexSize -> 5, VertexLabels -> "Index"]
that generates this nice TreeGraph
From that, I can obtain the EdgeList
and vertices coordinates via GraphEmbedding
but cannot easily connect the two... There must be an easy way I can't find ... Thanks
list-manipulation graphs-and-networks
$endgroup$
This sounds easy (in which case I will delete my question) and maybe I am getting a bit tired, but I can't find an easy way to create a list from an automatically-generated graph where vertices labels and coordinates are associated, e.g. {index_vertex, {x,y}}
.
From this image...
...here is my code so far:
image = Import["https://i.stack.imgur.com/5ZNrE.png"];
mask = FillingTransform[Thinning[Binarize[ColorReplace[image, White -> Black, .055], 0]], CornerNeighbors -> True];
skel = Thinning[mask];
morphograph = MorphologicalGraph[skel, VertexSize -> 2, VertexLabels -> "Index"];
newtreegraph = TreeGraph[DeleteCases[EdgeList[morphograph], x_ [UndirectedEdge] x_], VertexCoordinates -> GraphEmbedding[morphograph], VertexSize -> 5, VertexLabels -> "Index"]
that generates this nice TreeGraph
From that, I can obtain the EdgeList
and vertices coordinates via GraphEmbedding
but cannot easily connect the two... There must be an easy way I can't find ... Thanks
list-manipulation graphs-and-networks
list-manipulation graphs-and-networks
edited 5 hours ago
Henrik Schumacher
54k472149
54k472149
asked 5 hours ago
ValacarValacar
496213
496213
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Do you mean this?
AssociationThread[
VertexList[newtreegraph],
PropertyValue[newtreegraph, VertexCoordinates]
]
<|1 -> {677.5, 957.5}, 8 -> {677.5, 953.5}, <<459>>, 455 -> {300.5, 84.5}|>
$endgroup$
1
$begingroup$
Instead ofPropertyValue[newtreegraph, VertexCoordinates]
you can also useGraphEmbedding[newtreegraph]
.
$endgroup$
– Szabolcs
1 hour ago
add a comment |
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: "387"
};
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%2fmathematica.stackexchange.com%2fquestions%2f191935%2fassociate-vertex-coordinates-and-labels%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
$begingroup$
Do you mean this?
AssociationThread[
VertexList[newtreegraph],
PropertyValue[newtreegraph, VertexCoordinates]
]
<|1 -> {677.5, 957.5}, 8 -> {677.5, 953.5}, <<459>>, 455 -> {300.5, 84.5}|>
$endgroup$
1
$begingroup$
Instead ofPropertyValue[newtreegraph, VertexCoordinates]
you can also useGraphEmbedding[newtreegraph]
.
$endgroup$
– Szabolcs
1 hour ago
add a comment |
$begingroup$
Do you mean this?
AssociationThread[
VertexList[newtreegraph],
PropertyValue[newtreegraph, VertexCoordinates]
]
<|1 -> {677.5, 957.5}, 8 -> {677.5, 953.5}, <<459>>, 455 -> {300.5, 84.5}|>
$endgroup$
1
$begingroup$
Instead ofPropertyValue[newtreegraph, VertexCoordinates]
you can also useGraphEmbedding[newtreegraph]
.
$endgroup$
– Szabolcs
1 hour ago
add a comment |
$begingroup$
Do you mean this?
AssociationThread[
VertexList[newtreegraph],
PropertyValue[newtreegraph, VertexCoordinates]
]
<|1 -> {677.5, 957.5}, 8 -> {677.5, 953.5}, <<459>>, 455 -> {300.5, 84.5}|>
$endgroup$
Do you mean this?
AssociationThread[
VertexList[newtreegraph],
PropertyValue[newtreegraph, VertexCoordinates]
]
<|1 -> {677.5, 957.5}, 8 -> {677.5, 953.5}, <<459>>, 455 -> {300.5, 84.5}|>
answered 5 hours ago
Henrik SchumacherHenrik Schumacher
54k472149
54k472149
1
$begingroup$
Instead ofPropertyValue[newtreegraph, VertexCoordinates]
you can also useGraphEmbedding[newtreegraph]
.
$endgroup$
– Szabolcs
1 hour ago
add a comment |
1
$begingroup$
Instead ofPropertyValue[newtreegraph, VertexCoordinates]
you can also useGraphEmbedding[newtreegraph]
.
$endgroup$
– Szabolcs
1 hour ago
1
1
$begingroup$
Instead of
PropertyValue[newtreegraph, VertexCoordinates]
you can also use GraphEmbedding[newtreegraph]
.$endgroup$
– Szabolcs
1 hour ago
$begingroup$
Instead of
PropertyValue[newtreegraph, VertexCoordinates]
you can also use GraphEmbedding[newtreegraph]
.$endgroup$
– Szabolcs
1 hour ago
add a comment |
Thanks for contributing an answer to Mathematica 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%2fmathematica.stackexchange.com%2fquestions%2f191935%2fassociate-vertex-coordinates-and-labels%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