31. The adjacency matrix of a directed graph is unique up to identical permutation of rows and columns. 32. Transforming an undirected graph into an equivalent directed graph is very easy, if you think about it. 33. The analysis is done using the directed graphs ( see Sporns, O . ( 2007 ) ). 34. A time-based DSM is akin to a precedence diagram or the matrix representation of a directed graph . 35. In directed graphs , the two nodes that a branch connects to are designated the source and target nodes. 36. The anti-foundation axiom postulates that each such directed graph corresponds to the membership structure of a unique set. 37. Signal-flow graphs are weighted, directed graphs . 38. A rewriting system can be expressed as a directed graph in which nodes represent expressions and edges represent rewrites. 39. Transition systems coincide mathematically with abstract rewriting systems ( as explained further in this article ) and directed graphs . 40. Many of the APSP algorithms highlighted specify that they are for directed graphs . eg . the Floyd-Warshall algorithm.
