mcx ctty(1)                     USER COMMANDS                      mcx ctty(1)



  NAME
      mcx ctty - compute the clustering coefficient of a graph

  SYNOPSIS
      mcx ctty [options] [matrix-file]

      mcxctty is not in actual fact a program. This manual page documents the
      behaviour and options of the mcx program when invoked in mode ctty. The
      options -h, --apropos, --version, -set, --nop, -progress <num> are
      accessible in all mcx modes. They are described in the mcx manual page.

      mcx ctty [-abc <fname> (specify label input)] [-imx <fname> (specify
      matrix input)] [-tab <fname> (use tab file)] [-t (number of threads to
      use)] [--list (list clustering coefficient for all nodes)] [-h (print
      synopsis, exit)] [--apropos (print synopsis, exit)] [--version (print
      version, exit)]

  DESCRIPTION
      mcx ctty computes centrality betweenness for all nodes in a graph, using
      the between centrality update algorithm from [1].

      The input graph/matrix, if specified with the -imx option, has to be in
      mcl matrix/graph format. You can use label input instead by using the
      -abc option.  Refer to mcxio(5) for a description of these two input
      formats.  By default mcx diameter reads from STDIN and expects matrix
      format.  To specify label input from STDIN use -abc -.

  OPTIONS
      -abc <fname> (label input)
        The file name for input that is in label format.

      -imx <fname> (input matrix)
        The file name for input. STDIN is assumed if not specified.

      -tab <fname> (use tab file)
        This option causes the output to be printed with the labels found in
        the tab file.  With -abc this option will, additionally, construct a
        graph only on the labels found in the tab file.  If this option is
        used in conjunction with -imx the tab domain and the matrix domain are
        required to be identical.

      -t (number of threads to use)
        Computing centrality scores in a graph is time-intensive.  If you have
        multiple CPUs available consider using as many threads.

      --list (print result for each node)
        Print clustering coefficient for all nodes.

  REFERENCES
      [1] Ulrik Brandes, A Faster Algorithm for Betweenness Centrality.
      Journal of Mathematical Sociology 25(2): 163-177, (2001).
      http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2024

  SEE ALSO
      mcxio(5), and mclfamily(7) for an overview of all the documentation and
      the utilities in the mcl family.



  mcx ctty 1.008, 09-308            4 Nov 2009                       mcx ctty(1)
