The logical structure of FIG.
Relationship "many to many" between the nodes in FIG node, described by way of collection.
- FIG definitions of basic terms and
FIG defined
representation of FIG.
FIG represents the symbolic representation of words, may be graphically described, there are two forms:
1) a set of said: For a graph G, if it is referred to as G = <V, E>, and write E and V set of said set is called a representation of FIG.
2) graphical representation: V represents the node with the smaller circle with the points u v directional line segment directed edges <u, v>; undirected segment undirected edges (u, v), referred to in FIG. graphical representation.
FIG basic terminology
strong graph: In a directed graph, if for each pair of vertices vi and vj, there is a path from vi to vj and vj path from the vi, this figure is called strongly connected graph.
Strongly connected components: extremely strongly connected subgraph which are not strongly connected graph. Only a strong graph strongly connected component, i.e. of its own; non-strongly connected to a plurality of strongly connected components FIG.
If T is a spanning tree of G if and only if T satisfies the following conditions:
- T is a connected subgraph of G;
- T contains all vertices of G;
- T is loop-free.
- FIG operational definition of
