Description: The input of integer pair, the output of a graph adjacency matrix. And obtained the degree of each node and the in-degree determine whether it is up to the adjacency matrix matrix, which determine whether a graph chart.
To Search:
- [lisan] - According to plans by the user is given
- [Warshall] - warshall algorithm, often used in engine
File list (Check if you may need any files):
include.doc
Download