############################################################################
### NET's default initialization file ######################################
############################################################################
VERSION 1.19 ######################################
############################################################################
# Use the flag -h to have a list of command line options
################### Master parameters ######################################
#
NK = 50 # Number of nodes
#
# The following three fields select the random distribution of fitnesses:
# 0: Uniform [ x in (A,B) ]
# 1: Exponential [ A*exp(-A*x), x>0 ]
# 2: Gaussian [ (2*Pi*A^2)^-0.5*exp(-x^2/2A^2), x>0 ]
# 3: Power [ c*x^-A if x>B, 0.0 if x<=B ]
#
DISTRIB = 0 # See comment lines above
A = 0.0 # Parameter for the distribution above
B = 1.0 # Another parameter for the distribution above
LINKTYPE = 0 # Type of function to use as linking probability
Z = 0.0 # Cutoff in the linking probability
M = 0.03 # Probability of successfull connections per node
E = 0.0 # Parameter in the linking prob
TREE = 0 # Force the generation of a tree
ACYCLIC = 0 # Force the generation of acyclic graphs
#
# The following two fields define Barabasi-Albert parameters:
BA_N0 = 2 # Starting clique order
BA_M = 2 # Links entering at each step
#
################### Basic control #########################################
#
PROJNAME = gnu # Project name
NET_GENR = 0 # 0=FITNESS, 1=BA, 2=MG
NET_TYPE = 0 # 0=undirected, 1=directed
WEIGHTED = 0 # 0=unweighted, 1=weighted edges (only with READ_IN=1)
MULTI = 1 # If>1 do multiple runs
READ_IN = 0 # Read net from file PROJNAME.in
#
################### Output control #########################################
#
SAVE_NET = 1 # Save the resulting net on file 1=.net 2=.paj for pajek
SHOW_NET = 0 # Display the resulting net on screen 1=dot 2=guide
RUN_GRACE = 0 # Run xmgrace at the end: 1=log-log 2=lin-lin
DEGREE_DISTRIB = 1 # Calculates and saves the degree distrib
KNN = 0 # Calculates and saves the nearest neigh connectivity
CLUSTER_COEFF = 0 # Calculates and saves the clustering coeff
CLUSTER_COEFF2 = 0 # Calculates and saves the clustering coeff up to 2nd neighs
REDUCTION = 0 # Reduces the net to that nr of nodes. 0=do nothing.
SCC = 0 # Finds the Strongly Connected Components of a directed graph.
COMMUNITIES = 0 # Calculates the community size distribution
AMATRIX = 0 # Calc eigvals and eigvects of graph matrices: 1=A 2=L 3=N
LANCZOS = 0 # Calculates eigvals and eigvects using lanczos routines
SAVE_CLUSTER = 0 # Save the node cluster sizes
SPLIT_CLUSTER = 0 # Save found clusters onto separate files
EDGE_BETWEEN = 0 # Calculates and saves the edge betweenness
SITE_BETWEEN = 0 # Calculates and saves the site betweenness
PAIR_DISTANCE = 0 # Save list of pairs and relative distance
#
######################## END ###############################################