https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.euler.eulerize.html
Essentially you need eulerize the subgraph and then find a Euler circuit. The circuit is the route each surveyor needs to take. Both of them are linear time algorithms. best, Dilawar 17 May 2021 02:47:06 datameet@googlegroups.com: > after the partitions, you can use > https://github.com/brooksandrew/postman_problems > > > best, > Dilawar -- Datameet is a community of Data Science enthusiasts in India. Know more about us by visiting http://datameet.org --- You received this message because you are subscribed to the Google Groups "datameet" group. To unsubscribe from this group and stop receiving emails from it, send an email to datameet+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/datameet/87891129-be58-4162-8756-578707ad8a3f%40gmail.com.
signature.asc
Description: PGP signature
