Skip to content

Repository files navigation

This code is developed with no guarantee of success. 
At last testing, all algorithms ran on basic graph files, in NetBean

The arguments for adjustable paths do not seem to be implemented correctly.

Notes: This was/is current a net-bean's project, and so has all the 
sub-files included in the net-beans run path. Correct path directions will
need to be provided for both algorithms and graphs if using "graphinfer.py" 
as a standalone program (or move everything into one directory).

A rough sample of how to plot using python's matplotlib is in "Graphing_Example.py"
It will need to be heavily modified before being used (currently set for 8 algorithms)

FDD.py and barabasi.gexf are included in main folder to allow test run of 
graphinfer.py

Copyright (C) 2015, Karl R. B. Schmitt & Ralucca Gera

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License
along with this program.  If not, see <http://www.gnu.org/licenses/>.


Repository and Clean files originally created by:
Karl Schmitt, Valparaiso University
on
7/27/2015


About

Algorithms for Discovering Networks.

Resources

Stars

3 stars

Watchers

2 watching

Forks

Releases

Packages

Contributors

Languages