On Sun, 1 Apr 2018, Dima Pasechnik wrote:
this is also known as Chinese postman problem. There is a tutorial on doing it
in networkx.
http://brooksandrew.github.io/simpleblog/articles/intro-to-graph-optimization-solving-cpp/
Duh. Was more complicated than I thank. Anyways, thanks; maybe I'll
this is also known as Chinese postman problem. There is a tutorial on doing it
in networkx.
http://brooksandrew.github.io/simpleblog/articles/intro-to-graph-optimization-solving-cpp/
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To
Thank you... Planar do it
Le 01/04/2018 à 07:51, Jori Mäntysalo a écrit :
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
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
