At the ODP level our tool shows a graph whose nodes represent patterns and key concepts (\(\mathcal {P} \cup \mathcal {K}\) ) and edges show their relations. A Key-concept node \(K\in \mathcal {K}\) , which corresponds to a class in \(\mathcal {G}\) , is connected to a pattern node \(P\)  through a relation hasView if \(K\)  is a class in \(implementation_\mathcal {G}(P)\) . Patterns are also interconnected by OPLa [1]} relations (e.g. opla:specializationOfPattern – in the tool URIs are substituted with user-friendly descriptions).
