651
edits
| No edit summary | No edit summary | ||
| Line 173: | Line 173: | ||
| |[[Digraphs]] | |[[Digraphs]] | ||
| |A directed graph, also called a digraph, is a graph in which the edges have a direction. | |A directed graph, also called a digraph, is a graph in which the edges have a direction. | ||
| |ref | |||
| |- | |||
| |36 | |||
| |[[Reachability Matrix]] | |||
| |Reachability refers to the ability to get from one vertex to another within a graph. | |||
| |ref | |ref | ||
| |- | |- | ||