In \cite{Osamu} we give an algorithm for getting 

all non-isomorphic embeddings of the simple , 

connected, planar graphs. In this paper, we give 

an algorithm for getting the crossing number of 

the simple, connected graphs by using this algorithm. 

And we compute the number of the simple, connected 

graphs with order 10 or less that have crossing number 1 

and the numbers of the simple, connected graphs 

with order 9 or less that have crossing number 2 and 3, 

respectively.