整理了图的常用术语Defined 0x01. FIG.
FIG. (Graph) edged by the apex of a collection of vertices between poor and non-empty, usually expressed as: G (V, E), wherein, G represents a graph, V is the set of vertices of graph G, E is the set of edges in FIG. G.
FIG data elements called a logical relationship between vertices, edges represented by vertex.
Defined 0x02. FIG various
Undirected edges: when the vertex to the
edge between the no direction, is called undirected edges (Edge), even with a disorder of the (
) are represented.
Undirected graph: any edges between the vertices of the two sides are no FIG.
Directed edges: If from the vertex to the
side of a direction, which edges is called directed edge , also called the arc (Arc). Using ordered pair <
> to indicate,
called tail arc,
called the first arc. Directional edge directed arcs from the head end of the arc. ( Undirected edges represented by (), directed edges by <>.)
Digraph: any edges between two vertices are all directed edges FIG.
FIG simple: the absence of its own vertex to the edge, and with an edge is not repeated in FIG.
Undirected complete graph : there is no edge in any direction between two vertices FIG.
FIG entirely directed: there is a direction between any two vertices opposite to each other of the two arcs of the directed graph.
FIG sparse: there are few edges or arcs FIG.
FIG dense: There are many sides or arcs of FIG. (Sparse and dense is a relative concept)
: The right number associated with a side of the figure or arc.
Network: Figure weighted.
Subgraph: Suppose there are two graphs (
{
}),
(
{
}), if
and
is said
to
subgraph.
0x03. The relationship between the vertices and edges
Adjacent point: For no = (V, {E}) , if the edge (directed graph G )
, called vertices
, and
each other abutment points.
And
adjacent.
Associations: edge ( ) attached to the apex
and
, also known associate.
Degree: the degree of the vertex is the number of edges associated with the vertices.
Penetration: a directed graph, the number of arcs for the first vertex is referred to as penetration. (Pointing to the other side of their number)
Out of: a directed graph, the number of vertex is referred to as the tail of the arc. (Pointing to his own number of others)
Path: from the vertex to the
vertex arranged in sequence through a process called path.
Length of the path: a number of arcs or edges on the path.
Loop: the first vertex to the vertex of the last one and the same path as the ring or loop.
Simple path : the path is not repeated sequence of vertex is referred to as simple path.
Simple Loop: except the first and last vertex of a vertex, and the remaining vertex is not repeated loop or simply referred to as a simple ring circuit
0x04. FIG communication concepts
Communication: In the undirected graph, if there is a path vertex to another vertex, called the two vertices are connected.
FIG communication: any two vertices are in communication FIG.
Connected components: no connected components referred to maximal connected subgraph of FIG.
Strong graph: In a directed graph , if for each pair
,
from
to
and from
to
exist paths, called
a strongly connected graph.
Spanning Tree: a connected graph of the minimal connected subgraph, which contains all of the figures n vertices, but only n-1 edges.
Directed tree: if a directed graph with exactly the degree of a vertex is 0, the rest of the vertices are 1, then there is a directed graph is a directed tree trees.
Forest generated: by a number of trees of the tree, containing all vertices of the graph, but only enough to constitute a plurality of disjoint trees arc directed tree.
