Difference between revisions of "Digraph"
From Maths
(Created page with ":: '''Short for: ''Directed graph''''' {{Stub page|grade=B|msg=Demote once terminology has been added}} __TOC__ {{Infobox|title=Digraph|image=File:TypicalDigraph.png|thumb|T...") |
(No difference)
|
Revision as of 10:39, 5 June 2017
- Short for: Directed graph
Stub grade: B
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Demote once terminology has been added
Contents
| Digraph | |
Definition
STUB VERSION:
[ilmath](V,E)[/ilmath][1] for finite set of vertices [ilmath]V[/ilmath] and [ilmath]E[/ilmath] are edges of the form [ilmath](v_i,v_j)[/ilmath] - notice an ordered pair, interpreted as from [ilmath]v_i[/ilmath] to [ilmath]v_j[/ilmath], or elements of [ilmath]E[/ilmath] have the form [ilmath]\big((v_i,v_j),d_{i,j}\big)[/ilmath] where [ilmath]d_{i,j} [/ilmath] is some associated data.
This does not cover the case where multiple edges from the same two vertices in the same order possibly even with the same data occur, that needs to be sorted as it happens frequently.
Notes
References
- ↑ That formal languages and automata hardbook by my bed, deal with later.
