Combinatorics Graph theory: basic notions Concept
Directed graph
Summary
A directed graph is a set of vertices with arrows between some ordered pairs of vertices. Directed graphs model one-way relations such as links, flows and dependencies. The node directed graph gives the precise definition.
Where this leads
8 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Directed_graph, Definition
About this page
| Tag | 0KFYGSHHF5 |
|---|---|
| URI | m2://0KFYGSHHF5 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C20 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Special cases
Definitions
Used by
- Leavitt path algebra
- Free category
- Bayesian network
- Lindström–Gessel–Viennot lemma
- Schreier coset graph
- Irreducible matrix
- Quiver