given positive integer n, generate simple directed graph n vertices producing adjacency matrix graph simple directed graphs n vertices equally generated.
what "all simple directed graphs n vertices equally generated" mean ?
imo, question badly phrased. if know answer obvious, if don't, cannot understand question. essentially, question asks following:
1) looking recipe generate directed graphs prescribed number of vertices/nodes. way in supposed specify graph square matrix, adjacency matrix a, a[i,j] = 1 signifies connection vertex/node i j.
2) recipe should include initialisation step involves random numbers such probability end specific graph (for example connected graph) same all possible graphs of size n.
Comments
Post a Comment