# bidirected graph造句

## 例句与造句

- The latter are
*bidirected graphs*, not directed graphs ( except in the trivial case of all positive signs ). - For the correspondence between
*bidirected graphs*and skew-symmetric graphs ( i . e ., their double covering graphs ) see, Section 5, or. - The " directed " edges are the same as ordinary directed edges in a directed graph; thus, a directed graph is a special kind of
*bidirected graph*. - Skew-symmetric graphs were first introduced under the name of " antisymmetrical digraphs " by, later as the double covering graphs of polar graphs by, and still later as the double covering graphs of
*bidirected graphs*by. - A closely related concept is the
*bidirected graph*of ( " polarized graph " in the terminology of, ), a graph in which each of the two ends of each edge may be either a head or a tail, independently of the other end. - It's difficult to find
*bidirected graph*in a sentence. 用*bidirected graph*造句挺难的 - A
*bidirected graph*may be interpreted as a polar graph by letting the partition of edges at each vertex be determined by the partition of endpoints at that vertex into heads and tails; however, swapping the roles of heads and tails at a single vertex ( " switching " the vertex, in the terminology of ) produces a different bidirected graph but the same polar graph. - A bidirected graph may be interpreted as a polar graph by letting the partition of edges at each vertex be determined by the partition of endpoints at that vertex into heads and tails; however, swapping the roles of heads and tails at a single vertex ( " switching " the vertex, in the terminology of ) produces a different
*bidirected graph*but the same polar graph.