[sage-support] Route inspection problem

[Jori Mäntysalo]

I was walking at 
https://kintulammi.fi/wp-content/uploads/Kintulammi_Opaskartta.jpg and 
hence wondered if Sagemath has a function to solve 
https://en.wikipedia.org/wiki/Route_inspection_problem . Didn't found any, 
is it hidden with some other name or module?


--
Jori Mäntysalo

Re: [sage-support] Are they equivalent ?

[Jori Mäntysalo]

On Sun, 1 Apr 2018, Henri Girard wrote:

I am surprise because graph is different it should n't because the adjacency 
matrix is the same ?


They are:

sage: W = graphs.WheelGraph(4)
sage: H = Graph(W.adjacency_matrix ())
sage: W == H
True

However, for almost every built-in graph or graph family Sage also knows 
some "nice" way to draw it. For other graphs it tries to found a "nice" 
drawing by partly randomized algorithm.


You can also try

H.show(layout='planar')

--
Jori Mäntysalo

[sage-support] Are they equivalent ?

[Henri Girard]

I am surprise because graph is different it should n't because the 
adjacency matrix is the same ?



W=graphs.WheelGraph(4);W.show();W.adjacency_matrix ()

0000

H=Graph(W.adjacency_matrix ());H.show();H.adjacency_matrix ()

--
You received this message because you are subscribed to the Google Groups 
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send email to sage-support@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.