August 2019
Beginner to intermediate
798 pages
17h 2m
English
A graph (G (V, E)) is a finite, nonempty set of vertices (V) (or nodes) and a set of edges (E). There are two main types of graphs: cyclic graphs and acyclic graphs. A cyclic graph is a graph where all or a number of its vertices are connected in a closed chain. In acyclic graphs, there are not any closed chains.
A directed graph is a graph with edges that have a direction associated with them, while a directed acyclic graph is a directed graph with no cycles in it.
Read now
Unlock full access