Figure 10.1 and some drawings and models
The type of graph
1. FIG Simple (Simple graph): no edge weight, no no loopback to FIG
2. FIG multiple (Multigraph): There are no multiple edges to FIG
3. FIG pseudo / loopback FIG (Pseudograph): with self- acyclic directed graph
4. the simple directed graph (simple directed graph): no edge weight, the rings are free from FIG
5. FIG directed multiple (directed multigraph): there has multiple edges to FIG.
6. FIG complex (Mixed graph): both have the edge, there are no plans to edge
Some models map
Figure 1. relationships:
2. Influence Diagrams:
Figure 3. Call:
4. FIG module dependencies
5. FIG priority and Concurrency
6. round robin
