use small constant number of decorations thusthe decorable position methods will run in ( worst-case time no matter how we implement the embedded map code fragment an interface defining an adt for decorable positions note that we don' use generic parameterized types for the inherited map methodssince we don' know in advance the types of the decorations and we want to allow for objects of many different types as decorations using decorable positionsthe complete dfs traversal algorithm can be described in more detailas shown in code fragment code fragment dfs on graph with decorable edges and vertices generic dfs implementation in java