Vous avez cherché: subgraph (Anglais - Arabe)

subgraph
رسم بياني فرعي

mcs is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure).
mcs is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure).

depth-first search yields valuable information about the structure of a graph. perhaps the most basic property of depth-first search is that the predecessor subgraph g does indeed form a forest of trees, since the structure of the depthfirst trees exactly mirrors the structure of recursive calls of dfs-visit.that is, u d : if and only if dfs-visit.g;/ was called during a search of u’s adjacency list. additionally, vertex  is a descendant of vertex u in the depth-first forest if and only if  is discovered during the time in which u is gray. another important property of depth-first search is that discovery and finishing times have parenthesis structure. if we represent the discovery of vertex u with a left parenthesis “.u” and represent its finishing by a right parenthesis “u/”, then the history of discoveries and finishings makes a well-formed expression in the sense that the parentheses are properly nested. for example, the depth-first search of figure 22.5(a) corresponds to the parenthesization shown in figure 22.5(b). the following theorem provides another way to characterize the parenthesis structure.traversal (practice):
التقاطع الداخلي (الممارسة): التقاطع الداخلي (الممارسة):