Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/filipinascimento/cvaccessibility
Software to calculate the outwards accessibility measurement of nodes in complex networks. Check http://arxiv.org/abs/1101.5379v3 and http://arxiv.org/abs/0802.3665 .
https://github.com/filipinascimento/cvaccessibility
Last synced: about 2 months ago
JSON representation
Software to calculate the outwards accessibility measurement of nodes in complex networks. Check http://arxiv.org/abs/1101.5379v3 and http://arxiv.org/abs/0802.3665 .
- Host: GitHub
- URL: https://github.com/filipinascimento/cvaccessibility
- Owner: filipinascimento
- License: other
- Created: 2014-07-16T19:34:01.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2017-03-06T19:20:57.000Z (almost 8 years ago)
- Last Synced: 2023-03-11T19:05:58.678Z (almost 2 years ago)
- Language: C
- Size: 797 KB
- Stars: 3
- Watchers: 3
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
#CVAccessibility
CVAccessibility v0.8bSoftware for calculating the accessibility measurement of nodes in complex networks. Check http://arxiv.org/abs/1101.5379v3 and http://arxiv.org/abs/0802.3665 .
##Compiling
Just do:```
cd Source
make
```##Precompiled binaries
Check releases for precompiled binaries for Windows (64-bits) and macOS.##Usage
####Example Usage:
Calculating the level 4 accessibilty:```
CVAccessibility -l 4 inputNetwork.xnet outputValues.txt
```####Options
```
Usage: CVAccessibility [options] -i| []
Options:
-l --level h Obtain accessibility for h steps.
(defaults to h=3)
-r --random-walk Use random-walk dynamics. If not specified,
use self-avoiding dynamics.
-b --ball-measurement Take the measurement over the ball instead
considering levels from 0 to h.
-p --path-diversity Use path diversity instead of probabilities.
-n --normalize Normalize accessibility with the number of
accessed nodes.
-o --output-probs Also output the access probabilities for each
pair of nodes.
-a --output-accessed Also output the number of accessed nodes
alongside acessibility.
-s --live-stream Stream the output as results are obtained.
(note that the results may be out of order)
-j --parallel-jobs N Maximum number of parallel jobs for multicore
calculation. (defaults to N=8)
-h --help Display this usage information.
-V --version Show version number and quit.
-v --verbose Make the calculation more talkative.
-q --quiet Don not show calculation progress.
-S --show-status Always show calculation progress.
Input:
Path to the network file in .xnet format.
-i --input-stdin Uses stdin as input instead of a file.
Path to output the results. (If not defined,
the software will output to stdout)```
##Compile
We provide binaries for both windows 64bits and Mac OS X, Linux and Win32 users need to use the provided makefiles or scripts to compile the software. Note that windows and linux versions require OpenMP for parallel support. On linux, use GCC 4.8 or later as the default compiler. On windows we recomend the use of TDD-GCC toolchain:
http://tdm-gcc.tdragon.net/download
##Input format
The software uses the XNET network format. The file is a UTF-8 encoded text file as described bellow:```
#vertices (num of vertices) (weighted|nonweighter)
"name of vertex 0" [weight]
"name of vertex 1" [weight]
...
#edges (nonweighted|weighted) (undirected|directed)
from to [weight]
...
#v "property name" (n|v2|v3|s)
property value of vertex 0
property value of vertex 1
...
#e "property name" (n|v2|v3|s)
property value of edge 0
property value of edge 1
...
```Example of a square graph:
```
#vertices 4 nonweighted
"Lower Left"
"Upper Left"
"Upper Right"
"Lower Right"
#edges nonweighted undirected
0 1
0 3
1 2
2 3```
##TODO
- Create updated makefiles and compiler tools.
- Update the licence to be less restrictive.
- Code documentation.
- Better overall documentation.#LICENSE
CVAccessibility by Filipi Nascimento Silva is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.