Why the following works only with integers and if other names of vertices are used UndirectedEdge is needed?
{Graph[{{1, 2}, {2, 3}, {3, 1}}], Graph[{{a, b}, {b, c}, {c, a}}],
Graph[UndirectedEdge @@@ {{a, b}, {b, c}, {c, a}}]} // Row
$\begingroup$
$\endgroup$
2
-
4$\begingroup$ This is not a documented syntax. If you use it, you are risking that your code will break in the future. A bit of experimentation does reveal that with this syntax one must use vertex indices, not names. $\endgroup$Szabolcs– Szabolcs2024-03-21 20:05:34 +00:00Commented Mar 21, 2024 at 20:05
-
1$\begingroup$ related Q/As: converting list of ordered pairs to graph and Union of list with logical rules for combination $\endgroup$kglr– kglr2024-03-21 20:06:23 +00:00Commented Mar 21, 2024 at 20:06
Add a comment
|