0 votes 0 votes Let G be a directed graph whose vertex set contains numbers from 1 to 1024. There is an edge from a vertex i to a vertex j iff either j=i+1 or j=3i. The minimum number of edges in the path from vertex 1 to vertex 100 is------- # answer is 7 BOB asked Jan 1, 2019 • edited Jan 1, 2019 by BOB BOB 579 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shaik Masthan commented Jan 2, 2019 reply Follow Share 100 ----99----33----11------10------9----3----1 Read in backward 0 votes 0 votes Peeyush Pandey commented Jan 2, 2019 reply Follow Share Read the discussion here: https://gateoverflow.in/3817/gate2005-it-56 0 votes 0 votes Please log in or register to add a comment.
