With this code I produce a text file describing a directed graph. The format of the text file is the following:

     INT           INT           DOUBLE
--------------------------------------------
nodeA_ID   nodeB_ID       cost

so each line represents a directed edge from nodeA to nodeB for which we have a given cost that is positive.

HOWTO run
=====================
./createGraph -n <totNodes> -fs <maxForwardStar> -o <outputFile>

where : 
---> -n specifies the total number of nodes of the graph 
---> -fs specifies the maximum number of edges outgoing a node
---> -o  indicates the output file where the graph will be saved

HOWTO build
=====================
g++ -O3 createGraph.cpp -o createGraph