Skip to content

Commit

Permalink
Merge pull request #53 from martinateruzzi/inputoutput
Browse files Browse the repository at this point in the history
Input/output with pandas
  • Loading branch information
martinateruzzi committed Mar 3, 2021
2 parents 1d61417 + 3d48ce7 commit 08be265
Show file tree
Hide file tree
Showing 20 changed files with 1,238 additions and 1,718 deletions.
2 changes: 1 addition & 1 deletion .travis.yml
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,7 @@ before_install:
install:
- conda create --yes -n test python=$TRAVIS_PYTHON_VERSION
- source activate test
- pip install coverage numpy scipy matplotlib networkx nose coveralls
- pip install coverage numpy scipy matplotlib networkx nose coveralls pandas
- python setup.py install

script:
Expand Down
4 changes: 3 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -39,7 +39,9 @@ The package represents the dependencies between graph elements and predicts the

In particular, the contribution to the cascade effects resulting from adverse events can be evaluated through centrality and efficiency measures, highlighting the plants major criticalities, vulnerabilities and potential weak points.

Considering that the most computationally expensive parts of the program involve the calculation of shortest paths, parallelization of shortest path computation in large unweighted graphs was integrated in the program. This was done taking advantage of the Python modules multiprocessing and threading. Two different sequential algorithms for the solution of the shortest path problem have been parallelized including a Single Source Shortest Path (SSSP) algorythm for sparse graphs and an All Pairs Shortest Path one (APSP) for dense graphs.
Considering that the most computationally expensive parts of the program involve the calculation of shortest paths, parallelization of shortest path computation in large unweighted graphs was integrated in the program. This was done taking advantage of the Python modules multiprocessing and threading. Two different sequential algorithms for the solution of the shortest path problem have been parallelized including a Single Source Shortest Path (SSSP) algorithm for sparse graphs and an All Pairs Shortest Path one (APSP) for dense graphs.

We acknowledge Aurora Maurizio for her substantial contributions to this package, including the conception of the algorithm and the implementation of the original code.

## Dependencies and installation

Expand Down
Loading

0 comments on commit 08be265

Please sign in to comment.