|
A higraph is a diagramming object that formalizes relations into a visual structure, it was developed by David Harel in 1988. Higraphs extend mathematical graphs by including notions of depth and orthogonality. In particular, nodes in a higraph can contain other nodes inside them, creating a hierarchy. The idea was initially developed for applications to databases, knowledge representation, and the behavioral specification of complex concurrent systems using the higraph-based language of statecharts. Higraphs are widely used in industrial applications like UML. Recently they have been used by philosophers to formally study the use of diagrams in mathematical proofs and reasoning. == References == * * Grossman, O., Harel, D. (1997), ''On the Algorithmics of Higraphs'', Technical Report, Rehovot, Israel * http://plato.stanford.edu/entries/diagrams/ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Higraph」の詳細全文を読む スポンサード リンク
|