Content deleted Content added
ShelfSkewed (talk | contribs) m Disambiguate edges to edge (geometry) |
|||
Line 3:
In [[graph theory]] a '''process-graph''' is a [[directed graph|directed]] [[bipartite graph]] used in [[workflow]] [[Conceptual model|modeling]].
The [[vertex (graph theory)|vertices]] of the [[graph]] are of two types, operation (O) and material (M). The two vertex types form two [[disjunctive]] [[set (mathematics)|set]]s. The [[edge (geometry)|edges]] of the graph link the O and M vertices. An edge from an operation vertex (O) connects to a material vertex (M) if M is the output of O, such as a 'document' (material) that is output by a 'write-up' (operation). An edge from M to O indicates that M is an element of the input set of O, e.g. a document may be part of the input to a 'review' operation.
==References==
| |||