41. When required to have a single exit, flow graphs have two properties not shared with directed graphs in general. 42. The latter are bidirected graphs, not directed graphs ( except in the trivial case of all positive signs ). 43. The remainder of this article focuses on the more difficult problem of determining pairwise reachability in a directed graph . 44. Undirected graphs often use the latter convention of counting loops twice, whereas directed graphs typically use the former convention. 45. A query plan is a directed graph where the nodes are operators and the edges describe the processing flow. 46. When the input and output alphabet are both, one can also associate to a Mealy Automata an Helix directed graph . 47. Think of the components as nodes of a directed graph : each one has a specific task on the data. 48. Transitive subgroups of S _ n form a directed graph : one group can be a subgroup of several groups. 49. If the relation is interpreted as a directed graph , this is the same thing as the transpose of the graph. 50. The Floyd Warshall algorithm can be used to find the shortest paths between all pairs of vertices in weighted directed graphs .
