Template talk:Infobox graph

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Describe the process that identifies the paths that: (a) visits every edge (b) visits every vertex (c) identifies the shortest root between two vertices41.77.79.206 (talk) 07:35, 23 October 2013 (UTC)