The longest (s,t)-path problem on supergrid graphs is known to be NP-complete. However, the complexity of this with or without holes still unknown.In past, we presented linear-time algorithms for solving L-shaped and C-shaped graphs, which form subclasses holes. In paper, will determine O-shaped a subclass These are rectangular It worth noting that contain as subgraphs, but there no inclusion r...