A nonlinear structure: FIG.
FIG from the set of vertices V , set size is n, there may be a correspondence between n vertices, we use to describe this even edge, i.e. the edge E , scale as e.
Abutting relationship : the relationship between the peak to peak; relationships : Relationship edge vertices connected to it. Structural sequence (vector and list) is a special case of FIG., You can define only the relationship between the adjacent portion adjacent dots, and the adjacent portion constituting the relationship, is a special case of the tree structure of FIG only between parent and child nodes, and FIG between any two nodes can constitute a temporary connection relationship.
Second, a directed graph and an undirected graph
If the adjacent vertexes v and u of the order does not matter, if (u, v) is the free edges (undirected edge). All sides are non-directional FIG referred undirected graph. (Undigraph). Conversely, a directed graph (digraph) are both directed edge (directed edge), u, v are referred to as edge (u, v) of the head and tail.
Our main research directed graph, directed graph can be used to describe other figures.
Three , the loop path and
Path: the sequence of vertices of the series in sequential abutting relationship.
Simple path (simple cycle):. No repeating node path wherein the path is not simple (unsimple cycle): path containing node repeats
Loop: v0 = vk: start and end of the path are coincident
Euler Loop: covering all of the edges in the graph.
Hamilton loop:
Fourth, the interface of FIG.
Adjacency matrix: a matrix for the described relationship between the mutually adjacent vertices.