Digraphs: Difference between revisions
Jump to navigation
Jump to search
(Created page with "A '''digraph''' is a directed graph; a graph in which the edges have a direction. This is usually indicated with an arrow on the edge. The formal definition is: If v and w...") |
No edit summary |
||
| Line 2: | Line 2: | ||
This is usually indicated with an arrow on the edge. | This is usually indicated with an arrow on the edge. | ||
A Digraph portrays a [[Contextual Relation]] among the elementsof the system and can be converted into an [[Interpretive Structural Model of the system with respect to that relation. | |||
The formal definition is: | The formal definition is: | ||
If v and w are vertices, an edge is an unordered pair {v,w}, while a directed edge, called an arc, is an ordered pair (v,w) or (w,v). | If v and w are vertices, an edge is an unordered pair {v,w}, while a directed edge, called an arc, is an ordered pair (v,w) or (w,v). | ||
Revision as of 11:11, 9 January 2022
A digraph is a directed graph; a graph in which the edges have a direction.
This is usually indicated with an arrow on the edge.
A Digraph portrays a Contextual Relation among the elementsof the system and can be converted into an [[Interpretive Structural Model of the system with respect to that relation.
The formal definition is: If v and w are vertices, an edge is an unordered pair {v,w}, while a directed edge, called an arc, is an ordered pair (v,w) or (w,v).