<commit_before>=======
netctrl
=======
---------------------------------------------------------------
Controllability of complex networks with node and edge dynamics
---------------------------------------------------------------

:Author: <NAME>
:Version: 0.1
:License: MIT

This program implements algorithms that search for driver nodes in complex
networks in order to make them (structurally) controllable. The program
currently implements the controllability model of Liu et al [1]_ and the
switchboard dynamics model of Nepusz and Vicsek [2]_. Other models might be
added later.

Precompiled binaries
====================

Follow `this link <http://hal.elte.hu/~nepusz/files/netctrl>`_ for precompiled
packages for Linux systems running on 32-bit or 64-bit processors.

If you are running a different system (e.g., Windows or Mac OS X), you have to
compile ``netctrl`` yourself; please proceed to the `Compiling from source
code`_ section. You must also compile ``netctrl`` yourself if you need the
bleeding edge version as the packages at the above URL are not guaranteed to be
updated regularly.  However, they could safely be used to check out ``netctrl``
quickly without having to go through all the hassle with compiling ``netctrl``
from source.

If you are using a precompiled binary, please proceed to the Usage_ section
for usage instructions.

Compiling from source code
==========================

Requirements
------------

- The most recent, up-to-date, bleeding-edge version of igraph_. Really.
  You need at least igraph_ 0.6 because that's where the bipartite
  matching algorithm was added. At the time of writing, igraph_ 0.6
  has not been released yet, and even the bipartite matching algorithm is
  implemented in a separate branch only, so you have to check out the
  ``0.6-matching`` branch from their `Launchpad repository`_ and compile
  it yourself. In case there is no such branch, this means that the branch
  has already been merged into ``0.6-main``, so check out ``0.6-main``
  instead.

- CMake_ to generate the makefiles (or the project file if you are using
  Visual Studio).

.. _igraph: http://igraph.sourceforge.net
.. _Launchpad repository: http://launchpad.net/igraph/
.. _CMake: http://www.cmake.org

Compiling using ``cmake`` and ``make``
--------------------------------------

These instructions are for Linux or Mac OS X and assume that igraph_ is
installed in a way that CMake can figure out automatically where it is.
(This usually involves using ``pkg-config``; if you run ``pkg-config --cflags igraph``
and it works, then it should work with CMake as well)::

    $ git submodule update --init<commit_msg>updated README now that igraph 0.6 is released<commit_after>=======
netctrl
=======
---------------------------------------------------------------
Controllability of complex networks with node and edge dynamics
---------------------------------------------------------------

:Author: <NAME>
:Version: 0.1
:License: MIT

This program implements algorithms that search for driver nodes in complex
networks in order to make them (structurally) controllable. The program
currently implements the controllability model of Liu et al [1]_ and the
switchboard dynamics model of Nepusz and Vicsek [2]_. Other models might be
added later.

Precompiled binaries
====================

Follow `this link <http://hal.elte.hu/~nepusz/files/netctrl>`_ for precompiled
packages for Linux systems running on 32-bit or 64-bit processors.

If you are running a different system (e.g., Windows or Mac OS X), you have to
compile ``netctrl`` yourself; please proceed to the `Compiling from source
code`_ section. You must also compile ``netctrl`` yourself if you need the
bleeding edge version as the packages at the above URL are not guaranteed to be
updated regularly.  However, they could safely be used to check out ``netctrl``
quickly without having to go through all the hassle with compiling ``netctrl``
from source.

If you are using a precompiled binary, please proceed to the Usage_ section
for usage instructions.

Compiling from source code
==========================

Requirements
------------

- The most recent, up-to-date, bleeding-edge version of igraph_. Really.
  You need at least igraph_ 0.6 because that's where the bipartite
  matching algorithm was added.

- CMake_ to generate the makefiles (or the project file if you are using
  Visual Studio).

.. _igraph: http://igraph.sourceforge.net
.. _Launchpad repository: http://launchpad.net/igraph/
.. _CMake: http://www.cmake.org

Compiling using ``cmake`` and ``make``
--------------------------------------

These instructions are for Linux or Mac OS X and assume that igraph_ is
installed in a way that CMake can figure out automatically where it is.
(This usually involves using ``pkg-config``; if you run ``pkg-config --cflags igraph``
and it works, then it should work with CMake as well)::

    $ git submodule update --init
{'fraction_non_alphanumeric': 0.1572556162720097, 'fraction_numerical': 0.006071645415907711, 'mean_word_length': 3.1012448132780084, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5947694', 'n_tokens_mistral': 1281, 'n_tokens_neox': 1206, 'n_words': 643}