Copy disabled (too large)
Download .txt
Showing preview only (46,701K chars total). Download the full file to get everything.
Repository: RapidsAtHKUST/CommunityDetectionCodes
Branch: master
Commit: 23dbafd2e57a
Files: 2675
Total size: 87.2 MB
Directory structure:
gitextract_5m1t25tj/
├── .gitignore
├── .gitmodules
├── Algorithms/
│ ├── 2008-CliquePercolation/
│ │ ├── ReadMe.md
│ │ ├── algorithm_example.py
│ │ ├── conradlee_clique_percolation.py
│ │ ├── example_edge_list.txt
│ │ ├── src_cpp/
│ │ │ ├── CMakeLists.txt
│ │ │ ├── ReadMe.md
│ │ │ ├── cliqueHash.cpp
│ │ │ ├── cliqueHash.h
│ │ │ ├── communityTracker.cpp
│ │ │ ├── communityTracker.h
│ │ │ ├── dendrogram.cpp
│ │ │ ├── dendrogram.h
│ │ │ ├── doc/
│ │ │ │ ├── License.txt
│ │ │ │ └── makefile
│ │ │ ├── k_clique.cpp
│ │ │ ├── k_clique.h
│ │ │ ├── kruskal.cpp
│ │ │ ├── kruskal.h
│ │ │ ├── nodeCommunities.cpp
│ │ │ ├── nodeCommunities.h
│ │ │ ├── script/
│ │ │ │ └── testScp.py
│ │ │ ├── testData/
│ │ │ │ ├── random_1000_005.edg
│ │ │ │ └── random_1000_005.edg_files/
│ │ │ │ ├── k=3/
│ │ │ │ │ └── communities
│ │ │ │ ├── k=4/
│ │ │ │ │ └── communities
│ │ │ │ └── k=5/
│ │ │ │ └── communities
│ │ │ ├── weighedClique.cpp
│ │ │ └── weighedClique.h
│ │ └── src_python/
│ │ └── seq_clique_percolation.py
│ ├── 2009-Connected-Iterative-Scan/
│ │ ├── .gitignore
│ │ ├── ReadMe.md
│ │ ├── src-orginal/
│ │ │ ├── Libraries/
│ │ │ │ ├── Files/
│ │ │ │ │ ├── IOX.cc
│ │ │ │ │ ├── IOX.h
│ │ │ │ │ ├── StringEx.cc
│ │ │ │ │ ├── StringEx.h
│ │ │ │ │ ├── files.cc
│ │ │ │ │ └── makefile
│ │ │ │ ├── Network/
│ │ │ │ │ ├── Format.cc
│ │ │ │ │ ├── Format.h
│ │ │ │ │ ├── LibNetwork.cc
│ │ │ │ │ ├── Network.cc
│ │ │ │ │ ├── Network.h
│ │ │ │ │ ├── RandomNetwork.h
│ │ │ │ │ ├── TemporalNetwork.cc
│ │ │ │ │ ├── TemporalNetwork.h
│ │ │ │ │ └── makefile
│ │ │ │ └── Params/
│ │ │ │ ├── Parameters.cc
│ │ │ │ ├── Parameters.h
│ │ │ │ └── makefile
│ │ │ ├── ReadMe.md
│ │ │ ├── demo/
│ │ │ │ ├── karate_edges_input_modified.csv
│ │ │ │ ├── karate_output.csv
│ │ │ │ ├── network.cl
│ │ │ │ └── network_seeded.cl
│ │ │ ├── main.cc
│ │ │ └── makefile
│ │ └── src-refactor/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── dataset/
│ │ │ ├── karate_edges_input_modified.csv
│ │ │ ├── karate_output.csv
│ │ │ ├── network.cl
│ │ │ └── network_seeded.cl
│ │ ├── graph/
│ │ │ ├── network.cc
│ │ │ ├── network.h
│ │ │ ├── temporal_network.cc
│ │ │ └── temporal_network.h
│ │ ├── main.cc
│ │ ├── useless/
│ │ │ └── RandomNetwork.h
│ │ └── util/
│ │ ├── graph_io_helper.cc
│ │ ├── graph_io_helper.h
│ │ ├── io_helper.cc
│ │ ├── io_helper.h
│ │ ├── parameters_helper.cc
│ │ ├── parameters_helper.h
│ │ ├── string_helper.cc
│ │ └── string_helper.h
│ ├── 2009-EAGLE/
│ │ ├── .gitignore
│ │ ├── ReadMe.md
│ │ ├── graphs/
│ │ │ ├── eagle.edl
│ │ │ ├── eagle.graphml
│ │ │ ├── generate.sh
│ │ │ ├── originals/
│ │ │ │ └── eagle
│ │ │ └── tools/
│ │ │ ├── converter.py
│ │ │ ├── examples.py
│ │ │ ├── progressbar.py
│ │ │ └── utils.pyx
│ │ ├── relazione/
│ │ │ ├── Makefile
│ │ │ └── relazione.lyx
│ │ └── src/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── communities.cpp
│ │ ├── communities.h
│ │ ├── eagle.cpp
│ │ ├── eagle.h
│ │ ├── main.cpp
│ │ ├── max_cache.cpp
│ │ └── max_cache.h
│ ├── 2009-LineGraph/
│ │ ├── altix/
│ │ │ ├── axlgc.sh
│ │ │ └── axmakelgc.sh
│ │ ├── deprecated/
│ │ │ ├── LineGraphCreator.html
│ │ │ ├── lgc.bat
│ │ │ ├── makefileClever
│ │ │ ├── makefileTSE
│ │ │ └── makelgc.bat
│ │ ├── readme.txt
│ │ └── src/
│ │ ├── TseGraph.cpp
│ │ ├── TseGraph.h
│ │ └── main.cpp
│ ├── 2010-CONGA/
│ │ ├── ReadMe.md
│ │ └── conga_src/
│ │ ├── ReadMe.md
│ │ ├── dataset/
│ │ │ ├── dolphins_edges.txt
│ │ │ └── karate.txt
│ │ ├── pom.xml
│ │ └── src/
│ │ └── main/
│ │ ├── java/
│ │ │ ├── clique_modularity/
│ │ │ │ ├── CM.java
│ │ │ │ ├── algorithm/
│ │ │ │ │ ├── BK/
│ │ │ │ │ │ ├── BK.java
│ │ │ │ │ │ └── BronKerboschCFFast.java
│ │ │ │ │ ├── KJ/
│ │ │ │ │ │ └── KJ.java
│ │ │ │ │ └── MaxClique.java
│ │ │ │ ├── input_output/
│ │ │ │ │ ├── ReadEdges.java
│ │ │ │ │ └── WriteCliques.java
│ │ │ │ └── util/
│ │ │ │ ├── ARRAY2.java
│ │ │ │ ├── ARRAY_FIX.java
│ │ │ │ ├── Pair.java
│ │ │ │ ├── Tree.java
│ │ │ │ ├── benchmark/
│ │ │ │ │ ├── GG.java
│ │ │ │ │ └── GGResult.java
│ │ │ │ ├── community/
│ │ │ │ │ ├── CPP.java
│ │ │ │ │ ├── CommPair.java
│ │ │ │ │ ├── CommPairSet.java
│ │ │ │ │ ├── CompleteCliques.java
│ │ │ │ │ ├── CompleteCliques1.java
│ │ │ │ │ ├── RebuildCommunities.java
│ │ │ │ │ └── RemoveCliques.java
│ │ │ │ ├── graph/
│ │ │ │ │ └── ELEMENT.java
│ │ │ │ └── metric/
│ │ │ │ ├── Modularity.java
│ │ │ │ └── Omega.java
│ │ │ ├── conga/
│ │ │ │ ├── CONGA.java
│ │ │ │ ├── algorithm/
│ │ │ │ │ ├── Between.java
│ │ │ │ │ ├── CPP.java
│ │ │ │ │ └── PB.java
│ │ │ │ └── util/
│ │ │ │ ├── Pair.java
│ │ │ │ ├── StrPair.java
│ │ │ │ ├── Tree.java
│ │ │ │ ├── benchmark/
│ │ │ │ │ └── GResult.java
│ │ │ │ ├── community/
│ │ │ │ │ ├── BP.java
│ │ │ │ │ ├── ClusterInfo.java
│ │ │ │ │ └── Stats.java
│ │ │ │ ├── graph/
│ │ │ │ │ ├── Edge.java
│ │ │ │ │ ├── LabelledEdge.java
│ │ │ │ │ ├── Split.java
│ │ │ │ │ └── Vertex.java
│ │ │ │ └── metric/
│ │ │ │ └── ModOverlap.java
│ │ │ └── copra/
│ │ │ ├── Project.java
│ │ │ ├── algorithm/
│ │ │ │ └── COPRA.java
│ │ │ └── util/
│ │ │ ├── LabelPair.java
│ │ │ ├── SetPair.java
│ │ │ ├── VecPair.java
│ │ │ ├── Vert.java
│ │ │ ├── community/
│ │ │ │ └── ClusterLabel.java
│ │ │ └── metric/
│ │ │ └── ModOverlap.java
│ │ └── resources/
│ │ ├── CM.jar
│ │ ├── conga.jar
│ │ └── copra.jar
│ ├── 2010-LinkCommunity/
│ │ ├── README.markdown
│ │ ├── cpp/
│ │ │ ├── COPYING
│ │ │ ├── README
│ │ │ ├── calcAndWrite_Jaccards.cpp
│ │ │ ├── clusterJaccsFile.cpp
│ │ │ ├── edgelist2pairs.py
│ │ │ ├── karate.pairs
│ │ │ ├── lesmis.pairs
│ │ │ ├── link_clustering.sh
│ │ │ ├── loop_thresholds.sh
│ │ │ └── partition_density.py
│ │ ├── python/
│ │ │ ├── karate.pairs
│ │ │ └── link_clustering.py
│ │ └── python_yche_refactor/
│ │ ├── ReadMe.md
│ │ ├── example_edge_list.txt
│ │ ├── graph_io_helper.py
│ │ ├── link_clustering.py
│ │ ├── link_clustering_algo.py
│ │ ├── play_ground.py
│ │ └── results_sample/
│ │ ├── example_edge_list_maxS0.166667_maxD0.703704.comm2edges.txt
│ │ ├── example_edge_list_maxS0.166667_maxD0.703704.comm2nodes.txt
│ │ ├── example_edge_list_maxS0.166667_maxD0.703704.edge2comm.txt
│ │ └── example_edge_list_thr_D.txt
│ ├── 2010-TopGC/
│ │ ├── ReadMe.md
│ │ ├── src_original/
│ │ │ ├── Graphs/
│ │ │ │ ├── graph.sample
│ │ │ │ ├── graph.sample.clusters_directed
│ │ │ │ └── original/
│ │ │ │ ├── graph.raw
│ │ │ │ ├── graph1.idx
│ │ │ │ ├── graph1.raw
│ │ │ │ ├── graph_temp.idx
│ │ │ │ ├── graph_temp.raw
│ │ │ │ ├── graph_temp2.raw
│ │ │ │ ├── mkidx
│ │ │ │ └── mkidx.c
│ │ │ ├── README
│ │ │ ├── TopGC.jar
│ │ │ ├── edgew.txt
│ │ │ ├── idxdFile
│ │ │ └── mkidx.c
│ │ └── src_refactor/
│ │ ├── pom.xml
│ │ └── src/
│ │ └── main/
│ │ ├── java/
│ │ │ ├── FindMostProm.java
│ │ │ ├── HoldBucket.java
│ │ │ ├── HoldInt.java
│ │ │ ├── IntAndDouble.java
│ │ │ ├── LSH.java
│ │ │ ├── LSHThread.java
│ │ │ ├── LSH_Cluster.java
│ │ │ ├── Look3.java
│ │ │ ├── MaxHeap.java
│ │ │ ├── MinHeap.java
│ │ │ ├── Prime.java
│ │ │ ├── TempDouble2.java
│ │ │ └── TopGC.java
│ │ └── resources/
│ │ └── TopGC.jar
│ ├── 2010-iLCD/
│ │ ├── .gitignore
│ │ ├── ReadMe.md
│ │ ├── dataset/
│ │ │ └── exempleGraph.lnd
│ │ ├── doc/
│ │ │ └── ReadMe.rtf
│ │ ├── jars/
│ │ │ ├── iLCD-2013.jar
│ │ │ └── temporalGraphVisu.jar
│ │ └── src/
│ │ ├── pom.xml
│ │ └── src/
│ │ └── main/
│ │ └── java/
│ │ ├── CorePackage/
│ │ │ └── Main.java
│ │ ├── Inputs/
│ │ │ ├── InputCTNFhandler.java
│ │ │ ├── InputHandlerInterface.java
│ │ │ ├── InputNCOLhandler.java
│ │ │ └── InputOLDLNDhandler.java
│ │ ├── Outputs/
│ │ │ ├── OutputCTNF.java
│ │ │ ├── OutputHandlerInterface.java
│ │ │ ├── OutputMultipleHandler.java
│ │ │ ├── OutputStatic.java
│ │ │ └── OutputSummary.java
│ │ ├── TemporalNetworkManipulation/
│ │ │ ├── Community.java
│ │ │ ├── CoreProcessor.java
│ │ │ ├── Interface.java
│ │ │ ├── MyDate.java
│ │ │ ├── MyDateManager.java
│ │ │ ├── Network.java
│ │ │ ├── Node.java
│ │ │ ├── Operations/
│ │ │ │ ├── AddEdgeOperation.java
│ │ │ │ ├── BirthCommunityOperation.java
│ │ │ │ ├── ContractCommunityOperation.java
│ │ │ │ ├── DeathCommunityOperation.java
│ │ │ │ ├── FusionCommunityOperation.java
│ │ │ │ ├── GrowthCommunityOperation.java
│ │ │ │ ├── Operation.java
│ │ │ │ └── RemoveEdgeOperation.java
│ │ │ └── OperationsHandler.java
│ │ ├── communityDetectionPackage/
│ │ │ └── ILCDMetaAlgorithm.java
│ │ ├── implementable/
│ │ │ ├── Implementation.java
│ │ │ └── ImplementationRNHM.java
│ │ └── tools/
│ │ ├── DebugMode.java
│ │ ├── SortEdges.java
│ │ ├── Sorter.java
│ │ ├── TextFileHandler.java
│ │ └── ToolDate.java
│ ├── 2011-GCE/
│ │ ├── ReadMe.md
│ │ ├── src-original/
│ │ │ ├── Community_Finder.cpp
│ │ │ ├── Community_Finder.h
│ │ │ ├── Range.hpp
│ │ │ ├── Seed.cpp
│ │ │ ├── Seed.h
│ │ │ ├── aaron_utils.cpp
│ │ │ ├── aaron_utils.hpp
│ │ │ ├── build/
│ │ │ │ ├── .gitignore
│ │ │ │ ├── karate_edges_input.csv
│ │ │ │ ├── karate_gce_output.csv
│ │ │ │ └── makefile
│ │ │ ├── clique_percolation.hpp
│ │ │ ├── cliques.cpp
│ │ │ ├── cliques.hpp
│ │ │ ├── find_communities.cpp
│ │ │ ├── graph_analysis.hpp
│ │ │ ├── graph_loading.cpp
│ │ │ ├── graph_loading.hpp
│ │ │ ├── graph_representation.cpp
│ │ │ ├── graph_representation.hpp
│ │ │ ├── iterative.hpp
│ │ │ ├── modularity.hpp
│ │ │ └── options.hpp
│ │ └── src-refactor/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── algorithm/
│ │ │ ├── cliques.cpp
│ │ │ ├── cliques.hpp
│ │ │ ├── community_finder.cpp
│ │ │ ├── community_finder.h
│ │ │ ├── find_communities.cpp
│ │ │ ├── seed.cpp
│ │ │ └── seed.h
│ │ ├── useless/
│ │ │ ├── clique_percolation.hpp
│ │ │ ├── graph_analysis.hpp
│ │ │ ├── iterative.hpp
│ │ │ ├── modularity.hpp
│ │ │ └── options.hpp
│ │ └── util/
│ │ ├── aaron_utils.cpp
│ │ ├── aaron_utils.hpp
│ │ ├── graph/
│ │ │ ├── graph_loading.cpp
│ │ │ ├── graph_loading.hpp
│ │ │ ├── graph_representation.cpp
│ │ │ └── graph_representation.hpp
│ │ └── range.hpp
│ ├── 2011-MOSES/
│ │ ├── LICENSE-2.0.txt
│ │ ├── NOTICE
│ │ ├── ReadMe.md
│ │ ├── comment.txt
│ │ ├── src-original/
│ │ │ ├── Makefile
│ │ │ ├── Range.cpp
│ │ │ ├── Range.hpp
│ │ │ ├── aaron_utils.cpp
│ │ │ ├── aaron_utils.hpp
│ │ │ ├── gitstatus.cpp
│ │ │ ├── gitstatus.hpp
│ │ │ ├── graph_loading.cpp
│ │ │ ├── graph_loading.hpp
│ │ │ ├── graph_representation.cpp
│ │ │ ├── graph_representation.hpp
│ │ │ ├── groupStats.cpp
│ │ │ ├── grouping.cpp
│ │ │ ├── grouping.hpp
│ │ │ ├── iterative.hpp
│ │ │ ├── moses.cpp
│ │ │ ├── options.hpp
│ │ │ ├── overlapping.cpp
│ │ │ └── overlapping.hpp
│ │ └── src-refactor/
│ │ ├── CMakeLists.txt
│ │ ├── algorithm/
│ │ │ ├── ReadMe.md
│ │ │ ├── group_status_exec.cpp
│ │ │ ├── grouping.cpp
│ │ │ ├── grouping.hpp
│ │ │ ├── moses.cpp
│ │ │ ├── overlapping.cpp
│ │ │ └── overlapping.hpp
│ │ ├── doc/
│ │ │ ├── Makefile
│ │ │ └── comment.txt
│ │ └── util/
│ │ ├── aaron_utils.cpp
│ │ ├── aaron_utils.hpp
│ │ ├── graph/
│ │ │ ├── graph_loading.cpp
│ │ │ ├── graph_loading.hpp
│ │ │ ├── graph_representation.cpp
│ │ │ ├── graph_representation.hpp
│ │ │ └── iterative.hpp
│ │ ├── program_options/
│ │ │ └── options.hpp
│ │ ├── range.cpp
│ │ └── range.hpp
│ ├── 2011-OSLOM-v2/
│ │ ├── Sources_2_5/
│ │ │ ├── OSLOM_files/
│ │ │ │ ├── dir_weighted_tabdeg.h
│ │ │ │ ├── directed_network.h
│ │ │ │ ├── directed_oslomnet_evaluate.h
│ │ │ │ ├── egocentric_undir.h
│ │ │ │ ├── hierarchies.h
│ │ │ │ ├── log_table.h
│ │ │ │ ├── louvain_oslomnet.h
│ │ │ │ ├── louvain_oslomnet_dir.h
│ │ │ │ ├── main_body.cpp
│ │ │ │ ├── main_directed.cpp
│ │ │ │ ├── main_undirected.cpp
│ │ │ │ ├── module_collection.h
│ │ │ │ ├── oslom_net_check_overlap.cpp
│ │ │ │ ├── oslom_net_global.h
│ │ │ │ ├── oslom_net_unions.cpp
│ │ │ │ ├── set_parameters.h
│ │ │ │ ├── standard_package/
│ │ │ │ │ ├── cast.cpp
│ │ │ │ │ ├── combinatorics.cpp
│ │ │ │ │ ├── deque_numeric.cpp
│ │ │ │ │ ├── histograms.cpp
│ │ │ │ │ ├── mutual.cpp
│ │ │ │ │ ├── pajek.cpp
│ │ │ │ │ ├── partition.cpp
│ │ │ │ │ ├── print.cpp
│ │ │ │ │ ├── random.cpp
│ │ │ │ │ ├── standard_include.cpp
│ │ │ │ │ └── tabdeg.cpp
│ │ │ │ ├── try_homeless_dir.cpp
│ │ │ │ ├── try_homeless_undir.cpp
│ │ │ │ ├── undir_weighted_tabdeg.h
│ │ │ │ ├── undirected_network.h
│ │ │ │ ├── undirected_oslomnet_evaluate.h
│ │ │ │ └── wsarray.h
│ │ │ ├── ReadMe.tex
│ │ │ ├── infomap_dir/
│ │ │ │ ├── Greedy.cc
│ │ │ │ ├── Greedy.h
│ │ │ │ ├── GreedyBase.cc
│ │ │ │ ├── GreedyBase.h
│ │ │ │ ├── Makefile
│ │ │ │ ├── MersenneTwister.h
│ │ │ │ ├── Node.cc
│ │ │ │ ├── Node.h
│ │ │ │ ├── flow.net
│ │ │ │ ├── infomap.cc
│ │ │ │ ├── infomap.h
│ │ │ │ ├── infomap_scr.cpp
│ │ │ │ ├── source-sink.net
│ │ │ │ └── standard_package/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── mutual.cpp
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── standard_include.cpp
│ │ │ │ └── tabdeg.cpp
│ │ │ ├── infomap_undir/
│ │ │ │ ├── Greedy.cc
│ │ │ │ ├── Greedy.h
│ │ │ │ ├── GreedyBase.cc
│ │ │ │ ├── GreedyBase.h
│ │ │ │ ├── Makefile
│ │ │ │ ├── MersenneTwister.h
│ │ │ │ ├── Node.cc
│ │ │ │ ├── Node.h
│ │ │ │ ├── infomap.cc
│ │ │ │ ├── infomap.h
│ │ │ │ ├── infomap_scr.cpp
│ │ │ │ ├── karate.net
│ │ │ │ └── standard_package/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── mutual.cpp
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── standard_include.cpp
│ │ │ │ └── tabdeg.cpp
│ │ │ ├── louvain/
│ │ │ │ ├── Makefile
│ │ │ │ ├── a.out
│ │ │ │ ├── community.cpp
│ │ │ │ ├── community.h
│ │ │ │ ├── graph.cpp
│ │ │ │ ├── graph.h
│ │ │ │ ├── graph_binary.cpp
│ │ │ │ ├── graph_binary.h
│ │ │ │ ├── graph_binary_linux.h
│ │ │ │ ├── graph_binary_mac.h
│ │ │ │ ├── list_out
│ │ │ │ ├── main_community.cpp
│ │ │ │ ├── main_convert.cpp
│ │ │ │ ├── main_hierarchy.cpp
│ │ │ │ ├── order.cpp
│ │ │ │ ├── script_to_compile.cpp
│ │ │ │ ├── standard_package/
│ │ │ │ │ ├── cast.cpp
│ │ │ │ │ ├── combinatorics.cpp
│ │ │ │ │ ├── deque_numeric.cpp
│ │ │ │ │ ├── histograms.cpp
│ │ │ │ │ ├── mutual.cpp
│ │ │ │ │ ├── pajek.cpp
│ │ │ │ │ ├── partition.cpp
│ │ │ │ │ ├── print.cpp
│ │ │ │ │ ├── random.cpp
│ │ │ │ │ ├── standard_include.cpp
│ │ │ │ │ └── tabdeg.cpp
│ │ │ │ ├── static_network.h
│ │ │ │ └── wsarray.h
│ │ │ └── visualSources/
│ │ │ ├── hier.h
│ │ │ ├── main.cpp
│ │ │ ├── main_pajek.cpp
│ │ │ ├── main_pajek_directed.cpp
│ │ │ ├── netvi.h
│ │ │ ├── position.h
│ │ │ ├── standard_package/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── mutual.cpp
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── standard_include.cpp
│ │ │ │ └── tabdeg.cpp
│ │ │ ├── static_network.h
│ │ │ ├── visual_net.h
│ │ │ └── wsarray.h
│ │ ├── compile_all.sh
│ │ ├── copra.jar
│ │ └── src-refactor/
│ │ ├── CMakeLists.txt
│ │ ├── algorithm/
│ │ │ ├── infomap/
│ │ │ │ ├── dir/
│ │ │ │ │ ├── Greedy.cc
│ │ │ │ │ ├── Greedy.h
│ │ │ │ │ ├── GreedyBase.cc
│ │ │ │ │ ├── GreedyBase.h
│ │ │ │ │ ├── MersenneTwister.h
│ │ │ │ │ ├── Node.cc
│ │ │ │ │ ├── Node.h
│ │ │ │ │ ├── doc/
│ │ │ │ │ │ ├── Makefile
│ │ │ │ │ │ ├── ReadMe.md
│ │ │ │ │ │ ├── flow.net
│ │ │ │ │ │ ├── infomap_scr.cpp
│ │ │ │ │ │ └── source-sink.net
│ │ │ │ │ ├── infomap.cc
│ │ │ │ │ └── infomap.h
│ │ │ │ └── undir/
│ │ │ │ ├── Greedy.cc
│ │ │ │ ├── Greedy.h
│ │ │ │ ├── GreedyBase.cc
│ │ │ │ ├── GreedyBase.h
│ │ │ │ ├── MersenneTwister.h
│ │ │ │ ├── Node.cc
│ │ │ │ ├── Node.h
│ │ │ │ ├── doc/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── ReadMe.md
│ │ │ │ │ ├── infomap_scr.cpp
│ │ │ │ │ └── karate.net
│ │ │ │ ├── infomap.cc
│ │ │ │ └── infomap.h
│ │ │ ├── louvain/
│ │ │ │ ├── community.cpp
│ │ │ │ ├── community.h
│ │ │ │ ├── doc/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── ReadMe.md
│ │ │ │ │ ├── list_out
│ │ │ │ │ ├── order.cpp
│ │ │ │ │ ├── script_to_compile.cpp
│ │ │ │ │ └── static_network.h
│ │ │ │ ├── graph.cpp
│ │ │ │ ├── graph.h
│ │ │ │ ├── graph_binary.cpp
│ │ │ │ ├── graph_binary.h
│ │ │ │ ├── graph_binary_linux.h
│ │ │ │ ├── graph_binary_mac.h
│ │ │ │ ├── main_community.cpp
│ │ │ │ ├── main_convert.cpp
│ │ │ │ └── main_hierarchy.cpp
│ │ │ └── oslom/
│ │ │ ├── hierarchies.cpp
│ │ │ ├── hierarchies.h
│ │ │ ├── main_directed.cpp
│ │ │ └── main_undirected.cpp
│ │ ├── graph/
│ │ │ ├── directed/
│ │ │ │ ├── dir_weighted_tabdeg.cpp
│ │ │ │ ├── dir_weighted_tabdeg.h
│ │ │ │ ├── directed_network.cpp
│ │ │ │ ├── directed_network.h
│ │ │ │ ├── directed_oslomnet_evaluate.cpp
│ │ │ │ ├── directed_oslomnet_evaluate.h
│ │ │ │ ├── louvain_oslomnet_dir.cpp
│ │ │ │ ├── louvain_oslomnet_dir.h
│ │ │ │ └── try_homeless_dir.cpp
│ │ │ ├── louvain_oslomnet.cpp
│ │ │ ├── louvain_oslomnet.h
│ │ │ ├── oslom_net_global.cpp
│ │ │ ├── oslom_net_global.h
│ │ │ └── undirected/
│ │ │ ├── egocentric_undir.cpp
│ │ │ ├── egocentric_undir.h
│ │ │ ├── try_homeless_undir.cpp
│ │ │ ├── undir_weighted_tabdeg.cpp
│ │ │ ├── undir_weighted_tabdeg.h
│ │ │ ├── undirected_network.cpp
│ │ │ ├── undirected_network.h
│ │ │ ├── undirected_oslomnet_evaluate.cpp
│ │ │ └── undirected_oslomnet_evaluate.h
│ │ ├── util/
│ │ │ ├── collection/
│ │ │ │ ├── module_collection.cpp
│ │ │ │ ├── module_collection.h
│ │ │ │ ├── wsarray.cpp
│ │ │ │ └── wsarray.h
│ │ │ ├── common/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── cast.h
│ │ │ │ ├── cc.cpp
│ │ │ │ ├── cc.h
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── combinatorics.h
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── deque_numeric.h
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── histograms.h
│ │ │ │ ├── log_table.cpp
│ │ │ │ ├── log_table.h
│ │ │ │ ├── random.cpp
│ │ │ │ └── random.h
│ │ │ ├── input_output/
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── pajek.h
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── partition.h
│ │ │ │ ├── pretty_print.h
│ │ │ │ ├── tab_degree.cpp
│ │ │ │ └── tab_degree.h
│ │ │ ├── metric/
│ │ │ │ ├── mutual.cpp
│ │ │ │ └── mutual.h
│ │ │ └── program_options/
│ │ │ ├── set_parameters.cpp
│ │ │ └── set_parameters.h
│ │ └── visualization/
│ │ ├── main.cpp
│ │ ├── main_pajek.cpp
│ │ ├── main_pajek_directed.cpp
│ │ ├── unused/
│ │ │ ├── netvi.cpp
│ │ │ └── netvi.h
│ │ └── util/
│ │ ├── hier.cpp
│ │ ├── hier.h
│ │ ├── position.cpp
│ │ ├── position.h
│ │ ├── static_network.cpp
│ │ ├── static_network.h
│ │ ├── visual_net.cpp
│ │ ├── visual_net.h
│ │ ├── wsarray.cpp
│ │ └── wsarray.h
│ ├── 2011-SLPA/
│ │ ├── ReadMe.md
│ │ ├── src_original/
│ │ │ ├── GANXiS-S_v1.0/
│ │ │ │ ├── CommonFuns.cpp
│ │ │ │ ├── CommonFuns.h
│ │ │ │ ├── CommonFuns_Measure.cpp
│ │ │ │ ├── CommonFuns_Measure.h
│ │ │ │ ├── CommonFuns_TMP.h
│ │ │ │ ├── CommonFuns_TMP_Measure.h
│ │ │ │ ├── ComputeSnapshotChange.cpp
│ │ │ │ ├── ComputeSnapshotChange.h
│ │ │ │ ├── DisjointM.cpp
│ │ │ │ ├── DisjointM.h
│ │ │ │ ├── LPA.cpp
│ │ │ │ ├── LPA.h
│ │ │ │ ├── LRTPrama.cpp
│ │ │ │ ├── LRTPrama.h
│ │ │ │ ├── LabelRank.cpp
│ │ │ │ ├── LabelRank.h
│ │ │ │ ├── MersenneTwister.h
│ │ │ │ ├── NODE.cpp
│ │ │ │ ├── NODE.h
│ │ │ │ ├── Net.cpp
│ │ │ │ ├── Net.h
│ │ │ │ ├── TieLabel.cpp
│ │ │ │ ├── TieLabel.h
│ │ │ │ ├── fileOpts.cpp
│ │ │ │ ├── fileOpts.h
│ │ │ │ ├── main_LabelRank_release.cpp
│ │ │ │ ├── rndNumbers.cpp
│ │ │ │ ├── rndNumbers.h
│ │ │ │ └── test.ipairs
│ │ │ └── GANXiS_v3.0.2/
│ │ │ ├── GANXiSw.jar
│ │ │ ├── commons-collections-3.2.1.jar
│ │ │ ├── output/
│ │ │ │ ├── SLPAw_test_run1_r0.01_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.05_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.15_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.1_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.25_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.2_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.35_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.3_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.45_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.4_v3_T100.icpm
│ │ │ │ └── SLPAw_test_run1_r0.5_v3_T100.icpm
│ │ │ ├── test.ipairs
│ │ │ ├── testLong.ipairs
│ │ │ ├── test_str.ipairs
│ │ │ └── test_w01.ipairs
│ │ ├── src_python/
│ │ │ ├── romain-fontugne/
│ │ │ │ └── slpa.py
│ │ │ └── ying_nus/
│ │ │ ├── README.md
│ │ │ ├── karate.txt
│ │ │ ├── nmi.py
│ │ │ ├── slpa.py
│ │ │ └── test_slpa.py
│ │ └── src_refactor/
│ │ ├── pom.xml
│ │ └── src/
│ │ └── main/
│ │ ├── java/
│ │ │ ├── CollectionFuns.java
│ │ │ ├── NODE.java
│ │ │ ├── Net.java
│ │ │ ├── SLPAw.java
│ │ │ └── fileOpts.java
│ │ └── resources/
│ │ └── GANXiSw.jar
│ ├── 2012-CPMOnSteroids/
│ │ ├── ReadMe.md
│ │ ├── src_original/
│ │ │ ├── COPYING
│ │ │ ├── Makefile.in
│ │ │ ├── README
│ │ │ ├── cliques.c
│ │ │ ├── configure
│ │ │ ├── configure.in
│ │ │ ├── cos.c
│ │ │ ├── cospoc.c
│ │ │ ├── dsforest.c
│ │ │ ├── extras/
│ │ │ │ ├── Makefile.in
│ │ │ │ └── maximal_cliques.c
│ │ │ ├── include/
│ │ │ │ ├── cliques.h
│ │ │ │ ├── common.h
│ │ │ │ ├── cos.h
│ │ │ │ ├── cospoc.h
│ │ │ │ ├── debug.h
│ │ │ │ ├── dsforest.h
│ │ │ │ ├── matrix.h
│ │ │ │ └── output_communities.h
│ │ │ ├── main.c
│ │ │ ├── matrix.c
│ │ │ └── output_communities.c
│ │ └── src_refactor/
│ │ ├── doc/
│ │ │ ├── COPYING
│ │ │ └── README
│ │ └── src/
│ │ ├── CMakeLists.txt
│ │ ├── cliques.c
│ │ ├── cliques.h
│ │ ├── common.h
│ │ ├── cos.c
│ │ ├── cos.h
│ │ ├── cospoc.c
│ │ ├── cospoc.h
│ │ ├── debug.h
│ │ ├── dsforest.c
│ │ ├── dsforest.h
│ │ ├── extras/
│ │ │ └── maximal_cliques.c
│ │ ├── main.c
│ │ ├── matrix.c
│ │ ├── matrix.h
│ │ ├── output_communities.c
│ │ └── output_communities.h
│ ├── 2012-DEMON/
│ │ ├── .gitignore
│ │ ├── Demon.py
│ │ ├── HDemon.py
│ │ ├── change_input_format.py
│ │ └── test_networkx.py
│ ├── 2012-Fast-Clique-Percolation/
│ │ ├── ReadMe.md
│ │ ├── src_original/
│ │ │ ├── Makefile
│ │ │ ├── README
│ │ │ ├── cliques.cpp
│ │ │ ├── cliques.hpp
│ │ │ ├── cmdline.c
│ │ │ ├── cmdline.ggo
│ │ │ ├── cmdline.h
│ │ │ ├── gpl.txt
│ │ │ ├── graph/
│ │ │ │ ├── bloom.cpp
│ │ │ │ ├── bloom.hpp
│ │ │ │ ├── graph.cpp
│ │ │ │ ├── graph.hpp
│ │ │ │ ├── loading.cpp
│ │ │ │ ├── loading.hpp
│ │ │ │ ├── network.cpp
│ │ │ │ ├── network.hpp
│ │ │ │ ├── saving.cpp
│ │ │ │ ├── saving.hpp
│ │ │ │ ├── strings.cpp
│ │ │ │ ├── strings.hpp
│ │ │ │ ├── weights.cpp
│ │ │ │ └── weights.hpp
│ │ │ ├── percolateCliques.cpp
│ │ │ └── pp.hpp
│ │ ├── src_python/
│ │ │ ├── clique_percoaltion_naive.py
│ │ │ └── clique_percolation_fast.py
│ │ └── src_refactor/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── cliques.cpp
│ │ ├── cliques.hpp
│ │ ├── cmdline.c
│ │ ├── cmdline.ggo
│ │ ├── cmdline.h
│ │ ├── graph/
│ │ │ ├── bloom.cpp
│ │ │ ├── bloom.hpp
│ │ │ ├── graph.cpp
│ │ │ ├── graph.hpp
│ │ │ ├── loading.cpp
│ │ │ ├── loading.hpp
│ │ │ ├── network.cpp
│ │ │ ├── network.hpp
│ │ │ ├── saving.cpp
│ │ │ ├── saving.hpp
│ │ │ ├── strings.cpp
│ │ │ ├── strings.hpp
│ │ │ ├── weights.cpp
│ │ │ └── weights.hpp
│ │ ├── original_doc/
│ │ │ ├── Makefile
│ │ │ ├── README
│ │ │ └── gpl.txt
│ │ ├── percolateCliques.cpp
│ │ └── pp.hpp
│ ├── 2013-MSCD/
│ │ ├── MSCD.xcodeproj/
│ │ │ ├── elemarte.mode1v3
│ │ │ ├── elemarte.pbxuser
│ │ │ ├── project.pbxproj
│ │ │ ├── project.xcworkspace/
│ │ │ │ ├── contents.xcworkspacedata
│ │ │ │ └── xcuserdata/
│ │ │ │ └── elemarte.xcuserdatad/
│ │ │ │ ├── UserInterfaceState.xcuserstate
│ │ │ │ └── WorkspaceSettings.xcsettings
│ │ │ └── xcuserdata/
│ │ │ └── elemarte.xcuserdatad/
│ │ │ ├── xcdebugger/
│ │ │ │ └── Breakpoints.xcbkptlist
│ │ │ └── xcschemes/
│ │ │ ├── MSCD.xcscheme
│ │ │ └── xcschememanagement.plist
│ │ ├── Makefile
│ │ ├── ReadMe.md
│ │ ├── Readme.txt
│ │ ├── analyse.xcodeproj/
│ │ │ ├── elemarte.mode1v3
│ │ │ ├── elemarte.pbxuser
│ │ │ ├── project.pbxproj
│ │ │ ├── project.xcworkspace/
│ │ │ │ ├── contents.xcworkspacedata
│ │ │ │ └── xcuserdata/
│ │ │ │ └── elemarte.xcuserdatad/
│ │ │ │ └── UserInterfaceState.xcuserstate
│ │ │ └── xcuserdata/
│ │ │ └── elemarte.xcuserdatad/
│ │ │ └── xcschemes/
│ │ │ ├── analyse.xcscheme
│ │ │ └── xcschememanagement.plist
│ │ ├── conv.xcodeproj/
│ │ │ ├── elemarte.mode1v3
│ │ │ ├── elemarte.pbxuser
│ │ │ ├── project.pbxproj
│ │ │ ├── project.xcworkspace/
│ │ │ │ ├── contents.xcworkspacedata
│ │ │ │ └── xcuserdata/
│ │ │ │ └── elemarte.xcuserdatad/
│ │ │ │ └── UserInterfaceState.xcuserstate
│ │ │ └── xcuserdata/
│ │ │ └── elemarte.xcuserdatad/
│ │ │ └── xcschemes/
│ │ │ ├── conv.xcscheme
│ │ │ └── xcschememanagement.plist
│ │ ├── examples/
│ │ │ ├── dolphins.edges
│ │ │ ├── dolphins.qs
│ │ │ ├── dolphins_0.1.coms
│ │ │ ├── dolphins_0.2.coms
│ │ │ ├── dolphins_0.3.coms
│ │ │ ├── dolphins_0.4.coms
│ │ │ ├── dolphins_0.5.coms
│ │ │ ├── dolphins_0.6.coms
│ │ │ ├── dolphins_0.7.coms
│ │ │ ├── dolphins_0.8.coms
│ │ │ ├── dolphins_0.9.coms
│ │ │ ├── dolphins_0.coms
│ │ │ ├── dolphins_1.1.coms
│ │ │ ├── dolphins_1.2.coms
│ │ │ ├── dolphins_1.3.coms
│ │ │ ├── dolphins_1.4.coms
│ │ │ ├── dolphins_1.5.coms
│ │ │ ├── dolphins_1.6.coms
│ │ │ ├── dolphins_1.7.coms
│ │ │ ├── dolphins_1.8.coms
│ │ │ ├── dolphins_1.87905e-14.coms
│ │ │ ├── dolphins_1.9.coms
│ │ │ ├── dolphins_1.coms
│ │ │ ├── dolphins_10.coms
│ │ │ ├── dolphins_2.1.coms
│ │ │ ├── dolphins_2.2.coms
│ │ │ ├── dolphins_2.3.coms
│ │ │ ├── dolphins_2.4.coms
│ │ │ ├── dolphins_2.5.coms
│ │ │ ├── dolphins_2.6.coms
│ │ │ ├── dolphins_2.7.coms
│ │ │ ├── dolphins_2.8.coms
│ │ │ ├── dolphins_2.9.coms
│ │ │ ├── dolphins_2.coms
│ │ │ ├── dolphins_3.1.coms
│ │ │ ├── dolphins_3.2.coms
│ │ │ ├── dolphins_3.3.coms
│ │ │ ├── dolphins_3.4.coms
│ │ │ ├── dolphins_3.5.coms
│ │ │ ├── dolphins_3.6.coms
│ │ │ ├── dolphins_3.7.coms
│ │ │ ├── dolphins_3.8.coms
│ │ │ ├── dolphins_3.9.coms
│ │ │ ├── dolphins_3.coms
│ │ │ ├── dolphins_4.1.coms
│ │ │ ├── dolphins_4.2.coms
│ │ │ ├── dolphins_4.3.coms
│ │ │ ├── dolphins_4.4.coms
│ │ │ ├── dolphins_4.5.coms
│ │ │ ├── dolphins_4.6.coms
│ │ │ ├── dolphins_4.7.coms
│ │ │ ├── dolphins_4.8.coms
│ │ │ ├── dolphins_4.9.coms
│ │ │ ├── dolphins_4.coms
│ │ │ ├── dolphins_5.1.coms
│ │ │ ├── dolphins_5.2.coms
│ │ │ ├── dolphins_5.3.coms
│ │ │ ├── dolphins_5.4.coms
│ │ │ ├── dolphins_5.5.coms
│ │ │ ├── dolphins_5.6.coms
│ │ │ ├── dolphins_5.7.coms
│ │ │ ├── dolphins_5.8.coms
│ │ │ ├── dolphins_5.9.coms
│ │ │ ├── dolphins_5.coms
│ │ │ ├── dolphins_6.1.coms
│ │ │ ├── dolphins_6.2.coms
│ │ │ ├── dolphins_6.3.coms
│ │ │ ├── dolphins_6.4.coms
│ │ │ ├── dolphins_6.5.coms
│ │ │ ├── dolphins_6.6.coms
│ │ │ ├── dolphins_6.7.coms
│ │ │ ├── dolphins_6.8.coms
│ │ │ ├── dolphins_6.9.coms
│ │ │ ├── dolphins_6.coms
│ │ │ ├── dolphins_7.1.coms
│ │ │ ├── dolphins_7.2.coms
│ │ │ ├── dolphins_7.3.coms
│ │ │ ├── dolphins_7.4.coms
│ │ │ ├── dolphins_7.5.coms
│ │ │ ├── dolphins_7.6.coms
│ │ │ ├── dolphins_7.7.coms
│ │ │ ├── dolphins_7.8.coms
│ │ │ ├── dolphins_7.9.coms
│ │ │ ├── dolphins_7.coms
│ │ │ ├── dolphins_8.1.coms
│ │ │ ├── dolphins_8.2.coms
│ │ │ ├── dolphins_8.3.coms
│ │ │ ├── dolphins_8.4.coms
│ │ │ ├── dolphins_8.5.coms
│ │ │ ├── dolphins_8.6.coms
│ │ │ ├── dolphins_8.7.coms
│ │ │ ├── dolphins_8.8.coms
│ │ │ ├── dolphins_8.9.coms
│ │ │ ├── dolphins_8.coms
│ │ │ ├── dolphins_9.1.coms
│ │ │ ├── dolphins_9.2.coms
│ │ │ ├── dolphins_9.3.coms
│ │ │ ├── dolphins_9.4.coms
│ │ │ ├── dolphins_9.5.coms
│ │ │ ├── dolphins_9.6.coms
│ │ │ ├── dolphins_9.7.coms
│ │ │ ├── dolphins_9.8.coms
│ │ │ ├── dolphins_9.9.coms
│ │ │ ├── dolphins_9.coms
│ │ │ ├── football.edges
│ │ │ ├── karate.edges
│ │ │ └── miserables.edges
│ │ ├── speedtest.xcodeproj/
│ │ │ ├── project.pbxproj
│ │ │ ├── project.xcworkspace/
│ │ │ │ ├── contents.xcworkspacedata
│ │ │ │ └── xcuserdata/
│ │ │ │ └── elemarte.xcuserdatad/
│ │ │ │ └── UserInterfaceState.xcuserstate
│ │ │ └── xcuserdata/
│ │ │ └── elemarte.xcuserdatad/
│ │ │ ├── xcdebugger/
│ │ │ │ └── Breakpoints.xcbkptlist
│ │ │ └── xcschemes/
│ │ │ ├── speedtest.xcscheme
│ │ │ └── xcschememanagement.plist
│ │ └── src/
│ │ ├── analyse_main.cpp
│ │ ├── config.h
│ │ ├── conv_main.cpp
│ │ ├── mscd/
│ │ │ ├── alg/
│ │ │ │ ├── mscd_afg.cpp
│ │ │ │ ├── mscd_afg.h
│ │ │ │ ├── mscd_algorithm.h
│ │ │ │ ├── mscd_hslsw.cpp
│ │ │ │ ├── mscd_hslsw.h
│ │ │ │ ├── mscd_lfk.cpp
│ │ │ │ ├── mscd_lfk.h
│ │ │ │ ├── mscd_lfk2.cpp
│ │ │ │ ├── mscd_lfk2.h
│ │ │ │ ├── mscd_rb.cpp
│ │ │ │ ├── mscd_rb.h
│ │ │ │ ├── mscd_rn.cpp
│ │ │ │ ├── mscd_rn.h
│ │ │ │ ├── mscd_so.cpp
│ │ │ │ ├── mscd_so.h
│ │ │ │ ├── mscd_som.cpp
│ │ │ │ └── mscd_som.h
│ │ │ ├── ds/
│ │ │ │ ├── communities.h
│ │ │ │ └── graph.h
│ │ │ └── io/
│ │ │ ├── in/
│ │ │ │ ├── community_list_reader.cpp
│ │ │ │ ├── community_list_reader.h
│ │ │ │ ├── community_reader.h
│ │ │ │ ├── edge_list_graph_reader.cpp
│ │ │ │ ├── edge_list_graph_reader.h
│ │ │ │ ├── graph_reader copy.h
│ │ │ │ ├── graph_reader.h
│ │ │ │ ├── lf_community_reader.cpp
│ │ │ │ ├── lf_community_reader.h
│ │ │ │ ├── pajek_community_reader.cpp
│ │ │ │ ├── pajek_community_reader.h
│ │ │ │ ├── pajek_graph_reader.cpp
│ │ │ │ └── pajek_graph_reader.h
│ │ │ └── out/
│ │ │ ├── community_list_writer.cpp
│ │ │ ├── community_list_writer.h
│ │ │ ├── community_writer.h
│ │ │ ├── edge_list_graph_writer.cpp
│ │ │ ├── edge_list_graph_writer.h
│ │ │ ├── graph_writer.h
│ │ │ ├── lf_community_writer.cpp
│ │ │ ├── lf_community_writer.h
│ │ │ ├── pajek_community_writer.cpp
│ │ │ ├── pajek_community_writer.h
│ │ │ ├── pajek_graph_writer.cpp
│ │ │ └── pajek_graph_writer.h
│ │ ├── mscd_main.cpp
│ │ ├── speedtest_main.cpp
│ │ └── toolkit/
│ │ ├── atomic_set.h
│ │ ├── nmi.h
│ │ ├── registry.h
│ │ ├── tokeniser.cpp
│ │ ├── tokeniser.h
│ │ └── tools.h
│ ├── 2013-SVINET/
│ │ ├── ReadMe.md
│ │ ├── src-cmake/
│ │ │ ├── authors_doc/
│ │ │ │ ├── AUTHORS
│ │ │ │ ├── COPYING
│ │ │ │ ├── ChangeLog
│ │ │ │ ├── NEWS
│ │ │ │ ├── README
│ │ │ │ ├── README.md
│ │ │ │ ├── aclocal.m4
│ │ │ │ ├── detailed_readme.txt
│ │ │ │ └── validation-test-file-options-patch.txt
│ │ │ ├── example/
│ │ │ │ ├── LFR-ground-truth-n1000-k28.txt
│ │ │ │ ├── LFR-network-n1000-k28.txt
│ │ │ │ ├── assort-75-4.txt
│ │ │ │ ├── ca-AstroPh.csv
│ │ │ │ ├── n1000-k28-LFR-linksampling.tgz
│ │ │ │ ├── n17903-k20-mmsb-linksampling.tgz
│ │ │ │ └── n75-k4-mmsb-batch.tgz
│ │ │ ├── patches/
│ │ │ │ └── ammsb1.patch
│ │ │ └── src/
│ │ │ ├── CMakeLists.txt
│ │ │ ├── collection/
│ │ │ │ ├── fastqueue.hh
│ │ │ │ ├── matrix.hh
│ │ │ │ └── tsqueue.hh
│ │ │ ├── community.hh
│ │ │ ├── env.hh
│ │ │ ├── fastamm.cc
│ │ │ ├── fastamm.hh
│ │ │ ├── fastamm2.cc
│ │ │ ├── fastamm2.hh
│ │ │ ├── fastinit.cc
│ │ │ ├── fastinit.hh
│ │ │ ├── linksampling.cc
│ │ │ ├── linksampling.hh
│ │ │ ├── log.cc
│ │ │ ├── log.hh
│ │ │ ├── main.cc
│ │ │ ├── mmsbgen.cc
│ │ │ ├── mmsbgen.hh
│ │ │ ├── mmsbinfer.cc
│ │ │ ├── mmsbinfer.hh
│ │ │ ├── mmsbinferorig.cc
│ │ │ ├── mmsbinferorig.hh
│ │ │ ├── mmsborig.cc
│ │ │ ├── mmsborig.hh
│ │ │ ├── network.cc
│ │ │ ├── network.hh
│ │ │ ├── sbm.cc
│ │ │ ├── sbm.hh
│ │ │ ├── thread.cc
│ │ │ └── thread.hh
│ │ └── svinet-master/
│ │ ├── AUTHORS
│ │ ├── COPYING
│ │ ├── ChangeLog
│ │ ├── INSTALL
│ │ ├── Makefile.am
│ │ ├── Makefile.in
│ │ ├── NEWS
│ │ ├── README
│ │ ├── README.md
│ │ ├── aclocal.m4
│ │ ├── config.guess
│ │ ├── config.h.in
│ │ ├── config.sub
│ │ ├── configure
│ │ ├── configure.ac
│ │ ├── depcomp
│ │ ├── detailed_readme.txt
│ │ ├── example/
│ │ │ ├── LFR-ground-truth-n1000-k28.txt
│ │ │ ├── LFR-network-n1000-k28.txt
│ │ │ ├── assort-75-4.txt
│ │ │ ├── ca-AstroPh.csv
│ │ │ ├── n1000-k28-LFR-linksampling.tgz
│ │ │ ├── n17903-k20-mmsb-linksampling.tgz
│ │ │ └── n75-k4-mmsb-batch.tgz
│ │ ├── install-sh
│ │ ├── missing
│ │ ├── mkinstalldirs
│ │ ├── patches/
│ │ │ └── ammsb1.patch
│ │ ├── src/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── community.hh
│ │ │ ├── env.hh
│ │ │ ├── fastamm.cc
│ │ │ ├── fastamm.hh
│ │ │ ├── fastamm2.cc
│ │ │ ├── fastamm2.hh
│ │ │ ├── fastinit.cc
│ │ │ ├── fastinit.hh
│ │ │ ├── fastqueue.hh
│ │ │ ├── linksampling.cc
│ │ │ ├── linksampling.hh
│ │ │ ├── log.cc
│ │ │ ├── log.hh
│ │ │ ├── main.cc
│ │ │ ├── matrix.hh
│ │ │ ├── mmsbgen.cc
│ │ │ ├── mmsbgen.hh
│ │ │ ├── mmsbinfer.cc
│ │ │ ├── mmsbinfer.hh
│ │ │ ├── mmsbinferorig.cc
│ │ │ ├── mmsbinferorig.hh
│ │ │ ├── mmsborig.cc
│ │ │ ├── mmsborig.hh
│ │ │ ├── network.cc
│ │ │ ├── network.hh
│ │ │ ├── sbm.cc
│ │ │ ├── sbm.hh
│ │ │ ├── thread.cc
│ │ │ ├── thread.hh
│ │ │ └── tsqueue.hh
│ │ └── validation-test-file-options-patch.txt
│ ├── 2013-Seed-Set-Expansion/
│ │ ├── ReadMe.md
│ │ ├── dependencies/
│ │ │ ├── GraclusSeeds/
│ │ │ │ └── graclus1.2/
│ │ │ │ ├── Makefile
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── README_Graclus
│ │ │ │ ├── graclus
│ │ │ │ ├── libmetis.a
│ │ │ │ ├── libmultilevel.a
│ │ │ │ ├── matlab/
│ │ │ │ │ ├── ComputeCenterNodes.m
│ │ │ │ │ ├── ComputeDistances.m
│ │ │ │ │ ├── GraclusImageSegmentation.m
│ │ │ │ │ ├── discretisation.m
│ │ │ │ │ ├── discretisationEigenVectorData.asv
│ │ │ │ │ ├── discretisationEigenVectorData.m
│ │ │ │ │ ├── displayLatex.m
│ │ │ │ │ ├── eigs2.m
│ │ │ │ │ ├── get_hrc_graclus_seeds.m
│ │ │ │ │ ├── graclus.m
│ │ │ │ │ ├── graclus_compile_script.m
│ │ │ │ │ ├── graclus_mex.cpp
│ │ │ │ │ ├── graclus_mex.o
│ │ │ │ │ ├── hrcGraclus.m
│ │ │ │ │ ├── io.cpp
│ │ │ │ │ ├── io.o
│ │ │ │ │ ├── mlkkm.cpp
│ │ │ │ │ ├── mlkkm.o
│ │ │ │ │ ├── ncut.asv
│ │ │ │ │ ├── ncut.m
│ │ │ │ │ ├── ncutW.asv
│ │ │ │ │ ├── ncutW.m
│ │ │ │ │ ├── readMetis.m
│ │ │ │ │ ├── wkkm.cpp
│ │ │ │ │ └── wkkm.o
│ │ │ │ ├── metisLib/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── balance.c
│ │ │ │ │ ├── balance.o
│ │ │ │ │ ├── bucketsort.c
│ │ │ │ │ ├── bucketsort.o
│ │ │ │ │ ├── ccgraph.c
│ │ │ │ │ ├── ccgraph.o
│ │ │ │ │ ├── coarsen.c
│ │ │ │ │ ├── coarsen.o
│ │ │ │ │ ├── compress.c
│ │ │ │ │ ├── compress.o
│ │ │ │ │ ├── debug.c
│ │ │ │ │ ├── debug.o
│ │ │ │ │ ├── defs.h
│ │ │ │ │ ├── estmem.c
│ │ │ │ │ ├── estmem.o
│ │ │ │ │ ├── fm.c
│ │ │ │ │ ├── fm.o
│ │ │ │ │ ├── fortran.c
│ │ │ │ │ ├── fortran.o
│ │ │ │ │ ├── frename.c
│ │ │ │ │ ├── frename.o
│ │ │ │ │ ├── graph.c
│ │ │ │ │ ├── graph.o
│ │ │ │ │ ├── initpart.c
│ │ │ │ │ ├── initpart.o
│ │ │ │ │ ├── kmetis.c
│ │ │ │ │ ├── kmetis.o
│ │ │ │ │ ├── kvmetis.c
│ │ │ │ │ ├── kvmetis.o
│ │ │ │ │ ├── kwayfm.c
│ │ │ │ │ ├── kwayfm.o
│ │ │ │ │ ├── kwayrefine.c
│ │ │ │ │ ├── kwayrefine.o
│ │ │ │ │ ├── kwayvolfm.c
│ │ │ │ │ ├── kwayvolfm.o
│ │ │ │ │ ├── kwayvolrefine.c
│ │ │ │ │ ├── kwayvolrefine.o
│ │ │ │ │ ├── macros.h
│ │ │ │ │ ├── match.c
│ │ │ │ │ ├── match.o
│ │ │ │ │ ├── mbalance.c
│ │ │ │ │ ├── mbalance.o
│ │ │ │ │ ├── mbalance2.c
│ │ │ │ │ ├── mbalance2.o
│ │ │ │ │ ├── mcoarsen.c
│ │ │ │ │ ├── mcoarsen.o
│ │ │ │ │ ├── memory.c
│ │ │ │ │ ├── memory.o
│ │ │ │ │ ├── mesh.c
│ │ │ │ │ ├── mesh.o
│ │ │ │ │ ├── meshpart.c
│ │ │ │ │ ├── meshpart.o
│ │ │ │ │ ├── metis.h
│ │ │ │ │ ├── mfm.c
│ │ │ │ │ ├── mfm.o
│ │ │ │ │ ├── mfm2.c
│ │ │ │ │ ├── mfm2.o
│ │ │ │ │ ├── mincover.c
│ │ │ │ │ ├── mincover.o
│ │ │ │ │ ├── minitpart.c
│ │ │ │ │ ├── minitpart.o
│ │ │ │ │ ├── minitpart2.c
│ │ │ │ │ ├── minitpart2.o
│ │ │ │ │ ├── mkmetis.c
│ │ │ │ │ ├── mkmetis.o
│ │ │ │ │ ├── mkwayfmh.c
│ │ │ │ │ ├── mkwayfmh.o
│ │ │ │ │ ├── mkwayrefine.c
│ │ │ │ │ ├── mkwayrefine.o
│ │ │ │ │ ├── mmatch.c
│ │ │ │ │ ├── mmatch.o
│ │ │ │ │ ├── mmd.c
│ │ │ │ │ ├── mmd.o
│ │ │ │ │ ├── mpmetis.c
│ │ │ │ │ ├── mpmetis.o
│ │ │ │ │ ├── mrefine.c
│ │ │ │ │ ├── mrefine.o
│ │ │ │ │ ├── mrefine2.c
│ │ │ │ │ ├── mrefine2.o
│ │ │ │ │ ├── mutil.c
│ │ │ │ │ ├── mutil.o
│ │ │ │ │ ├── myqsort.c
│ │ │ │ │ ├── myqsort.o
│ │ │ │ │ ├── ometis.c
│ │ │ │ │ ├── ometis.o
│ │ │ │ │ ├── parmetis.c
│ │ │ │ │ ├── parmetis.o
│ │ │ │ │ ├── pmetis.c
│ │ │ │ │ ├── pmetis.o
│ │ │ │ │ ├── pqueue.c
│ │ │ │ │ ├── pqueue.o
│ │ │ │ │ ├── proto.h
│ │ │ │ │ ├── refine.c
│ │ │ │ │ ├── refine.o
│ │ │ │ │ ├── rename.h
│ │ │ │ │ ├── separator.c
│ │ │ │ │ ├── separator.o
│ │ │ │ │ ├── sfm.c
│ │ │ │ │ ├── sfm.o
│ │ │ │ │ ├── srefine.c
│ │ │ │ │ ├── srefine.o
│ │ │ │ │ ├── stat.c
│ │ │ │ │ ├── stat.o
│ │ │ │ │ ├── struct.h
│ │ │ │ │ ├── subdomains.c
│ │ │ │ │ ├── subdomains.o
│ │ │ │ │ ├── timing.c
│ │ │ │ │ ├── timing.o
│ │ │ │ │ ├── util.c
│ │ │ │ │ └── util.o
│ │ │ │ ├── multilevelLib/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── mlkkm.c
│ │ │ │ │ ├── mlkkm.o
│ │ │ │ │ ├── wkkm.c
│ │ │ │ │ ├── wkkm.o
│ │ │ │ │ ├── wkkm_boundary_only.c
│ │ │ │ │ ├── wkkm_experiment.c
│ │ │ │ │ └── wkkm_old.c
│ │ │ │ └── programs/
│ │ │ │ ├── Makefile
│ │ │ │ ├── graclus.c
│ │ │ │ ├── graclus.o
│ │ │ │ ├── io.c
│ │ │ │ ├── io.h
│ │ │ │ └── io.o
│ │ │ └── matlab_bgl/
│ │ │ ├── .project
│ │ │ ├── @inplace/
│ │ │ │ ├── assign.m
│ │ │ │ ├── display.m
│ │ │ │ ├── double.m
│ │ │ │ ├── end.m
│ │ │ │ ├── inplace.m
│ │ │ │ ├── size.m
│ │ │ │ ├── subsasgn.m
│ │ │ │ └── subsref.m
│ │ │ ├── @ipdouble/
│ │ │ │ └── ipdouble.m
│ │ │ ├── @ipint32/
│ │ │ │ └── ipint32.m
│ │ │ ├── Contents.m
│ │ │ ├── all_shortest_paths.m
│ │ │ ├── astar_search.m
│ │ │ ├── bellman_ford_sp.m
│ │ │ ├── betweenness_centrality.m
│ │ │ ├── bfs.m
│ │ │ ├── biconnected_components.m
│ │ │ ├── boyer_myrvold_planarity_test.m
│ │ │ ├── breadth_first_search.m
│ │ │ ├── chrobak_payne_straight_line_drawing.m
│ │ │ ├── circle_graph_layout.m
│ │ │ ├── clique_graph.m
│ │ │ ├── clustering_coefficients.m
│ │ │ ├── combine_visitors.m
│ │ │ ├── components.m
│ │ │ ├── core_numbers.m
│ │ │ ├── custom/
│ │ │ │ ├── dijkstra_all_sp.m
│ │ │ │ └── path_histogram.m
│ │ │ ├── cycle_graph.m
│ │ │ ├── dag_sp.m
│ │ │ ├── depth_first_search.m
│ │ │ ├── dfs.m
│ │ │ ├── dijkstra_sp.m
│ │ │ ├── doc/
│ │ │ │ ├── changed.txt
│ │ │ │ ├── html/
│ │ │ │ │ ├── changes.html
│ │ │ │ │ ├── core_numbers_example/
│ │ │ │ │ │ └── core_numbers_example.html
│ │ │ │ │ ├── faq.html
│ │ │ │ │ ├── index.html
│ │ │ │ │ ├── new_in_3/
│ │ │ │ │ │ └── new_in_3_0.html
│ │ │ │ │ ├── new_in_4/
│ │ │ │ │ │ └── new_in_4_0.html
│ │ │ │ │ ├── old.html
│ │ │ │ │ ├── planar_graphs/
│ │ │ │ │ │ └── planar_graphs.html
│ │ │ │ │ ├── record_alg/
│ │ │ │ │ │ └── record_alg.html
│ │ │ │ │ ├── red_black/
│ │ │ │ │ │ └── red_black.html
│ │ │ │ │ ├── reweighted_graphs/
│ │ │ │ │ │ └── reweighted_graphs.html
│ │ │ │ │ ├── site.css
│ │ │ │ │ └── style.css
│ │ │ │ ├── mxdom2mbgl-html.xsl
│ │ │ │ └── write_examples_html.m
│ │ │ ├── edge_weight_index.m
│ │ │ ├── edge_weight_vector.m
│ │ │ ├── edmonds_maximum_cardinality_matching.m
│ │ │ ├── edmunds_karp_max_flow.m
│ │ │ ├── erdos_reyni.m
│ │ │ ├── examples/
│ │ │ │ ├── approx_multiway_cut.m
│ │ │ │ ├── bacon_numbers.m
│ │ │ │ ├── bfs_example.m
│ │ │ │ ├── bfs_in_mbgl.m
│ │ │ │ ├── bfs_in_mbgl_efficient.m
│ │ │ │ ├── core_numbers_example.m
│ │ │ │ ├── dfs_example.m
│ │ │ │ ├── edge_index_example.m
│ │ │ │ ├── max_flow_example.m
│ │ │ │ ├── multiway_example.m
│ │ │ │ ├── new_in_3_0.m
│ │ │ │ ├── new_in_4_0.m
│ │ │ │ ├── planar_graphs.m
│ │ │ │ ├── record_alg.m
│ │ │ │ ├── red_black.m
│ │ │ │ └── reweighted_graphs.m
│ │ │ ├── floyd_warshall_all_sp.m
│ │ │ ├── fruchterman_reingold_force_directed_layout.m
│ │ │ ├── graphs/
│ │ │ │ ├── all_shortest_paths_example.mat
│ │ │ │ ├── bfs_example.mat
│ │ │ │ ├── bgl_cities.mat
│ │ │ │ ├── clique-10.mat
│ │ │ │ ├── clr-24-1.mat
│ │ │ │ ├── clr-25-2.mat
│ │ │ │ ├── clr-26-1.mat
│ │ │ │ ├── clr-27-1.mat
│ │ │ │ ├── cores_example.mat
│ │ │ │ ├── cs-stanford.mat
│ │ │ │ ├── dfs_example.mat
│ │ │ │ ├── dominator_tree_example.mat
│ │ │ │ ├── kt-3-2.mat
│ │ │ │ ├── kt-3-7.mat
│ │ │ │ ├── kt-6-23.mat
│ │ │ │ ├── kt-7-2.mat
│ │ │ │ ├── line-7.mat
│ │ │ │ ├── matching_example.mat
│ │ │ │ ├── max_flow_example.mat
│ │ │ │ ├── minnesota.mat
│ │ │ │ ├── padgett-florentine.mat
│ │ │ │ ├── tapir.mat
│ │ │ │ └── tarjan-biconn.mat
│ │ │ ├── grid_graph.m
│ │ │ ├── gursoy_atun_layout.m
│ │ │ ├── indexed_sparse.m
│ │ │ ├── is_kuratowski_graph.m
│ │ │ ├── is_straight_line_drawing.m
│ │ │ ├── johnson_all_sp.m
│ │ │ ├── kamada_kawai_spring_layout.m
│ │ │ ├── kolmogorov_max_flow.m
│ │ │ ├── kruskal_mst.m
│ │ │ ├── kuratowski_subgraph.m
│ │ │ ├── lengauer_tarjan_dominator_tree.m
│ │ │ ├── libmbgl/
│ │ │ │ ├── ccfiles.sh
│ │ │ │ ├── compile-linux-32.sh
│ │ │ │ ├── compile-linux-64-large.sh
│ │ │ │ ├── compile-linux-64.sh
│ │ │ │ ├── compile-macosx-intel-32.sh
│ │ │ │ ├── compile-macosx-ppc-32.sh
│ │ │ │ ├── compile-win32.bat
│ │ │ │ ├── compile-win64.bat
│ │ │ │ ├── components.cc
│ │ │ │ ├── crm_graph.hpp
│ │ │ │ ├── include/
│ │ │ │ │ ├── matlab_bgl.h
│ │ │ │ │ └── matlab_bgl_types.h
│ │ │ │ ├── layouts.cc
│ │ │ │ ├── libmbgl.sln
│ │ │ │ ├── libmbgl.vcproj
│ │ │ │ ├── libmbgl_test/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── fr_layout_test.cc
│ │ │ │ │ ├── layout_funcs_test.cc
│ │ │ │ │ ├── libmbgl_funcs_test.cc
│ │ │ │ │ ├── libmbgl_funcs_test.h
│ │ │ │ │ ├── libmbgl_test.cc
│ │ │ │ │ ├── libmbgl_test.vcproj
│ │ │ │ │ ├── planar_funcs_test.cc
│ │ │ │ │ ├── planar_is_straight_line_test.cc
│ │ │ │ │ ├── planar_ksubgraph_test.cc
│ │ │ │ │ ├── property_map_test.cc
│ │ │ │ │ ├── simple_prop_map_test.cc
│ │ │ │ │ ├── simple_prop_map_test_2.cc
│ │ │ │ │ ├── simple_prop_map_test_3.cc
│ │ │ │ │ └── simple_prop_map_test_4.cc
│ │ │ │ ├── libmbgl_util.hpp
│ │ │ │ ├── max_flow.cc
│ │ │ │ ├── orderings.cc
│ │ │ │ ├── planar.cc
│ │ │ │ ├── searches.cc
│ │ │ │ ├── shortest_path.cc
│ │ │ │ ├── spanning_trees.cc
│ │ │ │ ├── statistics.cc
│ │ │ │ ├── stop_visitors.hpp
│ │ │ │ ├── visitor_macros.hpp
│ │ │ │ └── yasmic/
│ │ │ │ ├── .sconsign
│ │ │ │ ├── bgl_kcore.hpp
│ │ │ │ ├── binary_ifstream_graph.hpp
│ │ │ │ ├── binary_ifstream_matrix.hpp
│ │ │ │ ├── bind_utility.hpp
│ │ │ │ ├── boost_mod/
│ │ │ │ │ ├── .sconsign
│ │ │ │ │ ├── bellman_ford_shortest_paths.hpp
│ │ │ │ │ ├── betweenness_centrality.hpp
│ │ │ │ │ ├── chrobak_payne_drawing.hpp
│ │ │ │ │ ├── core_numbers.hpp
│ │ │ │ │ ├── floyd_warshall_shortest.hpp
│ │ │ │ │ ├── fruchterman_reingold.hpp
│ │ │ │ │ ├── gzip.hpp
│ │ │ │ │ ├── integer_extra.hpp
│ │ │ │ │ ├── is_straight_line_drawing.hpp
│ │ │ │ │ ├── johnson_all_pairs_shortest.hpp
│ │ │ │ │ ├── kolmogorov_max_flow.hpp
│ │ │ │ │ ├── kruskal_min_spanning_tree.hpp
│ │ │ │ │ └── zlib.cpp
│ │ │ │ ├── bvgraph_matrix.hpp
│ │ │ │ ├── cluto_ifstream_matrix.hpp
│ │ │ │ ├── compressed_row_matrix.hpp
│ │ │ │ ├── compressed_row_matrix_graph.hpp
│ │ │ │ ├── generic_matrix_operations.hpp
│ │ │ │ ├── graph_ifstream_matrix.hpp
│ │ │ │ ├── ifstream_as_matrix.hpp
│ │ │ │ ├── ifstream_matrix.hpp
│ │ │ │ ├── indexed_list.hpp
│ │ │ │ ├── indexed_list.old.hpp
│ │ │ │ ├── indexed_list_as_graph.hpp
│ │ │ │ ├── istream_as_matrix.hpp
│ │ │ │ ├── iterator_utility.hpp
│ │ │ │ ├── matrix_row_col_graph.hpp
│ │ │ │ ├── nonzero_union.hpp
│ │ │ │ ├── simple_csr_matrix.hpp
│ │ │ │ ├── simple_csr_matrix_as_graph.hpp
│ │ │ │ ├── simple_row_and_column_matrix.hpp
│ │ │ │ ├── simple_row_and_column_matrix_as_graph.hpp
│ │ │ │ ├── smatrix_traits.hpp
│ │ │ │ ├── transpose_matrix.hpp
│ │ │ │ ├── tuple_utility.hpp
│ │ │ │ ├── undir_simple_csr_matrix.hpp
│ │ │ │ ├── undir_simple_csr_matrix_as_graph.hpp
│ │ │ │ ├── util/
│ │ │ │ │ ├── .sconsign
│ │ │ │ │ ├── crm_matrix.hpp
│ │ │ │ │ ├── filtered_matrix.hpp
│ │ │ │ │ ├── load_crm_graph.hpp
│ │ │ │ │ ├── load_crm_matrix.hpp
│ │ │ │ │ ├── write_matrix.hpp
│ │ │ │ │ └── write_petsc_matrix.hpp
│ │ │ │ ├── verbose_util.hpp
│ │ │ │ ├── yasmic.cbp
│ │ │ │ ├── yasmic.layout
│ │ │ │ └── yasmic.vcproj
│ │ │ ├── make_biconnected_planar.m
│ │ │ ├── make_connected.m
│ │ │ ├── make_maximal_planar.m
│ │ │ ├── matching.m
│ │ │ ├── max_flow.m
│ │ │ ├── maximal_matching.m
│ │ │ ├── mst.m
│ │ │ ├── num_edges.m
│ │ │ ├── num_vertices.m
│ │ │ ├── path_from_pred.m
│ │ │ ├── planar_canonical_ordering.m
│ │ │ ├── prim_mst.m
│ │ │ ├── private/
│ │ │ │ ├── astar_search_mex.c
│ │ │ │ ├── betweenness_centrality_mex.c
│ │ │ │ ├── bfs_dfs_vis_mex.c
│ │ │ │ ├── bfs_mex.c
│ │ │ │ ├── biconnected_components_mex.c
│ │ │ │ ├── check_matlab_bgl.m
│ │ │ │ ├── clustering_coefficients_mex.c
│ │ │ │ ├── common_functions.h
│ │ │ │ ├── common_macros.h
│ │ │ │ ├── compile.m
│ │ │ │ ├── components_mex.c
│ │ │ │ ├── core_numbers_mex.c
│ │ │ │ ├── dfs_mex.c
│ │ │ │ ├── dominator_tree_mex.c
│ │ │ │ ├── expand_macros.h
│ │ │ │ ├── fruchterman_reingold_mex.c
│ │ │ │ ├── get_matlab_bgl_options.m
│ │ │ │ ├── gursoy_atun_mex.c
│ │ │ │ ├── kamada_kawai_spring_layout_mex.c
│ │ │ │ ├── matching_mex.c
│ │ │ │ ├── matlab_bgl_all_sp_mex.c
│ │ │ │ ├── matlab_bgl_sp_mex.c
│ │ │ │ ├── max_flow_mex.c
│ │ │ │ ├── merge_options.m
│ │ │ │ ├── merge_structs.m
│ │ │ │ ├── mst_mex.c
│ │ │ │ ├── path_from_pred_mex.c
│ │ │ │ ├── planar_drawing_mex.c
│ │ │ │ ├── planar_edges_mex.c
│ │ │ │ ├── planar_test_mex.c
│ │ │ │ ├── test_matching_mex.c
│ │ │ │ ├── todo.m
│ │ │ │ ├── todo_3_0_release.m
│ │ │ │ ├── topological_order_mex.c
│ │ │ │ └── visitor_macros.h
│ │ │ ├── push_relabel_max_flow.m
│ │ │ ├── random_graph_layout.m
│ │ │ ├── set_matlab_bgl_default.m
│ │ │ ├── shortest_paths.m
│ │ │ ├── star_graph.m
│ │ │ ├── test/
│ │ │ │ ├── assert.m
│ │ │ │ ├── rtest_1.m
│ │ │ │ ├── rtest_2.m
│ │ │ │ ├── rtest_3_cojocaru.m
│ │ │ │ ├── rtest_5_henderson.m
│ │ │ │ ├── rtest_6.m
│ │ │ │ ├── rtest_7_karsi.m
│ │ │ │ ├── rtest_all.m
│ │ │ │ ├── test_all.m
│ │ │ │ ├── test_benchmark.m
│ │ │ │ ├── test_breadth_first_search.m
│ │ │ │ ├── test_components.m
│ │ │ │ ├── test_depth_first_search.m
│ │ │ │ ├── test_examples.m
│ │ │ │ ├── test_layouts.m
│ │ │ │ ├── test_main.m
│ │ │ │ ├── test_planar.m
│ │ │ │ ├── test_searches.m
│ │ │ │ ├── test_shortest_paths.m
│ │ │ │ ├── test_spanning_trees.m
│ │ │ │ ├── test_statistics.m
│ │ │ │ └── test_trivial.m
│ │ │ ├── test_dag.m
│ │ │ ├── test_matching.m
│ │ │ ├── test_planar_graph.m
│ │ │ ├── topological_order.m
│ │ │ ├── tree_from_pred.m
│ │ │ └── wheel_graph.m
│ │ └── src/
│ │ ├── Assign_bi.m
│ │ ├── add_extra_community_data.m
│ │ ├── biconncore.m
│ │ ├── compile.m
│ │ ├── cutcond_mex.cc
│ │ ├── evaluate_clusters.m
│ │ ├── filter_community_conductance.m
│ │ ├── flip_C.m
│ │ ├── graphprep.m
│ │ ├── growclusters.m
│ │ ├── largest_component.m
│ │ ├── localEgoSeeds.m
│ │ ├── merge_community_data.m
│ │ ├── neighborhoodmin.m
│ │ ├── nise.m
│ │ ├── pprgrow.m
│ │ ├── pprgrow_mex.cc
│ │ ├── seed_report_expand.m
│ │ ├── spHubSeeds.m
│ │ ├── triangleclusters.m
│ │ ├── triangleclusters_mex.cc
│ │ ├── vpprgrow.m
│ │ └── vpprgrow_mex.cc
│ ├── 2014-Heat-Kernel/
│ │ ├── ReadMe.md
│ │ ├── authors_original_files/
│ │ │ ├── data/
│ │ │ │ ├── amazon.mat
│ │ │ │ ├── four_clusters.smat
│ │ │ │ └── netscience-cc.smat
│ │ │ ├── experiments/
│ │ │ │ ├── chirikov/
│ │ │ │ │ ├── chirikov_example.m
│ │ │ │ │ ├── chirikov_operator.m
│ │ │ │ │ ├── compile.m
│ │ │ │ │ ├── imwrite_scaled.m
│ │ │ │ │ └── pprgrow_mex.cc
│ │ │ │ ├── experimenthkgrow.m
│ │ │ │ ├── experimentpprgrow.m
│ │ │ │ ├── ground_truth/
│ │ │ │ │ ├── amazoncommunity.m
│ │ │ │ │ ├── dblpcommunity.m
│ │ │ │ │ ├── friendstercommunity.m
│ │ │ │ │ ├── ljournalcommunity.m
│ │ │ │ │ ├── orkutcommunity.m
│ │ │ │ │ └── youtubecommunity.m
│ │ │ │ ├── heavyhood.m
│ │ │ │ ├── heavyseed.m
│ │ │ │ ├── heavytwitter.m
│ │ │ │ ├── pathweights_figure.m
│ │ │ │ ├── pprfriendster.m
│ │ │ │ ├── pprheavytwitter.m
│ │ │ │ ├── pprljournal.m
│ │ │ │ ├── pprtwitter.m
│ │ │ │ ├── randhood.m
│ │ │ │ ├── randseed.m
│ │ │ │ ├── set_figure_size.m
│ │ │ │ ├── subplot3.m
│ │ │ │ ├── trials_friendster.m
│ │ │ │ ├── trials_hkgrow.m
│ │ │ │ ├── trials_ljournal.m
│ │ │ │ ├── trials_pprgrow.m
│ │ │ │ └── trials_twitter.m
│ │ │ ├── plotting/
│ │ │ │ ├── conductances.m
│ │ │ │ ├── plotconductances.m
│ │ │ │ ├── plotruntimes.m
│ │ │ │ ├── runtimes.m
│ │ │ │ └── twitcondvsclust.m
│ │ │ ├── ppr_src/
│ │ │ │ ├── compile.m
│ │ │ │ ├── pprgrow.m
│ │ │ │ └── pprgrow_mex.cc
│ │ │ └── src/
│ │ │ ├── README.md
│ │ │ ├── compile.m
│ │ │ ├── hkgrow.m
│ │ │ ├── hkgrow1.m
│ │ │ ├── hkgrow_mex.cpp
│ │ │ ├── hkgrow_mex_kdd.cpp
│ │ │ ├── load_graph.m
│ │ │ ├── normout.m
│ │ │ ├── readSMAT.m
│ │ │ ├── symmatfriend.m
│ │ │ ├── symmattwit.m
│ │ │ ├── test_hkgrow.m
│ │ │ └── test_hkgrow_mex.m
│ │ ├── src_cpp_matlab/
│ │ │ ├── hkgrow.m
│ │ │ ├── hkgrow1.m
│ │ │ ├── hkgrow_mex.cpp
│ │ │ ├── hkgrow_mex_kdd.cpp
│ │ │ ├── test_hkgrow.m
│ │ │ └── test_hkgrow_mex.m
│ │ ├── src_python/
│ │ │ ├── .gitignore
│ │ │ ├── ReadMe.md
│ │ │ ├── __init__.py
│ │ │ ├── dataset/
│ │ │ │ ├── __init__.py
│ │ │ │ ├── get_data.sh
│ │ │ │ └── graph_eval_script.txt
│ │ │ ├── demo_files/
│ │ │ │ ├── __init__.py
│ │ │ │ ├── gexpmq.py
│ │ │ │ ├── hr_relax.py
│ │ │ │ ├── yche_exp.py
│ │ │ │ └── yche_numerical_linear_algebra_exp.py
│ │ │ └── main_files/
│ │ │ ├── __init__.py
│ │ │ ├── algo_hr_grow.py
│ │ │ ├── algo_ppr.py
│ │ │ └── util_helper.py
│ │ └── yche_refactor/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── hkgrow_mex_kdd.cpp
│ │ └── main.cpp
│ └── 2015-LEMON/
│ ├── .gitignore
│ ├── LEMON/
│ │ └── __init__.py
│ ├── LICENSE
│ ├── README.md
│ ├── example/
│ │ └── amazon/
│ │ ├── README
│ │ ├── community
│ │ ├── graph
│ │ └── seed
│ └── python_yche_refactor/
│ ├── eval_ground_truth.txt
│ ├── io_helper.py
│ └── lemon.py
├── Benchmark/
│ └── 2009-LFR-Benchmark/
│ ├── ReadMe.md
│ ├── src_original_cpp/
│ │ ├── ReadMe.md
│ │ ├── binary_networks/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Sources/
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── cc.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ └── standard_include.cpp
│ │ │ ├── Thanks.txt
│ │ │ └── makefile
│ │ ├── directed_networks/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Sources/
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ └── standard_include.cpp
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ ├── hierarchical_bench2_2/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ ├── hier_ben_Sources/
│ │ │ │ ├── a.out
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── binary_benchm.cpp
│ │ │ │ ├── cc.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ └── standard_package/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── mutual.cpp
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── standard_include.cpp
│ │ │ │ └── tabdeg.cpp
│ │ │ └── makefile
│ │ ├── weighted_directed_nets/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Sources/
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── dir_benchm.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ └── standard_include.cpp
│ │ │ ├── Thanks.txt
│ │ │ ├── benchmark
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ └── weighted_networks/
│ │ ├── ReadMe.txt
│ │ ├── Sources/
│ │ │ ├── Icon_
│ │ │ ├── benchm.cpp
│ │ │ ├── binary_benchm.cpp
│ │ │ ├── cast.cpp
│ │ │ ├── cc.cpp
│ │ │ ├── combinatorics.cpp
│ │ │ ├── histograms.cpp
│ │ │ ├── print.cpp
│ │ │ ├── random.cpp
│ │ │ ├── set_parameters.cpp
│ │ │ └── standard_include.cpp
│ │ ├── Thanks.txt
│ │ ├── gpl.txt
│ │ └── makefile
│ └── src_refactor_cpp/
│ ├── .gitignore
│ ├── CMakeLists.txt
│ ├── ReadMe.md
│ ├── benchmark_gen.py
│ ├── directed_graph/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── benchm.cpp
│ │ ├── doc/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Thanks.txt
│ │ │ └── gpl.txt
│ │ ├── set_parameters.cpp
│ │ └── set_parameters.h
│ ├── documents/
│ │ └── ReadMe.md
│ ├── hierarchical_comm_graph/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── benchm.cpp
│ │ ├── binary_benchm.cpp
│ │ ├── binary_benchm.h
│ │ ├── doc/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ ├── set_parameters.cpp
│ │ └── set_parameters.h
│ ├── playground/
│ │ ├── CMakeLists.txt
│ │ ├── nmi_usage_demo.cpp
│ │ └── tabdeg_demo.cpp
│ ├── run_undir_gperf.sh
│ ├── run_undir_perf.sh
│ ├── undirected_graph/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── benchm.cpp
│ │ ├── doc/
│ │ │ ├── ReadMe.txt
│ │ │ └── Thanks.txt
│ │ ├── set_parameters.cpp
│ │ └── set_parameters.h
│ ├── util/
│ │ ├── cast.cpp
│ │ ├── cast.h
│ │ ├── cc.cpp
│ │ ├── cc.h
│ │ ├── combinatorics.cpp
│ │ ├── combinatorics.h
│ │ ├── histograms.cpp
│ │ ├── histograms.h
│ │ ├── input_output/
│ │ │ ├── tab_degree.cpp
│ │ │ └── tab_degree.h
│ │ ├── metric/
│ │ │ ├── mutual.cpp
│ │ │ └── mutual.h
│ │ ├── pretty_print.h
│ │ ├── random.cpp
│ │ ├── random.h
│ │ └── unused/
│ │ ├── deque_numeric.cpp
│ │ ├── deque_numeric.h
│ │ └── input_output/
│ │ ├── pajek.cpp
│ │ └── partition.cpp
│ ├── weighted_directed_graph/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── benchm.cpp
│ │ ├── dir_benchm.cpp
│ │ ├── dir_benchm.h
│ │ ├── doc/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ ├── set_parameters.cpp
│ │ └── set_parameters.h
│ └── weighted_graph/
│ ├── CMakeLists.txt
│ ├── ReadMe.md
│ ├── benchm.cpp
│ ├── binary_benchm.cpp
│ ├── binary_benchm.h
│ ├── doc/
│ │ ├── ReadMe.txt
│ │ ├── Thanks.txt
│ │ └── gpl.txt
│ ├── set_parameters.cpp
│ └── set_parameters.h
├── CONTRIBUTING.md
├── Datasets/
│ ├── ReadMe.md
│ ├── collaboration_edge_list.txt
│ ├── epinions_edge_list.txt
│ ├── facebook_edge_list.txt
│ ├── football_edge_list.txt
│ ├── karate_edge_list.txt
│ ├── slashdot0811_edge_list.txt
│ ├── slashdot0902_edge_list.txt
│ └── wiki_vote_edge_list.txt
├── License.md
├── Metrics/
│ ├── MultiplexNMI-Benchmark/
│ │ ├── MultiplexBenchmark/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Sources/
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── cc.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ ├── standard_bench.cpp
│ │ │ │ └── standard_include.cpp
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ └── MultiplexNMI/
│ │ ├── ReadMe.txt
│ │ ├── clu1
│ │ ├── clu2
│ │ ├── nmi_multiplex.cpp
│ │ └── standard_package/
│ │ ├── assert.cpp
│ │ ├── cast.cpp
│ │ ├── combinatorics.cpp
│ │ ├── deque_numeric.cpp
│ │ ├── histograms.cpp
│ │ ├── map_utilities.cpp
│ │ ├── mutual.cpp
│ │ ├── pajek.cpp
│ │ ├── partition.cpp
│ │ ├── print.cpp
│ │ ├── random.cpp
│ │ ├── standard_include.cpp
│ │ └── tabdeg.cpp
│ ├── ReadMe.md
│ ├── __init__.py
│ ├── analyze_algo_quality.py
│ ├── cis_fb.out
│ ├── facebook_combined.txt
│ ├── metrics/
│ │ ├── __init__.py
│ │ ├── demo_graph.csv
│ │ ├── link_belong_modularity.py
│ │ ├── omega_idx.py
│ │ ├── overlap_nmi.py
│ │ └── util.py
│ ├── mutual3/
│ │ ├── ReadMe.txt
│ │ ├── makefile
│ │ ├── mutual
│ │ ├── mutual3.cpp
│ │ └── standard_package/
│ │ ├── Icon
│ │ ├── cast.cpp
│ │ ├── combinatorics.cpp
│ │ ├── deque_numeric.cpp
│ │ ├── histograms.cpp
│ │ ├── mutual.cpp
│ │ ├── partition.cpp
│ │ ├── print.cpp
│ │ ├── random.cpp
│ │ └── standard_include.cpp
│ └── play_ground/
│ ├── __init__.py
│ └── play_ground.py
├── NonOverlappingCodes/
│ ├── 2005-Markov-Clustering/
│ │ ├── ReadMe.md
│ │ └── mcl-14-137/
│ │ ├── AUTHORS
│ │ ├── COPYING
│ │ ├── ChangeLog
│ │ ├── INSTALL
│ │ ├── LICENSE
│ │ ├── Makefile.am
│ │ ├── Makefile.in
│ │ ├── NEWS
│ │ ├── README
│ │ ├── THANKS
│ │ ├── TODO
│ │ ├── VERSION
│ │ ├── acinclude.m4
│ │ ├── aclocal.m4
│ │ ├── autofoo/
│ │ │ ├── config.guess
│ │ │ ├── config.sub
│ │ │ ├── depcomp
│ │ │ ├── install-sh
│ │ │ └── missing
│ │ ├── bootstrap
│ │ ├── config.h.in
│ │ ├── configure
│ │ ├── configure.ac
│ │ ├── configure.ac.in
│ │ ├── doc/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── clm.1
│ │ │ ├── clm.azm
│ │ │ ├── clm.html
│ │ │ ├── clm.ps
│ │ │ ├── clmclose.1
│ │ │ ├── clmclose.azm
│ │ │ ├── clmclose.html
│ │ │ ├── clmclose.ps
│ │ │ ├── clmdist.1
│ │ │ ├── clmdist.azm
│ │ │ ├── clmdist.html
│ │ │ ├── clmdist.ps
│ │ │ ├── clmformat.1
│ │ │ ├── clmformat.azm
│ │ │ ├── clmformat.html
│ │ │ ├── clmformat.ps
│ │ │ ├── clmimac.1
│ │ │ ├── clmimac.azm
│ │ │ ├── clmimac.html
│ │ │ ├── clmimac.ps
│ │ │ ├── clminfo.1
│ │ │ ├── clminfo.azm
│ │ │ ├── clminfo.html
│ │ │ ├── clminfo.ps
│ │ │ ├── clminfo2.1
│ │ │ ├── clminfo2.azm
│ │ │ ├── clminfo2.html
│ │ │ ├── clminfo2.ps
│ │ │ ├── clmmate.1
│ │ │ ├── clmmate.azm
│ │ │ ├── clmmate.html
│ │ │ ├── clmmate.ps
│ │ │ ├── clmmeet.1
│ │ │ ├── clmmeet.azm
│ │ │ ├── clmmeet.html
│ │ │ ├── clmmeet.ps
│ │ │ ├── clmoptics.1
│ │ │ ├── clmoptics.azm
│ │ │ ├── clmoptics.html
│ │ │ ├── clmoptics.ps
│ │ │ ├── clmorder.1
│ │ │ ├── clmorder.azm
│ │ │ ├── clmorder.html
│ │ │ ├── clmorder.ps
│ │ │ ├── clmprotocols.5
│ │ │ ├── clmprotocols.azm
│ │ │ ├── clmprotocols.html
│ │ │ ├── clmprotocols.ps
│ │ │ ├── clmprotocols2.5
│ │ │ ├── clmprotocols2.azm
│ │ │ ├── clmprotocols2.html
│ │ │ ├── clmprotocols2.ps
│ │ │ ├── clmresidue.1
│ │ │ ├── clmresidue.azm
│ │ │ ├── clmresidue.html
│ │ │ ├── clmresidue.ps
│ │ │ ├── clmvol.1
│ │ │ ├── clmvol.azm
│ │ │ ├── clmvol.html
│ │ │ ├── clmvol.ps
│ │ │ ├── distindex.html
│ │ │ ├── index.html
│ │ │ ├── index.in.azm
│ │ │ ├── mcl.1
│ │ │ ├── mcl.azm
│ │ │ ├── mcl.html
│ │ │ ├── mcl.ps
│ │ │ ├── mcl.txt
│ │ │ ├── mclblastline.html
│ │ │ ├── mclblastline.ps
│ │ │ ├── mclcm.1
│ │ │ ├── mclcm.azm
│ │ │ ├── mclcm.html
│ │ │ ├── mclcm.ps
│ │ │ ├── mclcm.txt
│ │ │ ├── mclfamily.7
│ │ │ ├── mclfamily.azm
│ │ │ ├── mclfamily.html
│ │ │ ├── mclfamily.ps
│ │ │ ├── mclfaq.7
│ │ │ ├── mclfaq.azm
│ │ │ ├── mclfaq.html
│ │ │ ├── mclfaq.ps
│ │ │ ├── mclfaq.txt
│ │ │ ├── mclindex.7
│ │ │ ├── mclindex.ps
│ │ │ ├── mclmcl.txt
│ │ │ ├── mclpipeline.1
│ │ │ ├── mclpipeline.azm
│ │ │ ├── mclpipeline.html
│ │ │ ├── mclpipeline.ps
│ │ │ ├── mcx.1
│ │ │ ├── mcx.azm
│ │ │ ├── mcx.html
│ │ │ ├── mcx.ps
│ │ │ ├── mcx.zmm
│ │ │ ├── mcxalter.1
│ │ │ ├── mcxalter.azm
│ │ │ ├── mcxalter.html
│ │ │ ├── mcxalter.ps
│ │ │ ├── mcxarray.1
│ │ │ ├── mcxarray.azm
│ │ │ ├── mcxarray.html
│ │ │ ├── mcxarray.ps
│ │ │ ├── mcxassemble.1
│ │ │ ├── mcxassemble.azm
│ │ │ ├── mcxassemble.html
│ │ │ ├── mcxassemble.ps
│ │ │ ├── mcxclcf.1
│ │ │ ├── mcxclcf.azm
│ │ │ ├── mcxclcf.html
│ │ │ ├── mcxclcf.ps
│ │ │ ├── mcxconvert.1
│ │ │ ├── mcxconvert.azm
│ │ │ ├── mcxconvert.html
│ │ │ ├── mcxconvert.ps
│ │ │ ├── mcxctty.1
│ │ │ ├── mcxctty.azm
│ │ │ ├── mcxctty.html
│ │ │ ├── mcxctty.ps
│ │ │ ├── mcxdeblast.html
│ │ │ ├── mcxdeblast.ps
│ │ │ ├── mcxdiameter.1
│ │ │ ├── mcxdiameter.azm
│ │ │ ├── mcxdiameter.html
│ │ │ ├── mcxdiameter.ps
│ │ │ ├── mcxdump.1
│ │ │ ├── mcxdump.azm
│ │ │ ├── mcxdump.html
│ │ │ ├── mcxdump.ps
│ │ │ ├── mcxerdos.1
│ │ │ ├── mcxerdos.azm
│ │ │ ├── mcxerdos.html
│ │ │ ├── mcxerdos.ps
│ │ │ ├── mcxi.1
│ │ │ ├── mcxi.azm
│ │ │ ├── mcxi.html
│ │ │ ├── mcxi.ps
│ │ │ ├── mcxio.5
│ │ │ ├── mcxio.azm
│ │ │ ├── mcxio.html
│ │ │ ├── mcxio.ps
│ │ │ ├── mcxload.1
│ │ │ ├── mcxload.azm
│ │ │ ├── mcxload.html
│ │ │ ├── mcxload.ps
│ │ │ ├── mcxmap.1
│ │ │ ├── mcxmap.azm
│ │ │ ├── mcxmap.html
│ │ │ ├── mcxmap.ps
│ │ │ ├── mcxquery.1
│ │ │ ├── mcxquery.azm
│ │ │ ├── mcxquery.html
│ │ │ ├── mcxquery.ps
│ │ │ ├── mcxrand.1
│ │ │ ├── mcxrand.azm
│ │ │ ├── mcxrand.html
│ │ │ ├── mcxrand.ps
│ │ │ ├── mcxsubs.1
│ │ │ ├── mcxsubs.azm
│ │ │ ├── mcxsubs.html
│ │ │ ├── mcxsubs.ps
│ │ │ ├── minimcl
│ │ │ ├── stamp.day
│ │ │ ├── stamp.month
│ │ │ ├── stamp.stamp
│ │ │ ├── stamp.year
│ │ │ ├── tingea.log.7
│ │ │ ├── tingea.log.azm
│ │ │ ├── tingea.log.html
│ │ │ └── tingea.log.ps
│ │ ├── graphs/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── T
│ │ │ ├── Tx
│ │ │ ├── Txy
│ │ │ ├── Ty
│ │ │ ├── data.abc.hdr
│ │ │ ├── data.abc.raw
│ │ │ ├── data.hdr
│ │ │ ├── data.raw
│ │ │ ├── data.tab
│ │ │ ├── falkner.coords
│ │ │ ├── falkner.mci
│ │ │ ├── falkner2.mci
│ │ │ ├── friends
│ │ │ ├── fznyy.mci
│ │ │ ├── fznyy.tab
│ │ │ ├── honey.mci
│ │ │ ├── infinity.mci
│ │ │ ├── lattice.mci
│ │ │ ├── make-falkner.pl
│ │ │ ├── matula.mci
│ │ │ ├── petersen.mci
│ │ │ ├── proteins.mci
│ │ │ ├── seven.mci
│ │ │ ├── small.mci
│ │ │ ├── small.tab
│ │ │ ├── small64.mci
│ │ │ ├── tiny-min.mci
│ │ │ ├── tiny-nil.mci
│ │ │ ├── tiny-nilnine.mci
│ │ │ ├── tiny-ninenil.mci
│ │ │ ├── tiny-one.mci
│ │ │ └── tiny-zero.mci
│ │ ├── img/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── fa.ps
│ │ │ ├── falkner-bidi.ps
│ │ │ ├── falkner.ps
│ │ │ └── small.ps
│ │ ├── include/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ └── include.am
│ │ ├── mkinstalldirs
│ │ ├── scripts/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── TODO
│ │ │ ├── clmsnare
│ │ │ ├── clxcoarse
│ │ │ ├── clxdo
│ │ │ ├── docme
│ │ │ ├── gengraph
│ │ │ ├── mcxplotlines.R
│ │ │ ├── minimcl
│ │ │ ├── mlm-analyze
│ │ │ ├── mlm-fifofum
│ │ │ ├── mlm-quilt
│ │ │ ├── mlm-summary
│ │ │ ├── movgraph
│ │ │ ├── packed-example.sh
│ │ │ ├── packed-example2.sh
│ │ │ ├── pichi
│ │ │ ├── piclo
│ │ │ └── tree3.pl
│ │ ├── setversion
│ │ ├── src/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── README
│ │ │ ├── alien/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ └── oxygen/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── doc/
│ │ │ │ │ ├── Makefile.am
│ │ │ │ │ ├── Makefile.in
│ │ │ │ │ ├── mclblastline.1
│ │ │ │ │ ├── mclblastline.azm
│ │ │ │ │ ├── mclblastline.html
│ │ │ │ │ ├── mclblastline.ps
│ │ │ │ │ ├── mcxdeblast.1
│ │ │ │ │ ├── mcxdeblast.azm
│ │ │ │ │ ├── mcxdeblast.html
│ │ │ │ │ └── mcxdeblast.ps
│ │ │ │ └── src/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── mclblastline
│ │ │ │ └── mcxdeblast
│ │ │ ├── clew/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── cat.c
│ │ │ │ ├── cat.h
│ │ │ │ ├── claw.c
│ │ │ │ ├── claw.h
│ │ │ │ ├── clm.c
│ │ │ │ ├── clm.h
│ │ │ │ ├── scan.c
│ │ │ │ └── scan.h
│ │ │ ├── gryphon/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── path.c
│ │ │ │ └── path.h
│ │ │ ├── impala/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── app.c
│ │ │ │ ├── app.h
│ │ │ │ ├── compose.c
│ │ │ │ ├── compose.h
│ │ │ │ ├── edge.c
│ │ │ │ ├── edge.h
│ │ │ │ ├── iface.c
│ │ │ │ ├── iface.h
│ │ │ │ ├── io.c
│ │ │ │ ├── io.h
│ │ │ │ ├── ivp.c
│ │ │ │ ├── ivp.h
│ │ │ │ ├── ivptypes.h
│ │ │ │ ├── matrix.c
│ │ │ │ ├── matrix.h
│ │ │ │ ├── pval.c
│ │ │ │ ├── pval.h
│ │ │ │ ├── stream.c
│ │ │ │ ├── stream.h
│ │ │ │ ├── tab.c
│ │ │ │ ├── tab.h
│ │ │ │ ├── vector.c
│ │ │ │ ├── vector.h
│ │ │ │ ├── version.c
│ │ │ │ └── version.h
│ │ │ ├── mcl/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── alg.c
│ │ │ │ ├── alg.h
│ │ │ │ ├── dpsd.c
│ │ │ │ ├── dpsd.h
│ │ │ │ ├── expand.c
│ │ │ │ ├── expand.h
│ │ │ │ ├── inflate.c
│ │ │ │ ├── inflate.h
│ │ │ │ ├── interpret.c
│ │ │ │ ├── interpret.h
│ │ │ │ ├── proc.c
│ │ │ │ ├── proc.h
│ │ │ │ ├── procinit.c
│ │ │ │ ├── procinit.h
│ │ │ │ ├── shadow.c
│ │ │ │ ├── shadow.h
│ │ │ │ ├── transform.c
│ │ │ │ └── transform.h
│ │ │ ├── shcl/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── clm.c
│ │ │ │ ├── clm.h
│ │ │ │ ├── clmadjust.c
│ │ │ │ ├── clmadjust.h
│ │ │ │ ├── clmclose.c
│ │ │ │ ├── clmclose.h
│ │ │ │ ├── clmdag.c
│ │ │ │ ├── clmdist.c
│ │ │ │ ├── clmdist.h
│ │ │ │ ├── clmformat.c
│ │ │ │ ├── clmformat.zmm
│ │ │ │ ├── clmformat.zmm.h
│ │ │ │ ├── clmframe.c
│ │ │ │ ├── clmimac.c
│ │ │ │ ├── clmimac.h
│ │ │ │ ├── clminfo.c
│ │ │ │ ├── clminfo.h
│ │ │ │ ├── clminfo2.c
│ │ │ │ ├── clminfo2.h
│ │ │ │ ├── clmmate.c
│ │ │ │ ├── clmmate.h
│ │ │ │ ├── clmmeet.c
│ │ │ │ ├── clmmeet.h
│ │ │ │ ├── clmoptics.c
│ │ │ │ ├── clmoptics.h
│ │ │ │ ├── clmorder.c
│ │ │ │ ├── clmorder.h
│ │ │ │ ├── clmps.c
│ │ │ │ ├── clmps.defs
│ │ │ │ ├── clmps.defs.h
│ │ │ │ ├── clmps.h
│ │ │ │ ├── clmresidue.c
│ │ │ │ ├── clmresidue.h
│ │ │ │ ├── mclgraga
│ │ │ │ ├── mclgrep
│ │ │ │ ├── mclpipeline
│ │ │ │ ├── report.c
│ │ │ │ └── report.h
│ │ │ ├── shmcl/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── mcl.c
│ │ │ │ └── mclcm.c
│ │ │ ├── shmcx/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── TODO
│ │ │ │ ├── glob.c
│ │ │ │ ├── glob.h
│ │ │ │ ├── mcxi.c
│ │ │ │ ├── ops.c
│ │ │ │ ├── ops.h
│ │ │ │ ├── stack.c
│ │ │ │ ├── stack.h
│ │ │ │ ├── util.c
│ │ │ │ └── util.h
│ │ │ ├── shmcxquery/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── TODO
│ │ │ │ └── mcxquery.c
│ │ │ └── shmx/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── README
│ │ │ ├── TODO
│ │ │ ├── fake
│ │ │ ├── mcx.c
│ │ │ ├── mcx.h
│ │ │ ├── mcxalter.c
│ │ │ ├── mcxalter.h
│ │ │ ├── mcxarray.c
│ │ │ ├── mcxassemble.c
│ │ │ ├── mcxclcf.c
│ │ │ ├── mcxclcf.h
│ │ │ ├── mcxcollect.c
│ │ │ ├── mcxcollect.h
│ │ │ ├── mcxconvert.c
│ │ │ ├── mcxconvert.h
│ │ │ ├── mcxdiameter.c
│ │ │ ├── mcxdiameter.h
│ │ │ ├── mcxdump.c
│ │ │ ├── mcxerdos.c
│ │ │ ├── mcxerdos.h
│ │ │ ├── mcxfp.c
│ │ │ ├── mcxfp.h
│ │ │ ├── mcxload.c
│ │ │ ├── mcxmap.c
│ │ │ ├── mcxmetric.c
│ │ │ ├── mcxminusmeet.c
│ │ │ ├── mcxmm.c
│ │ │ ├── mcxquery.c
│ │ │ ├── mcxquery.h
│ │ │ ├── mcxrand.c
│ │ │ ├── mcxsubs.c
│ │ │ ├── mcxtab.c
│ │ │ ├── mcxtab.h
│ │ │ ├── mcxtest.c
│ │ │ └── mcxtest2.c
│ │ ├── testing/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── blast/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── blastfile
│ │ │ │ └── blastfile9
│ │ │ ├── setops/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ └── set-test.sh
│ │ │ └── stream/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── abc-pairs.pl
│ │ │ ├── abc-test.sh
│ │ │ ├── abc.pl
│ │ │ └── az.tab
│ │ └── util/
│ │ ├── Makefile.am
│ │ ├── Makefile.in
│ │ ├── alloc.c
│ │ ├── alloc.h
│ │ ├── array.c
│ │ ├── array.h
│ │ ├── compile.h
│ │ ├── ding.c
│ │ ├── ding.h
│ │ ├── equate.c
│ │ ├── equate.h
│ │ ├── err.c
│ │ ├── err.h
│ │ ├── getpagesize.h
│ │ ├── gralloc.c
│ │ ├── gralloc.h
│ │ ├── hash.c
│ │ ├── hash.h
│ │ ├── heap.c
│ │ ├── heap.h
│ │ ├── inttypes.h
│ │ ├── io.c
│ │ ├── io.h
│ │ ├── let.c
│ │ ├── let.h
│ │ ├── list.c
│ │ ├── list.h
│ │ ├── minmax.h
│ │ ├── opt.c
│ │ ├── opt.h
│ │ ├── rand.c
│ │ ├── rand.h
│ │ ├── ting.c
│ │ ├── ting.h
│ │ ├── tok.c
│ │ ├── tok.h
│ │ ├── tr.c
│ │ ├── tr.h
│ │ ├── types.c
│ │ └── types.h
│ ├── 2008-Louvain-MultiLevel-Aggregation-Opt-Modularity/
│ │ ├── Makefile
│ │ ├── ReadMe.md
│ │ ├── community.cpp
│ │ ├── community.h
│ │ ├── graph.cpp
│ │ ├── graph.h
│ │ ├── graph_binary.cpp
│ │ ├── graph_binary.h
│ │ ├── main_community.cpp
│ │ ├── main_convert.cpp
│ │ ├── main_hierarchy.cpp
│ │ ├── main_random.cpp
│ │ └── readme.txt
│ ├── 2008-Sequential-Clique-Percolation/
│ │ ├── License.txt
│ │ ├── ReadMe.md
│ │ ├── cliqueHash.cpp
│ │ ├── cliqueHash.h
│ │ ├── communityTracker.cpp
│ │ ├── communityTracker.h
│ │ ├── dendrogram.cpp
│ │ ├── dendrogram.h
│ │ ├── k_clique.cpp
│ │ ├── k_clique.h
│ │ ├── kruskal.cpp
│ │ ├── kruskal.h
│ │ ├── lcelib/
│ │ │ ├── Containers.H
│ │ │ ├── License.txt
│ │ │ ├── Nets.H
│ │ │ ├── Neural/
│ │ │ │ └── NNet.H
│ │ │ ├── PrefetchPolicy.H
│ │ │ ├── Randgens.H
│ │ │ ├── bits/
│ │ │ │ ├── EmbBoolSelector.H
│ │ │ │ ├── FiboHeapCore.H
│ │ │ │ └── hashcore.H
│ │ │ ├── containers/
│ │ │ │ ├── ArrayBase.H
│ │ │ │ ├── ContainerPolicies.H
│ │ │ │ ├── DefaultIndexParams.H
│ │ │ │ ├── KeyPolicy.H
│ │ │ │ ├── Pair.H
│ │ │ │ ├── WeightPolicy.H
│ │ │ │ ├── indices/
│ │ │ │ │ ├── Array.H
│ │ │ │ │ ├── AutoVec.H
│ │ │ │ │ ├── HashControllers.H
│ │ │ │ │ ├── LinearHash.H
│ │ │ │ │ ├── OrderedArray.H
│ │ │ │ │ ├── TableWithStatus.H
│ │ │ │ │ └── Vector.H
│ │ │ │ └── tables/
│ │ │ │ ├── ExplSumTreeTable.H
│ │ │ │ ├── ImplSumTreeTable.H
│ │ │ │ ├── ImplTreeHelper.H
│ │ │ │ ├── StubBase.H
│ │ │ │ ├── ValueTable.H
│ │ │ │ └── WeightSumTable.H
│ │ │ ├── hashes.H
│ │ │ ├── k_clique/
│ │ │ │ ├── cliqueHash.H
│ │ │ │ ├── multiIter.H
│ │ │ │ ├── numSet.H
│ │ │ │ ├── numSet2.H
│ │ │ │ └── weighedClique.H
│ │ │ ├── misc/
│ │ │ │ ├── Bindata.H
│ │ │ │ ├── BinomialSampler.H
│ │ │ │ ├── CalQueue.H
│ │ │ │ ├── EventQueue.H
│ │ │ │ ├── FiboHeap.H
│ │ │ │ ├── KruskalTree.H
│ │ │ │ └── KruskalTree2.H
│ │ │ ├── nets/
│ │ │ │ ├── Dijkstrator.H
│ │ │ │ ├── DirNetExtras.H
│ │ │ │ ├── Distributions.H
│ │ │ │ ├── Models.H
│ │ │ │ ├── NetExtras.H
│ │ │ │ ├── NetExtras2.H
│ │ │ │ ├── OldModels.H
│ │ │ │ ├── Randomizer.H
│ │ │ │ ├── UnweightedDijk.H
│ │ │ │ └── models/
│ │ │ │ ├── BA.H
│ │ │ │ ├── BBV.H
│ │ │ │ ├── Boguna.H
│ │ │ │ ├── CommunityNet.H
│ │ │ │ ├── Davidsen.H
│ │ │ │ ├── ErdosRenyi.H
│ │ │ │ ├── HolmeKim.H
│ │ │ │ ├── Marsili.H
│ │ │ │ ├── SeedNet.H
│ │ │ │ ├── SimpleNets.H
│ │ │ │ ├── VDEB.H
│ │ │ │ └── Wong.H
│ │ │ └── packedqueue.H
│ │ ├── makefile
│ │ ├── nodeCommunities.cpp
│ │ ├── nodeCommunities.h
│ │ ├── testData/
│ │ │ ├── random_1000_005.edg
│ │ │ └── random_1000_005.edg_files/
│ │ │ ├── k=3/
│ │ │ │ └── communities
│ │ │ ├── k=4/
│ │ │ │ └── communities
│ │ │ └── k=5/
│ │ │ └── communities
│ │ ├── testScp.py
│ │ ├── weighedClique.cpp
│ │ └── weighedClique.h
│ ├── 2009-Community-Infomap-MapEquation/
│ │ ├── .gitignore
│ │ ├── .hgignore
│ │ ├── CHANGES.txt
│ │ ├── LICENSE_AGPLv3.txt
│ │ ├── Makefile
│ │ ├── README.txt
│ │ ├── ReadMe.md
│ │ ├── examples/
│ │ │ ├── R/
│ │ │ │ ├── Makefile
│ │ │ │ ├── example-igraph.R
│ │ │ │ ├── example-minimal.R
│ │ │ │ └── load-infomap.R
│ │ │ ├── cpp/
│ │ │ │ ├── Infomap-igraph-interface-library/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ └── src/
│ │ │ │ │ ├── Infomap-igraph-interface.cpp
│ │ │ │ │ └── Infomap-igraph-interface.h
│ │ │ │ ├── igraph/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ └── example-igraph.cpp
│ │ │ │ └── minimal/
│ │ │ │ ├── Makefile
│ │ │ │ ├── example.cpp
│ │ │ │ ├── mem-example.cpp
│ │ │ │ └── multi-example.cpp
│ │ │ ├── js/
│ │ │ │ ├── Infomap-worker.html
│ │ │ │ └── Makefile
│ │ │ └── python/
│ │ │ ├── Infomap.py
│ │ │ ├── Makefile
│ │ │ ├── example-file-io.py
│ │ │ └── example-networkx.py
│ │ ├── interfaces/
│ │ │ ├── js/
│ │ │ │ └── pre-worker-module.js
│ │ │ ├── python/
│ │ │ │ └── setup.py
│ │ │ └── swig/
│ │ │ ├── Config.i
│ │ │ ├── Date.i
│ │ │ ├── HierarchicalNetwork.i
│ │ │ ├── Infomap.i
│ │ │ └── Network.i
│ │ ├── ninetriangles.net
│ │ └── src/
│ │ ├── Infomap.cpp
│ │ ├── Infomap.h
│ │ ├── Informatter.cpp
│ │ ├── infomap/
│ │ │ ├── Edge.h
│ │ │ ├── FlowNetwork.cpp
│ │ │ ├── FlowNetwork.h
│ │ │ ├── InfomapBase.cpp
│ │ │ ├── InfomapBase.h
│ │ │ ├── InfomapContext.cpp
│ │ │ ├── InfomapContext.h
│ │ │ ├── InfomapGreedy.h
│ │ │ ├── InfomapGreedyCommon.h
│ │ │ ├── InfomapGreedySpecialized.h
│ │ │ ├── InfomapGreedyTypeSpecialized.h
│ │ │ ├── MemFlowNetwork.cpp
│ │ │ ├── MemFlowNetwork.h
│ │ │ ├── MemNetwork.cpp
│ │ │ ├── MemNetwork.h
│ │ │ ├── MemoryNetworkAdapter.cpp
│ │ │ ├── MemoryNetworkAdapter.h
│ │ │ ├── MultiplexNetwork.cpp
│ │ │ ├── MultiplexNetwork.h
│ │ │ ├── Network.cpp
│ │ │ ├── Network.h
│ │ │ ├── NetworkAdapter.cpp
│ │ │ ├── NetworkAdapter.h
│ │ │ ├── Node.cpp
│ │ │ ├── Node.h
│ │ │ ├── NodeFactory.h
│ │ │ ├── TreeData.cpp
│ │ │ ├── TreeData.h
│ │ │ ├── flowData.h
│ │ │ ├── flowData_traits.h
│ │ │ └── treeIterators.h
│ │ ├── io/
│ │ │ ├── BipartiteClusterReader.cpp
│ │ │ ├── BipartiteClusterReader.h
│ │ │ ├── ClusterReader.cpp
│ │ │ ├── ClusterReader.h
│ │ │ ├── Config.h
│ │ │ ├── HierarchicalNetwork.cpp
│ │ │ ├── HierarchicalNetwork.h
│ │ │ ├── ProgramInterface.cpp
│ │ │ ├── ProgramInterface.h
│ │ │ ├── SafeFile.h
│ │ │ ├── TreeDataWriter.cpp
│ │ │ ├── TreeDataWriter.h
│ │ │ ├── convert.h
│ │ │ ├── version.cpp
│ │ │ └── version.h
│ │ └── utils/
│ │ ├── Date.h
│ │ ├── FileURI.cpp
│ │ ├── FileURI.h
│ │ ├── Logger.cpp
│ │ ├── Logger.h
│ │ ├── MersenneTwister.h
│ │ ├── Stopwatch.h
│ │ ├── gap_iterator.h
│ │ ├── infomath.h
│ │ └── types.h
│ ├── 2014-Grappolo/
│ │ ├── Makefile
│ │ ├── README.txt
│ │ ├── RngStream.cpp
│ │ ├── RngStream.h
│ │ ├── binary/
│ │ │ └── convertFileToBinary
│ │ ├── buildNextPhase.cpp
│ │ ├── coloringDistanceOne.cpp
│ │ ├── convertFileToBinary.cpp
│ │ ├── convertFileToEdgeList.cpp
│ │ ├── convertSnapFileToBinary.cpp
│ │ ├── defs.h
│ │ ├── driverForColoringExperiments.cpp
│ │ ├── driverForGraphClustering.cpp
│ │ ├── driverForGraphClusteringBigMem.cpp
│ │ ├── driverForPartitioningWithMetis.cpp
│ │ ├── driverProcessPowerGridNetworks.cpp
│ │ ├── generateRGG.cpp
│ │ ├── generateRMAT.cpp
│ │ ├── input/
│ │ │ ├── karate.graph
│ │ │ └── west1505.gr
│ │ ├── louvainMultiPhaseRun.cpp
│ │ ├── parallelLouvainMethod.cpp
│ │ ├── parallelLouvainMethodEager.cpp
│ │ ├── parallelLouvainWithColoring.cpp
│ │ ├── parseInputFiles.cpp
│ │ ├── parseInputParameters.cpp
│ │ ├── scripts/
│ │ │ └── RunWithValgrind.sh
│ │ ├── utilityClusteringFunctions.cpp
│ │ ├── utilityClusteringFunctions.h
│ │ ├── utilityFunctions.cpp
│ │ ├── utilityGraphPartitioner.cpp
│ │ ├── utilityGraphPartitioner.h
│ │ ├── utilityParseInputParameters.hpp
│ │ ├── utilityStringTokenizer.hpp
│ │ ├── vertexFollowing.cpp
│ │ └── writeGraphDimacsFormat.cpp
│ └── ReadMe.md
├── Prensentation/
│ ├── ReadMe.md
│ ├── __init__.py
│ ├── algorithms/
│ │ ├── clique_percolation/
│ │ │ ├── community_result_visualization.py
│ │ │ ├── conradlee_clique_percolation.py
│ │ │ ├── example_edge_list.txt
│ │ │ └── problem_vis.py
│ │ ├── dynamics/
│ │ │ ├── async_lp_res0.txt
│ │ │ ├── example_edge_list.txt
│ │ │ ├── label_propagation.py
│ │ │ ├── label_propagation_yche.py
│ │ │ ├── others/
│ │ │ │ ├── aync_vs_sync.py
│ │ │ │ ├── copra_lpa.py
│ │ │ │ └── lpa.py
│ │ │ ├── prev/
│ │ │ │ ├── disjoint_community.txt
│ │ │ │ └── disjoint_visualization.py
│ │ │ ├── problem_vis.py
│ │ │ └── sync_lp_res0.txt
│ │ ├── link_partition/
│ │ │ ├── example_edge_list.txt
│ │ │ ├── graph_io_helper.py
│ │ │ ├── input/
│ │ │ │ └── get_karate_edge_list.py
│ │ │ ├── link_clustering.py
│ │ │ ├── link_clustering_algo.py
│ │ │ ├── result/
│ │ │ │ ├── example_edge_list_dendro.cid2edge.txt
│ │ │ │ ├── example_edge_list_dendro.linkage.txt
│ │ │ │ ├── example_edge_list_maxS0.250000_maxD0.777778.comm2edges.txt
│ │ │ │ ├── example_edge_list_maxS0.250000_maxD0.777778.comm2nodes.txt
│ │ │ │ ├── example_edge_list_maxS0.250000_maxD0.777778.edge2comm.txt
│ │ │ │ ├── example_edge_list_thr_D.txt
│ │ │ │ ├── karate_edge_list_maxS0.333333_maxD0.284758.comm2edges.txt
│ │ │ │ ├── karate_edge_list_maxS0.333333_maxD0.284758.comm2nodes.txt
│ │ │ │ ├── karate_edge_list_maxS0.333333_maxD0.284758.edge2comm.txt
│ │ │ │ └── karate_edge_list_thr_D.txt
│ │ │ └── visualization/
│ │ │ ├── dendrogram/
│ │ │ │ ├── dendrogram_vis.py
│ │ │ │ ├── radial_demo.py
│ │ │ │ ├── radial_grouper.py
│ │ │ │ ├── radial_support.py
│ │ │ │ └── radial_visualizer.py
│ │ │ └── link_clustering_visualization.py
│ │ ├── local_expansion/
│ │ │ ├── cis_algo.py
│ │ │ ├── cis_algo_output.txt
│ │ │ ├── cis_algo_res.txt
│ │ │ ├── cis_algo_visualization.py
│ │ │ ├── example_edge_list.txt
│ │ │ ├── karate_edge_list.txt
│ │ │ ├── problem_vis.py
│ │ │ ├── result_for_vis.txt
│ │ │ └── src/
│ │ │ ├── CMakeLists.txt
│ │ │ ├── cis_algo_output.txt
│ │ │ ├── cis_sequential_algorithm.cpp
│ │ │ ├── cis_sequential_algorithm.h
│ │ │ ├── demo_cis.cpp
│ │ │ └── util/
│ │ │ ├── ReadMe.md
│ │ │ ├── basic_io_helper.h
│ │ │ ├── graph_io_helper.cpp
│ │ │ ├── graph_io_helper.h
│ │ │ └── pretty_print.h
│ │ └── statistical_inference/
│ │ └── block_model_demo.py
│ ├── graph_serialization/
│ │ ├── __init__.py
│ │ ├── graph_formats.py
│ │ ├── input/
│ │ │ ├── __init__.py
│ │ │ └── example_graph.edgelist
│ │ ├── output_json/
│ │ │ ├── adjacency.json
│ │ │ └── node_link.json
│ │ ├── output_other/
│ │ │ ├── example_graph.gml
│ │ │ └── example_graph.pajek
│ │ ├── output_raw/
│ │ │ ├── __init__.py
│ │ │ ├── example_graph.adjlist
│ │ │ ├── example_graph.edgelist
│ │ │ └── example_graph.multiline_adjlist
│ │ ├── output_serialization/
│ │ │ ├── __init__.py
│ │ │ ├── example_graph.graph6
│ │ │ ├── example_graph.pickle
│ │ │ └── example_graph.yaml
│ │ └── output_xml/
│ │ ├── __init__.py
│ │ ├── example_graph.gexf
│ │ └── example_graph.graphml
│ ├── graph_tool_usage/
│ │ ├── intro_graph_tool/
│ │ │ ├── .gitignore
│ │ │ ├── begining.py
│ │ │ ├── draw_pie_graph.py
│ │ │ ├── graph_creation_basics.py
│ │ │ ├── graph_notations.md
│ │ │ └── nx2gt.py
│ │ └── play.py
│ ├── jupter_playground/
│ │ ├── .gitignore
│ │ ├── .ipynb_checkpoints/
│ │ │ ├── graph_draw_study0-checkpoint.ipynb
│ │ │ └── pie_graph-checkpoint.ipynb
│ │ ├── graph_draw_study0.ipynb
│ │ └── pie_graph.ipynb
│ ├── metrics/
│ │ ├── ReadMe.md
│ │ ├── __init__.py
│ │ ├── demo_graph.csv
│ │ ├── link_belong_modularity.py
│ │ ├── omega_idx.py
│ │ ├── overlap_nmi.py
│ │ ├── rand_idx_example.py
│ │ └── util.py
│ ├── problem_definition/
│ │ ├── demo_cis_output_result.txt
│ │ ├── demo_input_graph.txt
│ │ └── problem_vis.py
│ ├── social_network/
│ │ ├── disjoint_community_detection.py
│ │ ├── others/
│ │ │ └── visualization_different_colors.py
│ │ ├── visualization_karate.py
│ │ └── zachary_karate_club/
│ │ ├── __init__.py
│ │ ├── gml_formatter.py
│ │ ├── gml_parser.py
│ │ ├── karate.gml
│ │ ├── karate.txt
│ │ └── karate_new.gml
│ └── test.gml
├── README.md
├── Scripts/
│ └── dataset_aggragation.py
├── SubModules/
│ └── ReadMe.md
└── Survey/
├── Community-Detection-New-Findings.md
├── Community-Detection-Reading-List.md
├── Community-Detection-Survey.md
├── Community-Search-Survey.md
├── Conference-Papers-About-Graph/
│ └── VLDB.md
├── Overlapping-Community-Detection-Codes.md
├── ReadMe.md
└── Social-Media-Recommendation.md
================================================
FILE CONTENTS
================================================
================================================
FILE: .gitignore
================================================
# jetbrains config
.idea
cmake-build-debug
*.iml
*.log
*.aux
*.gz
#maven build
target
# src_cpp_matlab-python files
*.pyc
# output data
output*.txt
# matlab
*.mex*
# datasets
facebook100.zip
================================================
FILE: .gitmodules
================================================
[submodule "SubModules/igraph"]
path = SubModules/igraph
url = git@github.com:igraph/igraph.git
[submodule "SubModules/Graclus"]
path = SubModules/Graclus
url = git@github.com:GraphProcessor/Graclus.git
[submodule "SubModules/lcelib"]
path = SubModules/lcelib
url = git@github.com:CxAalto/lcelib.git
[submodule "SubModules/matlab-bgl"]
path = SubModules/matlab-bgl
url = git@github.com:dgleich/matlab-bgl.git
================================================
FILE: Algorithms/2008-CliquePercolation/ReadMe.md
================================================
# Clique Percolation
## Description
The sequential clique percolation algorithm is method for detecting clique percolation communities.
It is an alternative to CFinder: instead of finding maximal cliques in a graph and producing
communities of all the possible clique sizes,
the SCP algorithm finds all the cliques of single size and
produces the community structure for all the possible thresholds.
The SCP algorithm should work well even for large sparse networks,
but might have trouble for dense networks and cliques of large size.
## Links
- [python implementation elaboration](http://www.lce.hut.fi/~mtkivela/kclique.html)
- [c++ implementation elaboration](http://www.lce.hut.fi/research/mm/complex/software/scp_0.1.tar.gz)
- [authors' paper, A sequential algorithm for fast clique percolation](https://arxiv.org/abs/0805.1449)
================================================
FILE: Algorithms/2008-CliquePercolation/algorithm_example.py
================================================
import networkx as nx
from conradlee_clique_percolation import *
if __name__ == '__main__':
with open('example_edge_list.txt', 'r') as ifs:
edge_list = map(lambda ele: ele.strip().split(), ifs.readlines())
data_graph = nx.Graph(edge_list)
comm_list = list(get_percolated_cliques(data_graph, 3))
print comm_list
================================================
FILE: Algorithms/2008-CliquePercolation/conradlee_clique_percolation.py
================================================
import networkx as nx
from collections import defaultdict
def get_percolated_cliques(G, k):
percolation_graph = nx.Graph()
cliques = [frozenset(c) for c in nx.find_cliques(G) if len(c) >= k]
percolation_graph.add_nodes_from(cliques)
# First index which nodes are in which cliques
membership_dict = defaultdict(list)
for clique in cliques:
for node in clique:
membership_dict[node].append(clique)
def get_adjacent_cliques(clique, membership_dict):
adjacent_cliques = set()
for n in clique:
for adj_clique in membership_dict[n]:
if clique != adj_clique:
adjacent_cliques.add(adj_clique)
return adjacent_cliques
# For each clique, see which adjacent cliques percolate
for clique in cliques:
for adj_clique in get_adjacent_cliques(clique, membership_dict):
if len(clique.intersection(adj_clique)) >= (k - 1):
percolation_graph.add_edge(clique, adj_clique)
print 'percolation graph nodes:', percolation_graph.nodes()
print 'percolation graph edges:', percolation_graph.edges()
# Connected components of clique graph with perc edges
# are the percolated cliques
for component in nx.connected_components(percolation_graph):
yield (frozenset.union(*component))
================================================
FILE: Algorithms/2008-CliquePercolation/example_edge_list.txt
================================================
1 2
1 3
2 3
3 4
4 5
4 7
5 7
5 6
6 7
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/CMakeLists.txt
================================================
cmake_minimum_required(VERSION 2.8)
project(2008-clique-percolation)
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++14 -O3 -g")
find_package(Boost REQUIRED COMPONENTS)
include_directories(${Boost_INCLUDE_DIRS})
include_directories("../../../SubModules/")
FIND_PACKAGE(OpenMP REQUIRED)
if (OPENMP_FOUND)
message("OPENMP FOUND")
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${OpenMP_C_FLAGS}")
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${OpenMP_CXX_FLAGS}")
set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} ${OpenMP_EXE_LINKER_FLAGS}")
endif ()
set(SourceFiles k_clique.cpp dendrogram.cpp nodeCommunities.cpp weighedClique.cpp cliqueHash.cpp communityTracker.cpp kruskal.cpp)
add_executable(k_clique ${SourceFiles})
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/ReadMe.md
================================================
## Issues
all fixed
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/cliqueHash.cpp
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "cliqueHash.h"
size_t cliqueHash::hash_function(const clique key)
{
const size_t keySize = key.size();
// std::cerr << "clique size for hash_function is " << key.size() << "\n";
size_t hash_key;
size_t newInd[keySize];
for (size_t i = 0; i < keySize; i++)
newInd[i] = key.at(keySize-1-i) & b;
// for (size_t i = 1; i < keySize; i++) new_ind[i] = A*key.at(i);
hash_key = newInd[0] << hash_bits - offSet; // move to the left
size_t move;
for (size_t i = 1; i < keySize; i++)
{
move = hash_bits - (i+1)*offSet;
newInd[i] = newInd[i] << move;
hash_key = hash_key | newInd[i] ; // take
}
hash_key = hash_key | ( key.at(keySize-2) & c );
// now take only the last hash_bits bits
// hash_key = hash_key & a;
// std::cerr << "hash key is: " << hash_key << "\n";
/*
hash_key = key.at(0)+1;
for (size_t i = 1; i < key.size(); i++) hash_key *= key.at(i);
hash_key = hash_key%size;
// hash_key = (key.at(0)+1)*key.at(1)*key.at(2)*key.at(3)%size;
// hash_key = ( key.at(0) * key.at(3) + key.at(1) * key.at(2) )%size;
*/
if (hash_key >= size || hash_key < 0 )
{
std::cerr << "hash function did not work!\n";
// std::cerr << "nodes were: " << key.at(0) << " " << key.at(1) << " " << key.at(2) << " " << key.at(3) << "\n";
std::cerr << "hash key was: " << hash_key << "\n";
std::cerr << "hash key size was: " << keySize << "\n";
}
return hash_key;
}
cliqueHash::cliqueHash(const size_t hashSize, const size_t t, const size_t keySize)
{
hashTable.resize(hashSize); // reserve memory
keyCount = 0;
size = hashSize;
hash_bits = t;
offSet = hash_bits/keySize; // this is how much we can move bits for each index
a = 1;
a = a << hash_bits;
a = a - 1; // beginning is zeros, only hash_bits lasts bits are one
b = 1;
b = b << offSet;
b = b-1;
c = 1;
c = c << ( hash_bits - keySize*offSet );
c = c - 1;
}
cliqueHash::cliqueHash()
{
cliqueHash(0, 1, 1);
}
bool cliqueHash::contains(const clique & key)
{
// std::cerr << "entering contains-function\n";
size_t hash_key = hash_function(key);
// std::cerr << "hash-key is:" << hash_key << "\n";
bool key_found = false;
for (cliqueIndexSet::iterator i = hashTable.at(hash_key).begin(); !key_found && i != hashTable.at(hash_key).end(); i++)
{
if ( (*i).first == key ) key_found = true;
}
// std::cerr << "leaving contains-function\n";
return key_found;
}
int cliqueHash::getValue(const clique & key)
{
size_t hash_key = hash_function(key);
int value = -1;
bool key_found = false;
for (cliqueIndexSet::iterator i = hashTable.at(hash_key).begin(); !key_found && i != hashTable.at(hash_key).end(); i++)
{
if ( (*i).first == key )
{
value = (*i).second;
key_found = true;
}
}
return value;
}
void cliqueHash::put(const clique & key, const size_t value)
{
size_t hash_key = hash_function(key);
if ( contains(key) )
{
bool key_found = false;
for (cliqueIndexSet::iterator i = hashTable.at(hash_key).begin(); !key_found && i != hashTable.at(hash_key).end(); i++)
{
if ( (*i).first == key )
{
(*i).second = value;
key_found = true;
}
}
}
else
{
std::pair<clique,size_t> cliqueValPair(key,value);
hashTable.at(hash_key).push_back( cliqueValPair );
keyCount++;
}
}
std::pair<clique,size_t> cliqueHash::begin()
{
curr_hash_key = 0;
while ( curr_hash_key < size && hashTable.at(curr_hash_key).size() == 0 )
{
curr_hash_key++;
}
if ( curr_hash_key < size ) // now we have found the first slot that is not empty
{
iter = hashTable.at(curr_hash_key).begin();
return *iter;
}
else
{
clique tmpClique;
currPair = std::make_pair( tmpClique, 0);
return currPair;
}
}
std::pair<clique,size_t> cliqueHash::next()
{
iter++;
if ( iter == hashTable.at(curr_hash_key).end() ) // move to the next non-empty slot
{
do
{
curr_hash_key++;
}
while ( curr_hash_key < size && hashTable.at(curr_hash_key).size() == 0 );
if ( curr_hash_key < size ) // now we have found the first slot that is not empty
{
iter = hashTable.at(curr_hash_key).begin();
return *iter;
}
else
{
clique tmpClique;
currPair = std::make_pair(tmpClique, 0);
return currPair;
}
}
else
{
return *iter;
}
}
bool cliqueHash::finished()
{
if ( curr_hash_key == size ) return true;
else if ( getKeyCount() == 0 ) return true;
else return false;
}
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/cliqueHash.h
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef CLIQUE_HASH
#define CLIQUE_HASH
#include <list>
#include "weighedClique.h"
class cliqueHash
{
// typedef std::list<std::pair<clique,size_t> > cliqueIndexSet;
typedef std::list<std::pair<clique,size_t> > cliqueIndexSet;
private:
size_t size;
std::vector<cliqueIndexSet> hashTable;
size_t hash_bits;
size_t a, b, c, offSet;
size_t hash_function(const clique key);
cliqueIndexSet::iterator iter;
std::pair<clique,size_t> currPair;
size_t curr_hash_key;
size_t keyCount;
public:
cliqueHash(const size_t hashSize, const size_t t, const size_t keySize);
cliqueHash();
bool contains(const clique & key);
int getValue(const clique & key);
void put(const clique & key, const size_t value);
std::pair<clique,size_t> begin();
std::pair<clique,size_t> next();
bool finished();
size_t getKeyCount()
{
return keyCount;
}
};
#endif
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/communityTracker.cpp
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "communityTracker.h"
CommunityTracker::CommunityTracker(cliqueHash & hash, KruskalTree & tree, nodeCommunities & nodeComs, Dendrogram & dendrogram, NetType & net) : hash(hash), tree(tree), nodeComs(nodeComs), dendrogram(dendrogram), net(net) {}
void CommunityTracker::addClique(weighedClique & kclique)
{
// the index of the first (k-1)-clique found, others (k-1)-cliques will be connected to that one
// may change during merging of (k-1)-communities, but always tells the community where to add other (k-1)-cliques
int firstCliqueIndex;
// true if this k-clique forms a new community, false otherwise, e.g. when community size changes
bool formsNewCommunity = true;
// the starting size of the community, used to track if the size of the community changes
size_t initialSize;
// tells if the initialSize has been initialized
// this prevents us from changing the initialSize after initialization
bool sizeInitialized = false;
for (size_t i = 0; i < kclique.size(); i++)
{
// clear the tempVector and push all nodes to it except the i-th node
tempVector.clear();
for (size_t j = 0; j < kclique.size(); j++)
if (i != j)
tempVector.push_back(kclique.at(j));
// replace the nodes in the k1clique to thos of the tempVector
k1clique.replaceNodes(tempVector, net);
// find the k1clique from the cliqueHash and store it's index
// this is smaller than 0 if the clique is not in the hash, otherwise this is the cliques index
int currentCliqueIndex = hash.getValue(k1clique);
if (!i) // first (k-1)-clique from this k-clique
{
if (currentCliqueIndex >= 0) // found before
{
// we store the index of the first (k-1)-clique so others can be connected to it
firstCliqueIndex = tree.findRoot(currentCliqueIndex);
// belongs to an existing community, so no new community can form
formsNewCommunity = false;
// get the initial size of the excisting community from nodeComs
initialSize = nodeComs.getSize(firstCliqueIndex);
// mark that the initialSize has been initialized
sizeInitialized = true;
}
else // not found before
{
// add this (k-1)-clique to the kruskal tree and store its index
firstCliqueIndex = tree.add();
// use the index to put the clique into cliqueHash and nodeComs
hash.put(k1clique, firstCliqueIndex);
nodeComs.addClique(firstCliqueIndex, k1clique);
}
}
else // not the first (k-1)-clique from this k-clique
{
if (currentCliqueIndex >= 0) // found before
{
// check if the (k-1)-cliques are already in the same community
// if they're not, merge the communities
if (!tree.inSameSet(currentCliqueIndex, firstCliqueIndex))
{
// if the size is not initialized, initialize it
if (!sizeInitialized)
{
// we use currentCliqueIndex here because if the sizeInitialized is not true, the firstCliqueIndex
// does not point to any existing community and so the community pointed by currentCliqueIndex
// becomes the initial community
initialSize = nodeComs.getSize(tree.findRoot(currentCliqueIndex));
sizeInitialized = true;
}
// connect the communities in nodeComs
nodeComs.connect(tree.findRoot(firstCliqueIndex), tree.findRoot(currentCliqueIndex));
// if a new community does not form, add the indexes to comsToMerge
if (!formsNewCommunity)
{
comsToMerge.insert(tree.findRoot(currentCliqueIndex));
comsToMerge.insert(tree.findRoot(firstCliqueIndex));
}
// connect the communities in the kruskal tree
tree.connect(firstCliqueIndex, currentCliqueIndex);
// update the firstCliqueIndex so that it points to the root of the kruskal tree
firstCliqueIndex = tree.findRoot(currentCliqueIndex);
// this k-clique belongs to an existing community, so no new community can form
formsNewCommunity = false;
}
}
else // not found before
{
// add the new (k-1)-clique to the kruskal tree and store the index
size_t newCliqueIndex = tree.add();
// store it to the cliqueHash
hash.put(k1clique, newCliqueIndex);
// connect it to the first (k-1)-clique in the kruskal tree and in nodeComs
tree.connect(newCliqueIndex, firstCliqueIndex);
nodeComs.addClique(tree.findRoot(firstCliqueIndex), k1clique);
}
}
}
// new community has formed, so we add a new bottom to the dendrogram
if (formsNewCommunity)
dendrogram.addNewBottom(kclique.getWeight(), kclique.size(), tree.findRoot(firstCliqueIndex));
// there are communities merging, so merge these to make a new dendrogram node
if (comsToMerge.size())
dendrogram.addConnection(kclique.getWeight(), nodeComs.getSize(tree.findRoot(firstCliqueIndex)), comsToMerge, tree.findRoot(firstCliqueIndex));
// if no communities are merging, but the initialSize has been initialized and has changed after initialization
// then add a new size change into the dendrogram
else if (!comsToMerge.size() && nodeComs.getSize(tree.findRoot(firstCliqueIndex)) != initialSize && sizeInitialized)
dendrogram.changeSize(kclique.getWeight(), nodeComs.getSize(tree.findRoot(firstCliqueIndex)), tree.findRoot(firstCliqueIndex));
comsToMerge.clear();
}
void CommunityTracker::print(std::ostream & file) const
{
file << "tree:" << std::endl;
tree.printTree(file);
file << std::endl;
file << "nodeComs:" << std::endl;
nodeComs.printCommunities(file);
file << "-------------------" << std::endl;
}
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/communityTracker.h
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef COMMUNITYTRACKER_H
#define COMMUNITYTRACKER_H
#include <iostream>
#include <vector>
#include <utility>
#include "lcelib/Nets.H"
#include "cliqueHash.h"
#include "nodeCommunities.h"
#include "kruskal.h"
#include "dendrogram.h"
class CommunityTracker
{
public:
CommunityTracker(cliqueHash & hash, KruskalTree & tree, nodeCommunities & nodeComs, Dendrogram & dendrogram, NetType & net);
void addClique(weighedClique & kclique);
void print(std::ostream & file) const;
private:
cliqueHash & hash;
KruskalTree & tree;
nodeCommunities & nodeComs;
Dendrogram & dendrogram;
NetType & net;
std::vector<size_t> tempVector; // used when creating (k-1)-cliques, this way we avoid creating a new vector object for every k-clique
weighedClique k1clique;
//std::vector<std::pair<size_t, size_t> > mergingCommunities; // tells which communities merge as a result from adding a clique
std::set<size_t> comsToMerge;
};
#endif
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/dendrogram.cpp
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "dendrogram.h"
void Dendrogram::addNewBottom(const float weight, const size_t size, const size_t comIndex)
{
DendrogramNode *newNode = new DendrogramNode(weight, size, comIndex);
comIndexMap[comIndex] = newNode;
bottom.push_back(newNode);
nodes.push_back(newNode);
}
void Dendrogram::changeSize(const float weight, const size_t size, const size_t comIndex)
{
DendrogramNode *newNode = new DendrogramNode(weight, size, comIndex);
nodes.push_back(newNode);
newNode->addChild(comIndexMap[comIndex]); // TESTI
comIndexMap[comIndex]->parent = newNode;
comIndexMap[comIndex] = newNode;
}
void Dendrogram::addConnection(const float weight, const size_t size, const std::set<size_t> & comsToMerge, const size_t newComIndex)
{
DendrogramNode *newNode = new DendrogramNode(weight, size, newComIndex);
nodes.push_back(newNode);
for (std::set<size_t>::iterator i = comsToMerge.begin(); i != comsToMerge.end(); i++)
{
comIndexMap[*i]->parent = newNode;
newNode->addChild(comIndexMap[*i]); // TESTI
}
}
void Dendrogram::printFromNode(const size_t comIndex, std::ostream & file)
{
DendrogramNode *node = comIndexMap[comIndex];
while (node)
{
file << node->weight << " " << node->size << " " << node->comIndex << std::endl;
node = node->parent;
}
}
void Dendrogram::printTree(std::ostream & file)
{
std::sort(nodes.begin(), nodes.end(), compareNodes);
for (std::vector<DendrogramNode*>::iterator i = nodes.begin(); i != nodes.end(); i++)
{
file << (*i)->weight << "\t" << (*i)->comIndex << "\t" << (*i)->size;
for (std::set<DendrogramNode*>::iterator j = (*i)->children.begin(); j != (*i)->children.end(); j++) // TESTI
file << "\t|\t" << (*j)->comIndex << "\t" << (*j)->size; // TESTI
file << std::endl;
}
}
Dendrogram::~Dendrogram()
{
for (std::vector<DendrogramNode*>::iterator i = nodes.begin(); i != nodes.end(); i++)
delete *i;
}
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/dendrogram.h
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef DENDRO_TREE_H
#define DENDRO_TREE_H
#include <cstddef>
#include <vector>
#include <map>
#include <iostream>
#include <set>
#include <algorithm>
class Dendrogram
{
public:
Dendrogram() {}
void addNewBottom(const float weight, const size_t size, const size_t comIndex);
void changeSize(const float weight, const size_t size, const size_t comIndex);
void addConnection(const float weight, const size_t size, const std::set<size_t> & comsToMerge, const size_t newComIndex);
void printFromNode(const size_t comIndex, std::ostream & file);
void printTree(std::ostream & file);
~Dendrogram();
private:
class DendrogramNode
{
friend class Dendrogram;
public:
DendrogramNode(float weight, size_t size, size_t comIndex) : weight(weight), size(size), comIndex(comIndex), parent(NULL) {}
void addChild(DendrogramNode * child) { children.insert(child); } // TESTI
private:
float weight;
size_t size;
size_t comIndex;
DendrogramNode * parent;
std::set<DendrogramNode*> children; // TESTI
};
static bool compareNodes(DendrogramNode * first, DendrogramNode * second) { return first->weight > second->weight; }
// the nodes which no other node points to
std::vector<DendrogramNode*> bottom;
// all nodes in the dendrogram, used for freeing the memory
std::vector<DendrogramNode*> nodes;
// map that holds the mapping from community indexes
std::map<size_t, DendrogramNode*> comIndexMap;
};
#endif
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/doc/License.txt
================================================
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Lesser General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License.
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/doc/makefile
================================================
all:
g++ k_clique.cpp dendrogram.cpp nodeCommunities.cpp weighedClique.cpp cliqueHash.cpp communityTracker.cpp kruskal.cpp -o k_clique -O3
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/k_clique.cpp
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/*
A C++ implementation of the sequential clique percolation (SCP) algorithm. This version is seriously cripled and only unweighted clique percolation without
thresholding is allowed. However, all the code to include further functionality is already included in the source code.
If you use this code to produce results for a publication, please cite:
A sequential algorithm for fast clique percolation, J.M. Kumpula, M. Kivelä, K. Kaski,and J. Saramäki, Phys. Rev. E 79, 026109 (2008)
The article contains detailed introduction to the SCP.
Authors: Eetu Latja, Mikko Kivelä and Jussi Kumpula.
*/
#include "k_clique.h"
#include "dendrogram.h"
#define HELPSTR "Usage: ./k_clique [inputfile] [options]\n\
The input file must be in the edge list format, where at each \
line there three columns: node1Index, node2Index and edge weight separated \
by a white space. Node indices must be integers from 0 to n-1, where n is the \
number of nodes in the network. Edges are undirected and there can only be \
at most one edge between two nodes in the edge file.\n\
Options:\n\
\t-o=[outputfile] : Write output to a specified file.\n\
\t-k=[clique size] : The size of the clique.\n\
\t-v : Verbose mode.\n "
//\t-w : Use weighted clique percolation.\n\
//\t-f=[weightfunction] : Specifies a weight function when using weighted clique percolation.\n "
struct Link{
size_t source;
size_t dest;
float weight;
Link(size_t source=0,size_t dest=0, float weight=0.0) : source(source), dest(dest), weight(weight) {}
};
// finds out the optimal size for the hash
size_t determineHashSize(const size_t numElements, const size_t k)
{
size_t size_limit = 26;
size_t t;
if ( k < size_limit)
t = k;
else
t = size_limit;
while ( t < 10 ) t += k;
while ( 1 << t < numElements && t < size_limit )
{
t += k;
}
return t; // this many bits are needed
}
// determine the network size and number of links
// same link must not be twice in the network!
bool getNetSizeAndLinkNumbers(char * fileName, size_t & netSize, size_t & numLinks, std::list<Link> & linkList)
{
std::ifstream myfile(fileName);
std::string line;
size_t source, dest;
float weight;
netSize=0;
numLinks=0;
if (myfile.is_open())
{
while (!myfile.eof())
{
getline(myfile, line); // Read a line from input into a string.
if (!line.empty())
{
std::istringstream is(line); // Extract data using a stringstream.
if ((is >> source) && (is >> dest) && (is >> weight));
else {
std::cerr<<"Error reading line "<<numLinks << std::endl;
return false;}
linkList.push_back(Link(source,dest,weight));
if (source > netSize)
netSize = source; //the size of the net is determined by the largest node index
if (dest > netSize)
netSize = dest;
++numLinks;
}
}
myfile.close();
}
++netSize; // net size is one more than the largest index
//std::cout << "ok\n";
return true;
}
/*
reads one line from the input file. The line contains the source and target nodes and weight.
*/
bool readLine(std::ifstream & myfile, size_t & source, size_t & dest, float & weight)
{
bool readlineok = false;
if ( myfile.is_open())
{
std::string line;
getline(myfile, line); // Read a line from input into a string.
if (!line.empty())
{
std::istringstream is(line); // Extract data using a stringstream.
is >> source;
is >> dest;
is >> weight;
readlineok = true;
}
}
else
{
std::cerr << "Error opening the network file!\n";
}
return readlineok;
}
void kCliquesFind(std::vector<weighedClique> & cliqueVector, NetType & net, size_t source, size_t dest, const float weight, const size_t k, const size_t weightFunction)
{
// If k=2 cliques are links and the only new clique formed is the added link itself.
if (k==2){
std::vector<size_t> tempVector(2);
tempVector[0] = source; tempVector[1] = dest;
weighedClique tempClique(tempVector, net, weightFunction);
cliqueVector.push_back(tempClique);
net[source][dest] = weight; // add link
return;
}
// find out degrees of source and dest
size_t k_s, k_d;
k_s = net(source).size();
k_d = net(dest).size();
// If degree of 'source' is larger than degree of 'dest', swap these. This makes it faster because we only iterate through nodes which are neighbors of 'source'.
if (k_s > k_d)
{
size_t temp = source;
source = dest;
dest = temp;
}
if ( k_s > k - 3 && k_d > k - 3) // if this is not true, a new k-clique can not form
{
if (k == 3)
{
std::vector<size_t> tempVector(3);
tempVector[0] = source;
tempVector[1] = dest;
for ( NetType::const_edge_iterator i=net(source).begin(); !i.finished(); ++i)
{
if ( net(*i)[dest] > 0 )
{
tempVector[2] = *i;
weighedClique tempClique(tempVector, net, weightFunction);
cliqueVector.push_back(tempClique);
}
}
}
else if (k == 4)
{
std::vector<size_t> tempVector(4);
tempVector[0] = source;
tempVector[1] = dest;
for ( NetType::const_edge_iterator i=net(source).begin(); !i.finished(); ++i)
{
NetType::const_edge_iterator j=i;
for ( ++j; !j.finished(); ++j) // makes j to point to the next iterable after i
{
if ( net(*i)[dest] > 0 && net(*j)[dest] > 0 && net(*i)[*j] > 0)
{
tempVector[2] = *i;
tempVector[3] = *j;
weighedClique tempClique(tempVector, net, weightFunction);
cliqueVector.push_back(tempClique);
}
}
}
}
else // k>4
{
nodeSet commonNeighborhood;
for ( NetType::const_edge_iterator i=net(source).begin(); !i.finished(); ++i)
{
if ( net(*i)[dest] > 0 )
commonNeighborhood.put(*i);
}
NetType subNet(commonNeighborhood.size());
std::vector<size_t> sourceAndDest(2);
sourceAndDest[0] = source;
sourceAndDest[1] = dest;
std::vector<weighedClique> k2cliqueVector;
for (nodeSet::iterator i = commonNeighborhood.begin(); !i.finished(); ++i)
{
nodeSet::iterator j = i;
for ( ++j; !j.finished(); ++j) // makes j to point to the next iterable after i
{
if (net(*i)[*j] > 0)
{
kCliquesFind(k2cliqueVector, subNet, *i, *j, net(*i)[*j], k - 2, 0);
for (std::vector<weighedClique>::iterator vectorIter = k2cliqueVector.begin(); vectorIter != k2cliqueVector.end(); vectorIter++)
{
weighedClique current = *vectorIter;
current.addNodes(sourceAndDest, net);
cliqueVector.push_back(current);
}
}
}
}
}
}
//Finally add the new link to the network
net[source][dest] = weight;
}
void kCommunitiesFind(std::vector<weighedClique> & cliqueVector, KruskalTree & communities, cliqueHash & k1cliquesHash, NetType & net, const size_t k)
{
std::vector<size_t> tempVector;
weighedClique k1clique;
for (std::vector<weighedClique>::iterator i = cliqueVector.begin(); i != cliqueVector.end(); ++i)
{
size_t rootIndex;
for (size_t j = 0; j < k; j++)
{
tempVector.clear();
for (size_t l = 0; l < k; l++)
if (l != j)
tempVector.push_back(i->at(l));
k1clique.replaceNodes(tempVector, net);
// check if this (k-1)-clique is founded before
int index = k1cliquesHash.getValue(k1clique);
if (!j) // first (k-1)-clique from this k-clique
{
if (index >= 0) // found before
{
rootIndex = index;
}
else
{
rootIndex = communities.add();
k1cliquesHash.put(k1clique, rootIndex);
}
}
else
{
if (index >= 0) // found before
{
communities.connect(rootIndex, index);
}
else
{
size_t newIndex = communities.add();
k1cliquesHash.put(k1clique, newIndex);
communities.connect(newIndex, rootIndex);
}
}
}
}
}
void outputCommunityStructure(KruskalTree & communities, cliqueHash & k1cliquesHash, std::ofstream & file)
{
// Go through each community and put nodes from each community into a nodeSet
std::map<size_t, nodeSet> realCommunities;
for (std::pair<clique,size_t> currentPair = k1cliquesHash.begin(); !k1cliquesHash.finished(); currentPair = k1cliquesHash.next())
{
size_t community = communities.findRoot(currentPair.second);
for (size_t i = 0; i < currentPair.first.size(); i++)
{
realCommunities[community].put(currentPair.first.at(i));
}
}
if (file.is_open())
{
int communityIndex = 1;
for (std::map<size_t, nodeSet>::iterator i = realCommunities.begin(); i != realCommunities.end(); i++)
{
//file << communityIndex << ": "; // Uncomment if you want to enumerate the communities
for (nodeSet::iterator j = i->second.begin(); !j.finished(); ++j)
file << *j << " ";
file << "\n";
communityIndex++;
}
}
file << "\n";
}
void unweightedSCP(NetType & net, std::list<Link> & linkList, const size_t numberOfLinks, const size_t k, std::string outputFile,bool verbose)
{
size_t source, dest;
float weight;
std::vector<weighedClique> cliqueVector;
//Determine the number of k-1 cliques
size_t numberOfSmallCliques=0;
NetType *tempNetPointer= new NetType(net.size());
NetType &tempNet=*tempNetPointer;
for (std::list<Link>::iterator linkIterator=linkList.begin() ; linkIterator != linkList.end(); linkIterator++ )
{
source=(*linkIterator).source; dest=(*linkIterator).dest;weight=(*linkIterator).weight;
cliqueVector.clear();
kCliquesFind(cliqueVector, tempNet, source, dest, weight, k-1, 0);
numberOfSmallCliques+=cliqueVector.size();
}
delete tempNetPointer;
//Use the number of k-1 cliques to determine the hash size
size_t hash_bits = determineHashSize(numberOfSmallCliques, k - 1);
size_t numSlots=1; numSlots = numSlots << hash_bits; // Number of slots is 2**hash_bits
if (verbose){
std::cout<< "Number of "<< k-1 <<"-cliques: " <<numberOfSmallCliques<<std::endl;
std::cout<<"Number of bits in the hash table: "<<hash_bits<<std::endl;
std::cout<<"Number of slots in the hash table: "<<numSlots<<std::endl;
}
cliqueHash k1cliquesHash(numSlots, hash_bits, k - 1);
KruskalTree communities;
size_t nLinksLeft=linkList.size();
while (nLinksLeft>0)
{
nLinksLeft--;
Link link=linkList.front();linkList.pop_front();
source=link.source;dest=link.dest;weight=link.weight;
// phase I
cliqueVector.clear();
kCliquesFind(cliqueVector, net, source, dest, weight, k, 0);
// phase II
kCommunitiesFind(cliqueVector, communities, k1cliquesHash, net, k);
}
//communities are now detected, next we output the structure
std::ofstream ofile(outputFile.c_str());
outputCommunityStructure(communities, k1cliquesHash, ofile);
}
bool weighedCliqueCmp(const weighedClique lhs, const weighedClique rhs)
{
return lhs.getWeight() > rhs.getWeight();
}
void kCommunitiesFindWeighted(std::vector<weighedClique> & cliqueVector, KruskalTree & communities, cliqueHash & k1cliquesHash, NetType & net, const size_t k, const float threshold)
{
std::vector<size_t> tempVector;
weighedClique k1clique;
nodeCommunities nodeComs;
Dendrogram dendrogram;
size_t currentCliqueNumber = 0;
CommunityTracker comTracker(k1cliquesHash, communities, nodeComs, dendrogram, net);
for (std::vector<weighedClique>::iterator i = cliqueVector.begin(); i != cliqueVector.end(); ++i)
{
if (i->getWeight() < threshold)
break;
comTracker.addClique(*i);
currentCliqueNumber++;
//nodeComs.printCommunities(nodeCommunitOutputFile);
}
//dendrogram.printTree(dendrogramOutputFile);
}
void weightedSCP(NetType & net, std::ifstream & file, const size_t numberOfLinks, const size_t k, const float threshold, const size_t weightFunction, std::string outputFile)
{
size_t source, dest;
float weight;
// store all k-cliques here and sort after that
std::vector<weighedClique> cliqueVector;
// phase I
while (readLine(file, source, dest, weight))
kCliquesFind(cliqueVector, net, source, dest, weight, k, weightFunction);
std::sort(cliqueVector.begin(), cliqueVector.end(), weighedCliqueCmp);
//std::cout << cliqueVector.size() << " k-cliques" << std::endl;
// Use an upper bound for the number of k-1 cliques as hash size. Each k-clique has k k-1 cliques.
size_t hash_bits = determineHashSize(cliqueVector.size() * k, k - 1);
cliqueHash k1cliquesHash(1 << hash_bits, hash_bits, k - 1);
KruskalTree communities;
// phase II
kCommunitiesFindWeighted(cliqueVector, communities, k1cliquesHash, net, k, threshold);
//communities are now detected, next we output the structure
std::ofstream ofile(outputFile.c_str());
outputCommunityStructure(communities, k1cliquesHash, ofile);
//std::cout << "largest: " << communities.getLargestComponentSize() << std::endl;
}
bool validateLinkList(std::list<Link> &linkList,size_t netSize,bool verbose){
if (verbose) std::cout << "Checking that the node labels are not sparce and there are no multiedges... ";
NetType tempNet;
for (std::list<Link>::iterator linkIterator=linkList.begin() ; linkIterator != linkList.end(); linkIterator++ ){
if (tempNet[linkIterator->source][linkIterator->dest]!=0){
std::cerr <<"Error: The input file contains multi-edges."<<std::endl;
return false;
}
tempNet[linkIterator->source][linkIterator->dest]=linkIterator->weight;
}
if (tempNet.size()!=netSize){
std::cerr <<"Error: Node labels are sparse. Please name nodes from 0 to n-1."<<std::endl;
return false;
}
if (verbose) std::cout << "Ok."<< std::endl;
return true;
}
int percolation(char * fileName, const size_t k, const size_t weighted, const float threshold, const size_t weightFunction, std::string outputFile,bool verbose,bool sanityCheck)
{
size_t numberOfLinks;
size_t netSize;
std::list<Link> linkList;
// First read in the network from the file
if (verbose) std::cout << "Reading in the network...\n";
if (!getNetSizeAndLinkNumbers(fileName, netSize, numberOfLinks,linkList)) return EXIT_FAILURE;
if (verbose) std::cout<< "Number of nodes: " << netSize << "\nNumber of links: " <<numberOfLinks << "\n";
//Check that the edge list is valid, this will waste some time
if (sanityCheck) if (!validateLinkList(linkList,netSize,verbose)) return EXIT_FAILURE;
// Finally, proceed with the clique percolation
std::ifstream file(fileName);
if (file.is_open())
{
NetType net(netSize);
if (!weighted)
unweightedSCP(net, linkList, numberOfLinks, k, outputFile,verbose);
if (weighted)
weightedSCP(net, file, numberOfLinks, k, threshold, weightFunction, outputFile);
}
file.close();
return EXIT_SUCCESS;
}
int main(int argc, char* argv[])
{
size_t netSize, numberOfLinks;
size_t k = 3;
size_t weighted = 0;
float threshold = 0;
size_t weightFunction = 0;
bool verbose=false;
std::string outputFile;
//-- Parse arguments
for (size_t i = 2; i < argc; i++)
{
if (!strncmp(argv[i], "-k=", 3))
k = atoi(argv[i] + 3);
else if (!strncmp(argv[i], "-o=", 3))
outputFile = argv[i] + 3;
else if (!strcmp(argv[i], "-v"))
verbose=true;
/*
else if (!strcmp(argv[i], "-w"))
weighted = 1;
else if (!strncmp(argv[i], "-t=", 3))
threshold = atof(argv[i] + 3);
else if (!strcmp(argv[i], "-f"))
weightFunction = atof(argv[++i]);
*/ else{
std::cerr << "Invalid argument: "<<argv[i] <<std::endl;
std::cerr << HELPSTR<<std::endl;
return EXIT_FAILURE;
}
}
//--- Sanity checks for the input arguments
//Check that the input file was given
if (argc==1){
std::cerr << "Invalid number of arguments."<<std::endl;
std::cerr << HELPSTR<<std::endl;
return EXIT_FAILURE;
}
//Check that the clique size is valid
if (k < 3)
{
std::cerr << "Invalid value of clique size k: " << k << std::endl << "The value of k must be 3 or larger." << std::endl;
return EXIT_FAILURE;
}
//Check the the output file is given. If not, use "[inputfile]_output"
if (outputFile.empty())
{
outputFile = argv[1];
outputFile.append("_output");
}
//--- Run clique percolation
int exitCode=percolation(argv[1], k, weighted, threshold, weightFunction, outputFile,verbose,true);
// calculate timings
if (verbose)
std::cout << "Time used: " << (double)clock() / (double)CLOCKS_PER_SEC << "s" << std::endl;
return exitCode;
}
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/k_clique.h
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef H_K_CLIQUE
#define H_K_CLIQUE
#include <vector>
#include <map>
#include <cassert>
#include <iostream>
#include <vector>
#include <sstream>
#include <string>
#include <fstream>
#include <set>
#include <ctime>
#include <list>
#include "weighedClique.h"
//#include "numSet2.h"
#include "cliqueHash.h"
//#include "multiIter.h"
#include "kruskal.h"
#include "nodeCommunities.h"
#include "communityTracker.h"
#include "dendrogram.h"
// typedef float EdgeData;
// typedef SymmNet<size_t> NetType; // needs laboratory's library
//typedef std::list<size_t> nodeList; // standard library
// typedef std::vector<numSet> vectorMap;
//typedef std::vector<clique> cliqueVector; // standard library
// typedef std::map< clique, size_t, compareIndexes > nodeCliqueMap;
// typedef std::map< clique, size_t > nodeCliqueMap;
typedef Set<size_t> nodeSet; // needs laboratory's library
//typedef std::vector<numSet2> vectorSet; // standard library
//typedef std::map< clique, size_t > nodeCliqueMap;
size_t determineHashSize(const size_t numElements, const size_t k);
void getNetSizeAndLinkNumbers(char * fileName, size_t & netSize, size_t & numLinks);
bool readLine(std::ifstream & myfile, size_t & source, size_t & dest, float & weight);
void kCliquesFind(std::vector<weighedClique> & cliqueVector, NetType & net, size_t source, size_t dest, const float weight, const size_t k, const size_t weightFunction);
void kCommunitiesFind(std::vector<weighedClique> & cliqueVector, KruskalTree & communities, cliqueHash & k1cliquesHash, NetType & net, const size_t k);
void outputCommunityStructure(KruskalTree & communities, cliqueHash & k1cliquesHash, std::ofstream & file);
void unweightedSCP(NetType & net, std::ifstream & file, const size_t numberOfLinks, const size_t k);
bool weighedCliqueCmp(weighedClique lhs, weighedClique rhs);
void kCommunitiesFindWeighted(std::vector<weighedClique> & cliqueVector, KruskalTree & communities, cliqueHash & k1cliquesHash, NetType & net, const size_t k, const float threshold);
void weightedSCP(NetType & net, std::ifstream & file, const size_t numberOfLinks, const size_t k, const float threshold, const size_t weightFunction);
void percolation(char * fileName, const size_t k, const size_t weighted, const float threshold, const size_t weightFunction);
#endif
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/kruskal.cpp
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "kruskal.h"
#include <iostream>
KruskalTree::KruskalTree() : largestComponentSize(1) {}
size_t KruskalTree::add()
{
size_t vecSize = table.size();
table.push_back(vecSize);
commSizes.push_back(1);
return vecSize;
}
size_t KruskalTree::add(const size_t root)
{
if (root <= table.size())
{
table.push_back(root);
findRoot(table[table.size() - 1]);
commSizes.push_back(1);
}
else
add();
return table.size() - 1;
}
void KruskalTree::connect(const size_t first, const size_t second)
{
if (first < table.size() && second < table.size() && !inSameSet(first, second)) // After the call inSameSet table[first] and table[second] point to their real roots
{
commSizes[table[second]] += commSizes[table[first]];
if (commSizes[table[second]] > largestComponentSize)
largestComponentSize = commSizes[table[second]];
table[table[first]] = table[table[second]];
}
}
bool KruskalTree::inSameSet(const size_t first, const size_t second)
{
if (findRoot(first) == findRoot(second))
return true;
else
return false;
}
size_t KruskalTree::findRoot(const size_t source)
{
size_t root = table[source];
while (root != table[root])
{
root = table[root];
}
size_t currentRoot = source;
while (currentRoot != root)
{
size_t oldRoot = table[currentRoot];
table[currentRoot] = root;
currentRoot = oldRoot;
}
return root;
}
size_t KruskalTree::size(const size_t source)
{
return commSizes[findRoot(source)];
}
size_t KruskalTree::getLargestComponentSize() const
{
return largestComponentSize;
}
void KruskalTree::printTree(std::ostream & file) const
{
for (int i = 0; i < table.size(); i++)
file << i << ": " << table[i] << " s: " << commSizes[i] << std::endl;
file << std::endl;
}
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/kruskal.h
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef KRUSKAL_H
#define KRUSKAL_H
#include <vector>
#include <iostream>
#include "weighedClique.h"
class KruskalTree
{
public:
KruskalTree();
size_t add(); // return the index where the element was added ( = table.size() - 1 )
size_t add(const size_t root); // same as above
void connect(const size_t first, const size_t second); // connects two sets, after the operation the first points to the root of second
bool inSameSet(const size_t first, const size_t second); // checks if two elements belong to same set
size_t findRoot(const size_t source); // finds the real root of an element
size_t size(const size_t source);
size_t getLargestComponentSize() const;
void printTree(std::ostream & file) const;
private:
std::vector<size_t> table; // stores the pointer to root
std::vector<size_t> commSizes; // sizes of the sets are kept here
size_t largestComponentSize;
};
#endif
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/nodeCommunities.cpp
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "nodeCommunities.h"
nodeCommunities::nodeCommunities() : largest(0) {}
void nodeCommunities::addClique(const size_t index, const clique & newClique)
{
// add the nodes to the set
for (size_t i = 0; i < newClique.size(); i++)
communities[index].put(newClique.at(i));
// check if this community becomes the largest
if (communities[index].size() > largest)
{
largest = communities[index].size();
largestCom = index;
}
}
void nodeCommunities::erase(const size_t index)
{
communities.erase(index);
if (index == largestCom)
{
largest = 0;
for (std::map<size_t, nodeSet>::iterator i = communities.begin(); i != communities.end(); i++)
if (i->second.size() > largest)
{
largest = i->second.size();
largestCom = i->first;
}
}
}
size_t nodeCommunities::connect(size_t first, size_t second)
{
for (nodeSet::iterator i = communities[first].begin(); !i.finished(); ++i)
communities[second].put(*i);
erase(first);
if (communities[second].size() > largest)
{
largest = communities[second].size();
largestCom = second;
}
return second;
}
void nodeCommunities::printCommunities(std::ostream & file) const
{
file << "largest: " << largest << std::endl;
for (std::map<size_t, nodeSet>::const_iterator i = communities.begin(); i != communities.end(); i++)
{
file << i->first << ": ";
for (nodeSet::const_iterator j = i->second.begin(); !j.finished(); ++j)
file << *j << " ";
file << std::endl;
}
file << std::endl;
}
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/nodeCommunities.h
================================================
/*
scp, The sequential clique percolation algorithm.
Copyright (C) 2011 Aalto University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef NODECOMMUNITIES_H
#define NODECOMMUNITIES_H
#include "weighedClique.h"
#include <map>
#include <iostream>
#include "lcelib/Containers.H"
typedef Set<size_t> nodeSet;
class nodeCommunities
{
public:
nodeCommunities();
void addClique(const size_t index, const clique & newClique);
size_t connect(size_t first, size_t second); // connects two communities, the smaller one is merged into the bigger one, return the index of the merged community
size_t getLargest() const { return largest; }
size_t getSize(const size_t comIndex) { return communities[comIndex].size(); }
void printCommunities(std::ostream & file) const;
private:
std::map<size_t, nodeSet> communities;
size_t largest; // holds the size of the largest community
size_t largestCom; // the index of the largest community
void erase(const size_t index); // erases the community with the given index, erasing the largest community fucks up the largest counter
};
#endif
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/script/testScp.py
================================================
import os
executable = "../k_clique"
tempDir = "../"
testDataDir = "../testData/"
def listComp(l1, l2):
if len(l1) != len(l2):
return cmp(len(l1), len(l2))
for e1, e2 in zip(l1, l2):
if e1 != e2:
return cmp(e1, e2)
return 0
def compareCommunities(scpComms, cfComms):
l1 = []
l2 = []
for line in open(scpComms, 'r'):
comms = map(int, line.split())
comms.sort()
if len(comms) > 0:
l1.append(comms)
for line in open(cfComms, 'r'):
comms = map(int, line.split()[1:])
comms.sort()
l2.append(comms)
l1.sort(cmp=listComp)
l2.sort(cmp=listComp)
l1 = tuple(map(tuple, l1))
l2 = tuple(map(tuple, l2))
# print l1
# print l2
return l1 == l2
testNets = filter(lambda x: x.endswith(".edg"), os.listdir(testDataDir))
for net in testNets:
print "Testing ",
print net,
print "..."
# find the k-values
kvalues = []
if os.path.exists(testDataDir + net + "_files/"):
for file in os.listdir(testDataDir + net + "_files/"):
if file.startswith("k="):
kvalues.append(int(file[2:]))
kvalues.sort()
for k in kvalues:
print "k=" + str(k) + ": ",
# remove old temp file
if os.path.exists(tempDir + "temp.txt"):
os.remove(tempDir + "temp.txt")
# run the k-clique percolator
list(os.popen(executable + " " + testDataDir + net + " -k=" + str(k) + " -o=" + tempDir + "temp.txt"))
if compareCommunities(tempDir + "temp.txt", testDataDir + net + "_files/k=" + str(k) + "/communities"):
print "OK."
else:
print "FAILED!"
break
# remove old temp file
if os.path.exists(tempDir + "temp.txt"):
os.remove(tempDir + "temp.txt")
================================================
FILE: Algorithms/2008-CliquePercolation/src_cpp/testData/random_1000_005.edg
================================================
0 471 1.0
0 162 1.0
0 306 1.0
0 340 1.0
0 264 1.0
0 374 1.0
0 429 1.0
0 654 1.0
0 290 1.0
0 434 1.0
0 468 1.0
0 874 1.0
0 895 1.0
0 638 1.0
0 926 1.0
0 240 1.0
0 329 1.0
0 27 1.0
0 630 1.0
0 942 1.0
0 960 1.0
0 973 1.0
0 148 1.0
0 860 1.0
0 318 1.0
0 297 1.0
0 585 1.0
0 454 1.0
0 708 1.0
0 467 1.0
0 501 1.0
0 213 1.0
0 137 1.0
0 933 1.0
0 930 1.0
0 443 1.0
0 477 1.0
0 956 1.0
0 846 1.0
0 880 1.0
0 626 1.0
0 372 1.0
0 961 1.0
0 597 1.0
0 5 1.0
0 40 1.0
1 170 1.0
1 738 1.0
1 162 1.0
1 806 1.0
1 463 1.0
1 570 1.0
1 871 1.0
1 151 1.0
1 44 1.0
1 185 1.0
1 219 1.0
1 253 1.0
1 905 1.0
1 102 1.0
1 478 1.0
1 690 1.0
1 250 1.0
1 153 1.0
1 920 1.0
1 399 1.0
1 433 1.0
1 577 1.0
1 679 1.0
1 747 1.0
1 35 1.0
1 404 1.0
1 451 1.0
1 773 1.0
1 663 1.0
1 299 1.0
1 401 1.0
1 723 1.0
1 558 1.0
1 626 1.0
1 893 1.0
1 119 1.0
1 275 1.0
1 809 1.0
1 699 1.0
1 788 1.0
2 125 1.0
2 746 1.0
2 526 1.0
2 971 1.0
2 162 1.0
2 751 1.0
2 552 1.0
2 353 1.0
2 908 1.0
2 269 1.0
2 392 1.0
2 672 1.0
2 397 1.0
2 719 1.0
2 300 1.0
2 677 1.0
2 826 1.0
2 305 1.0
2 572 1.0
2 54 1.0
2 462 1.0
2 818 1.0
2 941 1.0
2 742 1.0
2 687 1.0
2 344 1.0
2 666 1.0
2 679 1.0
2 747 1.0
2 925 1.0
2 561 1.0
2 705 1.0
2 828 1.0
2 307 1.0
2 883 1.0
2 697 1.0
2 210 1.0
2 155 1.0
2 354 1.0
2 388 1.0
2 744 1.0
2 765 1.0
2 723 1.0
2 956 1.0
2 757 1.0
2 181 1.0
2 503 1.0
2 804 1.0
2 139 1.0
2 152 1.0
2 940 1.0
2 186 1.0
2 987 1.0
3 390 1.0
3 945 1.0
3 50 1.0
3 979 1.0
3 958 1.0
3 814 1.0
3 14 1.0
3 471 1.0
3 937 1.0
3 539 1.0
3 573 1.0
3 696 1.0
3 311 1.0
3 345 1.0
3 947 1.0
3 892 1.0
3 651 1.0
3 973 1.0
3 308 1.0
3 808 1.0
3 753 1.0
3 643 1.0
3 102 1.0
3 224 1.0
3 203 1.0
3 525 1.0
3 614 1.0
3 758 1.0
3 74 1.0
3 25 1.0
3 894 1.0
3 242 1.0
3 708 1.0
3 133 1.0
3 221 1.0
3 179 1.0
3 713 1.0
3 891 1.0
3 197 1.0
3 574 1.0
3 409 1.0
3 676 1.0
3 101 1.0
3 223 1.0
3 456 1.0
3 545 1.0
3 600 1.0
3 9 1.0
3 325 1.0
3 42 1.0
3 859 1.0
3 639 1.0
3 597 1.0
3 898 1.0
3 5 1.0
3 466 1.0
4 217 1.0
4 633 1.0
4 468 1.0
4 680 1.0
4 22 1.0
4 837 1.0
4 638 1.0
4 960 1.0
4 274 1.0
4 164 1.0
4 706 1.0
4 986 1.0
4 889 1.0
4 347 1.0
4 847 1.0
4 737 1.0
4 394 1.0
4 284 1.0
4 483 1.0
4 66 1.0
4 530 1.0
4 79 1.0
4 543 1.0
4 378 1.0
4 522 1.0
4 391 1.0
4 606 1.0
4 700 1.0
4 836 1.0
4 849 1.0
4 451 1.0
4 828 1.0
4 608 1.0
4 38 1.0
4 886 1.0
4 799 1.0
4 689 1.0
4 964 1.0
4 9 1.0
4 996 1.0
4 914 1.0
4 694 1.0
4 728 1.0
4 28 1.0
4 487 1.0
4 411 1.0
4 678 1.0
4 390 1.0
4 280 1.0
4 34 1.0
4 864 1.0
5 40 1.0
5 411 1.0
5 602 1.0
5 314 1.0
5 382 1.0
5 183 1.0
5 937 1.0
5 806 1.0
5 387 1.0
5 243 1.0
5 654 1.0
5 59 1.0
5 41 1.0
5 934 1.0
5 680 1.0
5 337 1.0
5 837 1.0
5 706 1.0
5 884 1.0
5 177 1.0
5 965 1.0
5 423 1.0
5 724 1.0
5 525 1.0
5 415 1.0
5 606 1.0
5 873 1.0
5 352 1.0
5 962 1.0
5 941 1.0
5 433 1.0
5 755 1.0
5 234 1.0
5 590 1.0
5 535 1.0
5 645 1.0
5 836 1.0
5 349 1.0
5 527 1.0
5 938 1.0
5 76 1.0
5 320 1.0
5 265 1.0
5 841 1.0
5 689 1.0
5 956 1.0
5 42 1.0
5 23 1.0
5 626 1.0
5 461 1.0
5 919 1.0
5 111 1.0
5 521 1.0
6 340 1.0
6 819 1.0
6 19 1.0
6 764 1.0
6 324 1.0
6 379 1.0
6 502 1.0
6 97 1.0
6 77 1.0
6 562 1.0
6 211 1.0
6 245 1.0
6 313 1.0
6 62 1.0
6 792 1.0
6 923 1.0
6 318 1.0
6 729 1.0
6 221 1.0
6 543 1.0
6 378 1.0
6 51 1.0
6 582 1.0
6 362 1.0
6 794 1.0
6 917 1.0
6 265 1.0
6 354 1.0
6 101 1.0
6 223 1.0
6 367 1.0
6 469 1.0
6 325 1.0
6 393 1.0
6 778 1.0
6 372 1.0
6 605 1.0
6 812 1.0
6 867 1.0
6 28 1.0
6 927 1.0
6 956 1.0
6 301 1.0
6 623 1.0
6 458 1.0
6 513 1.0
6 924 1.0
6 505 1.0
7 966 1.0
7 136 1.0
7 83 1.0
7 280 1.0
7 958 1.0
7 429 1.0
7 963 1.0
7 764 1.0
7 565 1.0
7 942 1.0
7 777 1.0
7 858 1.0
7 981 1.0
7 994 1.0
7 77 1.0
7 164 1.0
7 211 1.0
7 533 1.0
7 326 1.0
7 936 1.0
7 25 1.0
7 915 1.0
7 195 1.0
7 517 1.0
7 784 1.0
7 221 1.0
7 112 1.0
7 145 1.0
7 200 1.0
7 666 1.0
7 857 1.0
7 514 1.0
7 747 1.0
7 980 1.0
7 493 1.0
7 870 1.0
7 705 1.0
7 417 1.0
7 663 1.0
7 998 1.0
7 943 1.0
7 689 1.0
7 833 1.0
7 668 1.0
7 825 1.0
7 160 1.0
7 317 1.0
7 550 1.0
7 330 1.0
7 364 1.0
7 165 1.0
7 508 1.0
7 953 1.0
7 144 1.0
7 233 1.0
8 746 1.0
8 835 1.0
8 979 1.0
8 492 1.0
8 63 1.0
8 327 1.0
8 683 1.0
8 696 1.0
8 497 1.0
8 188 1.0
8 544 1.0
8 701 1.0
8 769 1.0
8 172 1.0
8 261 1.0
8 816 1.0
8 15 1.0
8 97 1.0
8 240 1.0
8 740 1.0
8 994 1.0
8 486 1.0
8 143 1.0
8 232 1.0
8 465 1.0
8 334 1.0
8 868 1.0
8 237 1.0
8 737 1.0
8 428 1.0
8 983 1.0
8 441 1.0
8 852 1.0
8 365 1.0
8 598 1.0
8 632 1.0
8 234 1.0
8 179 1.0
8 281 1.0
8 417 1.0
8 362 1.0
8 26 1.0
8 807 1.0
8 375 1.0
8 752 1.0
8 841 1.0
8 210 1.0
8 456 1.0
8 647 1.0
8 736 1.0
8 660 1.0
8 817 1.0
8 165 1.0
9 966 1.0
9 136 1.0
9 458 1.0
9 116 1.0
9 725 1.0
9 149 1.0
9 416 1.0
9 497 1.0
9 122 1.0
9 311 1.0
9 633 1.0
9 379 1.0
9 612 1.0
9 769 1.0
9 947 1.0
9 85 1.0
9 494 1.0
9 486 1.0
9 808 1.0
9 609 1.0
9 698 1.0
9 753 1.0
9 355 1.0
9 499 1.0
9 787 1.0
9 690 1.0
9 25 1.0
9 860 1.0
9 915 1.0
9 585 1.0
9 18 1.0
9 564 1.0
9 653 1.0
9 569 1.0
9 514 1.0
9 226 1.0
9 35 1.0
9 726 1.0
9 417 1.0
9 362 1.0
9 89 1.0
9 176 1.0
9 244 1.0
9 744 1.0
9 545 1.0
9 867 1.0
9 304 1.0
9 283 1.0
9 139 1.0
9 618 1.0
9 241 1.0
9 597 1.0
9 78 1.0
9 309 1.0
9 987 1.0
9 610 1.0
10 340 1.0
10 32 1.0
10 59 1.0
10 413 1.0
10 722 1.0
10 811 1.0
10 748 1.0
10 329 1.0
10 363 1.0
10 575 1.0
10 651 1.0
10 787 1.0
10 795 1.0
10 884 1.0
10 546 1.0
10 129 1.0
10 682 1.0
10 54 1.0
10 873 1.0
10 818 1.0
10 619 1.0
10 255 1.0
10 145 1.0
10 357 1.0
10 302 1.0
10 104 1.0
10 624 1.0
10 637 1.0
10 844 1.0
10 218 1.0
10 540 1.0
10 899 1.0
10 553 1.0
10 68 1.0
10 655 1.0
10 511 1.0
10 600 1.0
10 765 1.0
10 778 1.0
10 820 1.0
10 948 1.0
10 605 1.0
10 220 1.0
10 919 1.0
10 843 1.0
10 445 1.0
10 623 1.0
10 136 1.0
10 746 1.0
10 615 1.0
10 793 1.0
11 594 1.0
11 607 1.0
11 963 1.0
11 243 1.0
11 434 1.0
11 235 1.0
11 735 1.0
11 913 1.0
11 52 1.0
11 261 1.0
11 65 1.0
11 185 1.0
11 329 1.0
11 56 1.0
11 617 1.0
11 499 1.0
11 659 1.0
11 795 1.0
11 258 1.0
11 724 1.0
11 842 1.0
11 737 1.0
11 627 1.0
11 860 1.0
11 407 1.0
11 876 1.0
11 915 1.0
11 522 1.0
11 967 1.0
11 802 1.0
11 671 1.0
11 574 1.0
11 608 1.0
11 123 1.0
11 155 1.0
11 689 1.0
11 524 1.0
11 613 1.0
11 73 1.0
11 53 1.0
11 215 1.0
11 45 1.0
11 377 1.0
11 40 1.0
11 70 1.0
11 555 1.0
11 966 1.0
11 170 1.0
12 212 1.0
12 479 1.0
12 623 1.0
12 63 1.0
12 14 1.0
12 382 1.0
12 361 1.0
12 230 1.0
12 209 1.0
12 764 1.0
12 709 1.0
12 421 1.0
12 599 1.0
12 646 1.0
12 269 1.0
12 337 1.0
12 52 1.0
12 659 1.0
12 926 1.0
12 706 1.0
12 452 1.0
12 541 1.0
12 486 1.0
12 198 1.0
12 766 1.0
12 368 1.0
12 457 1.0
12 33 1.0
12 779 1.0
12 813 1.0
12 771 1.0
12 339 1.0
12 174 1.0
12 873 1.0
12 818 1.0
12 598 1.0
12 166 1.0
12 30 1.0
12 255 1.0
12 454 1.0
12 721 1.0
12 179 1.0
12 501 1.0
12 891 1.0
12 603 1.0
12 320 1.0
12 875 1.0
12 964 1.0
12 299 1.0
12 744 1.0
12 600 1.0
12 147 1.0
12 380 1.0
12 414 1.0
12 152 1.0
12 275 1.0
12 974 1.0
12 111 1.0
12 199 1.0
12 809 1.0
12 233 1.0
13 293 1.0
13 196 1.0
13 696 1.0
13 840 1.0
13 332 1.0
13 709 1.0
13 861 1.0
13 874 1.0
13 316 1.0
13 520 1.0
13 588 1.0
13 245 1.0
13 902 1.0
13 593 1.0
13 585 1.0
13 187 1.0
13 242 1.0
13 365 1.0
13 399 1.0
13 268 1.0
13 556 1.0
13 577 1.0
13 35 1.0
13 84 1.0
13 171 1.0
13 184 1.0
13 76 1.0
13 55 1.0
13 231 1.0
13 123 1.0
13 48 1.0
13 362 1.0
13 540 1.0
13 579 1.0
13 414 1.0
13 393 1.0
13 482 1.0
13 833 1.0
13 262 1.0
13 907 1.0
13 917 1.0
13 775 1.0
13 343 1.0
13 941 1.0
13 822 1.0
13 966 1.0
14 445 1.0
14 547 1.0
14 793 1.0
14 408 1.0
14 997 1.0
14 654 1.0
14 400 1.0
14 59 1.0
14 578 1.0
14 481 1.0
14 748 1.0
14 727 1.0
14 151 1.0
14 384 1.0
14 740 1.0
14 798 1.0
14 355 1.0
14 732 1.0
14 49 1.0
14 580 1.0
14 250 1.0
14 462 1.0
14 928 1.0
14 721 1.0
14 501 1.0
14 556 1.0
14 802 1.0
14 582 1.0
14 328 1.0
14 396 1.0
14 485 1.0
14 930 1.0
14 579 1.0
14 469 1.0
14 613 1.0
14 846 1.0
14 550 1.0
14 241 1.0
14 385 1.0
14 885 1.0
14 720 1.0
15 589 1.0
15 424 1.0
15 348 1.0
15 581 1.0
15 848 1.0
15 869 1.0
15 251 1.0
15 196 1.0
15 819 1.0
15 531 1.0
15 332 1.0
15 565 1.0
15 620 1.0
15 113 1.0
15 159 1.0
15 426 1.0
15 172 1.0
15 549 1.0
15 541 1.0
15 110 1.0
15 774 1.0
15 808 1.0
15 69 1.0
15 855 1.0
15 49 1.0
15 271 1.0
15 74 1.0
15 216 1.0
15 881 1.0
15 284 1.0
15 373 1.0
15 695 1.0
15 263 1.0
15 496 1.0
15 915 1.0
15 810 1.0
15 92 1.0
15 158 1.0
15 247 1.0
15 391 1.0
15 485 1.0
15 430 1.0
15 930 1.0
15 888 1.0
15 922 1.0
15 291 1.0
15 969 1.0
15 23 1.0
15 537 1.0
15 53 1.0
15 948 1.0
15 529 1.0
15 309 1.0
15 398 1.0
15 864 1.0
15 521 1.0
15 699 1.0
16 780 1.0
16 251 1.0
16 963 1.0
16 298 1.0
16 47 1.0
16 743 1.0
16 447 1.0
16 22 1.0
16 392 1.0
16 617 1.0
16 952 1.0
16 287 1.0
16 21 1.0
16 102 1.0
16 601 1.0
16 258 1.0
16 546 1.0
16 834 1.0
16 839 1.0
16 174 1.0
16 318 1.0
16 153 1.0
16 242 1.0
16 564 1.0
16 598 1.0
16 344 1.0
16 899 1.0
16 234 1.0
16 467 1.0
16 734 1.0
16 679 1.0
16 946 1.0
16 781 1.0
16 561 1.0
16 362 1.0
16 231 1.0
16 176 1.0
16 464 1.0
16 532 1.0
16 553 1.0
16 333 1.0
16 621 1.0
16 867 1.0
16 647 1.0
16 228 1.0
16 927 1.0
16 351 1.0
16 508 1.0
16 919 1.0
16 809 1.0
16 665 1.0
16 91 1.0
16 987 1.0
16 125 1.0
17 246 1.0
17 390 1.0
17 903 1.0
17 793 1.0
17 319 1.0
17 984 1.0
17 654 1.0
17 942 1.0
17 523 1.0
17 989 1.0
17 269 1.0
17 714 1.0
17 172 1.0
17 206 1.0
17 240 1.0
17 418 1.0
17 198 1.0
17 753 1.0
17 732 1.0
17 21 1.0
17 656 1.0
17 758 1.0
17 216 1.0
17 991 1.0
17 640 1.0
17 530 1.0
17 784 1.0
17 852 1.0
17 556 1.0
17 514 1.0
17 84 1.0
17 218 1.0
17 396 1.0
17 930 1.0
17 676 1.0
17 189 1.0
17 511 1.0
17 545 1.0
17 757 1.0
17 181 1.0
17 270 1.0
17 571 1.0
17 372 1.0
17 440 1.0
17 584 1.0
17 592 1.0
17 796 1.0
17 521 1.0
18 589 1.0
18 191 1.0
18 170 1.0
18 116 1.0
18 903 1.0
18 793 1.0
18 395 1.0
18 442 1.0
18 578 1.0
18 324 1.0
18 392 1.0
18 405 1.0
18 583 1.0
18 473 1.0
18 418 1.0
18 740 1.0
18 541 1.0
18 808 1.0
18 90 1.0
18 465 1.0
18 156 1.0
18 102 1.0
18 190 1.0
18 567 1.0
18 690 1.0
18 881 1.0
18 318 1.0
18 496 1.0
18 522 1.0
18 71 1.0
18 391 1.0
18 51 1.0
18 459 1.0
18 171 1.0
18 349 1.0
18 307 1.0
18 485 1.0
18 540 1.0
18 532 1.0
18 998 1.0
18 511 1.0
18 579 1.0
18 291 1.0
18 435 1.0
18 935 1.0
18 825 1.0
18 660 1.0
18 317 1.0
18 119 1.0
18 262 1.0
18 529 1.0
18 673 1.0
18 275 1.0
18 796 1.0
18 885 1.0
18 28 1.0
18 57 1.0
19 589 1.0
19 725 1.0
19 162 1.0
19 429 1.0
19 497 1.0
19 819 1.0
19 798 1.0
19 201 1.0
19 523 1.0
19 235 1.0
19 324 1.0
19 934 1.0
19 515 1.0
19 118 1.0
19 185 1.0
19 219 1.0
19 596 1.0
19 952 1.0
19 266 1.0
19 300 1.0
19 745 1.0
19 690 1.0
19 258 1.0
19 978 1.0
19 669 1.0
19 902 1.0
19 991 1.0
19 449 1.0
19 161 1.0
19 593 1.0
19 627 1.0
19 268 1.0
19 878 1.0
19 104 1.0
19 514 1.0
19 959 1.0
19 294 1.0
19 561 1.0
19 828 1.0
19 540 1.0
19 684 1.0
19 286 1.0
19 943 1.0
19 977 1.0
19 723 1.0
19 147 1.0
19 128 1.0
19 880 1.0
19 427 1.0
19 372 1.0
19 419 1.0
19 377 1.0
19 665 1.0
20 484 1.0
20 324 1.0
20 790 1.0
20 947 1.0
20 138 1.0
20 240 1.0
20 253 1.0
20 342 1.0
20 575 1.0
20 800 1.0
20 779 1.0
20 360 1.0
20 826 1.0
20 420 1.0
20 852 1.0
20 577 1.0
20 645 1.0
20 391 1.0
20 171 1.0
20 315 1.0
20 383 1.0
20 506 1.0
20 815 1.0
20 870 1.0
20 89 1.0
20 896 1.0
20 909 1.0
20 833 1.0
20 114 1.0
20 901 1.0
20 42 1.0
20 550 1.0
20 673 1.0
20 364 1.0
20 411 1.0
20 212 1.0
20 466 1.0
20 50 1.0
20 678 1.0
20 877 1.0
21 662 1.0
21 88 1.0
21 476 1.0
21 709 1.0
21 222 1.0
21 887 1.0
21 934 1.0
21 206 1.0
21 143 1.0
21 614 1.0
21 74 1.0
21 216 1.0
21 449 1.0
21 674 1.0
21 475 1.0
21 454 1.0
21 920 1.0
21 522 1.0
21 844 1.0
21 71 1.0
21 84 1.0
21 64 1.0
21 480 1.0
21 451 1.0
21 396 1.0
21 519 1.0
21 582 1.0
21 443 1.0
21 637 1.0
21 689 1.0
21 964 1.0
21 846 1.0
21 988 1.0
21 987 1.0
21 411 1.0
22 733 1.0
22 83 1.0
22 780 1.0
22 903 1.0
22 149 1.0
22 560 1.0
22 827 1.0
22 484 1.0
22 717 1.0
22 141 1.0
22 819 1.0
22 764 1.0
22 620 1.0
22 997 1.0
22 32 1.0
22 955 1.0
22 989 1.0
22 947 1.0
22 52 1.0
22 651 1.0
22 520 1.0
22 177 1.0
22 512 1.0
22 457 1.0
22 169 1.0
22 115 1.0
22 601 1.0
22 881 1.0
22 74 1.0
22 593 1.0
22 771 1.0
22 462 1.0
22 899 1.0
22 645 1.0
22 213 1.0
22 925 1.0
22 155 1.0
22 477 1.0
22 422 1.0
22 854 1.0
22 689 1.0
22 380 1.0
22 859 1.0
22 639 1.0
22 275 1.0
22 974 1.0
22 309 1.0
22 398 1.0
22 809 1.0
22 932 1.0
23 767 1.0
23 369 1.0
23 636 1.0
23 746 1.0
23 416 1.0
23 662 1.0
23 319 1.0
23 950 1.0
23 47 1.0
23 557 1.0
23 680 1.0
23 604 1.0
23 803 1.0
23 863 1.0
23 410 1.0
23 279 1.0
23 711 1.0
23 347 1.0
23 381 1.0
23 627 1.0
23 771 1.0
23 894 1.0
23 949 1.0
23 242 1.0
23 420 1.0
23 509 1.0
23 797 1.0
23 268 1.0
23 946 1.0
23 171 1.0
23 260 1.0
23 96 1.0
23 692 1.0
23 252 1.0
23 930 1.0
23 134 1.0
23 181 1.0
23 359 1.0
23 935 1.0
23 550 1.0
23 838 1.0
23 906 1.0
23 948 1.0
23 288 1.0
24 356 1.0
24 445 1.0
24 746 1.0
24 259 1.0
24 615 1.0
24 560 1.0
24 819 1.0
24 100 1.0
24 476 1.0
24 222 1.0
24 455 1.0
24 324 1.0
24 127 1.0
24 913 1.0
24 934 1.0
24 295 1.0
24 850 1.0
24 740 1.0
24 829 1.0
24 397 1.0
24 533 1.0
24 656 1.0
24 115 1.0
24 203 1.0
24 970 1.0
24 407 1.0
24 729 1.0
24 297 1.0
24 386 1.0
24 166 1.0
24 454 1.0
24 611 1.0
24 679 1.0
24 104 1.0
24 137 1.0
24 836 1.0
24 883 1.0
24 252 1.0
24 951 1.0
24 519 1.0
24 786 1.0
24 443 1.0
24 731 1.0
24 202 1.0
24 94 1.0
24 880 1.0
24 482 1.0
24 893 1.0
24 783 1.0
24 529 1.0
24 98 1.0
24 474 1.0
24 563 1.0
24 686 1.0
24 762 1.0
24 809 1.0
25 445 1.0
25 500 1.0
25 458 1.0
25 348 1.0
25 882 1.0
25 285 1.0
25 518 1.0
25 772 1.0
25 916 1.0
25 654 1.0
25 193 1.0
25 693 1.0
25 384 1.0
25 473 1.0
25 131 1.0
25 198 1.0
25 643 1.0
25 677 1.0
25 258 1.0
25 470 1.0
25 559 1.0
25 572 1.0
25 195 1.0
25 229 1.0
25 441 1.0
25 614 1.0
25 310 1.0
25 784 1.0
25 92 1.0
25 792 1.0
25 158 1.0
25 425 1.0
25 718 1.0
25 265 1.0
25 731 1.0
25 134 1.0
25 223 1.0
25 469 1.0
25 592 1.0
25 846 1.0
25 838 1.0
25 898 1.0
26 301 1.0
26 356 1.0
26 678 1.0
26 848 1.0
26 416 1.0
26 594 1.0
26 628 1.0
26 772 1.0
26 827 1.0
26 709 1.0
26 861 1.0
26 167 1.0
26 222 1.0
26 523 1.0
26 570 1.0
26 52 1.0
26 138 1.0
26 151 1.0
26 282 1.0
26 740 1.0
26 837 1.0
26 892 1.0
26 355 1.0
26 960 1.0
26 279 1.0
26 169 1.0
26 957 1.0
26 74 1.0
26 107 1.0
26 640 1.0
26 585 1.0
26 378 1.0
26 425 1.0
26 404 1.0
26 527 1.0
26 938 1.0
26 862 1.0
26 142 1.0
26 430 1.0
26 443 1.0
26 532 1.0
26 752 1.0
26 257 1.0
26 346 1.0
26 990 1.0
26 681 1.0
26 597 1.0
27 63 1.0
27 272 1.0
27 75 1.0
27 340 1.0
27 607 1.0
27 615 1.0
27 154 1.0
27 476 1.0
27 641 1.0
27 434 1.0
27 722 1.0
27 819 1.0
27 827 1.0
27 903 1.0
27 976 1.0
27 575 1.0
27 478 1.0
27 635 1.0
27 415 1.0
27 263 1.0
27 551 1.0
27 941 1.0
27 200 1.0
27 632 1.0
27 768 1.0
27 104 1.0
27 480 1.0
27 658 1.0
27 917 1.0
27 320 1.0
27 123 1.0
27 244 1.0
27 689 1.0
27 613 1.0
27 927 1.0
27 288 1.0
27 555 1.0
27 733 1.0
28 767 1.0
28 314 1.0
28 63 1.0
28 670 1.0
28 183 1.0
28 594 1.0
28 950 1.0
28 696 1.0
28 122 1.0
28 442 1.0
28 421 1.0
28 942 1.0
28 256 1.0
28 358 1.0
28 735 1.0
28 638 1.0
28 329 1.0
28 787 1.0
28 732 1.0
28 279 1.0
28 368 1.0
28 923 1.0
28 115 1.0
28 593 1.0
28 970 1.0
28 229 1.0
28 121 1.0
28 475 1.0
28 708 1.0
28 79 1.0
28 488 1.0
28 323 1.0
28 179 1.0
28 501 1.0
28 734 1.0
28 823 1.0
28 912 1.0
28 514 1.0
28 383 1.0
28 417 1.0
28 828 1.0
28 464 1.0
28 210 1.0
28 155 1.0
28 676 1.0
28 312 1.0
28 634 1.0
28 60 1.0
28 427 1.0
28 228 1.0
28 660 1.0
28 639 1.0
28 207 1.0
28 440 1.0
28 529 1.0
28 508 1.0
28 953 1.0
28 91 1.0
28 322 1.0
29 945 1.0
29 314 1.0
29 827 1.0
29 916 1.0
29 175 1.0
29 531 1.0
29 997 1.0
29 921 1.0
29 434 1.0
29 578 1.0
29 612 1.0
29 769 1.0
29 837 1.0
29 528 1.0
29 164 1.0
29 452 1.0
29 520 1.0
29 829 1.0
29 965 1.0
29 258 1.0
29 292 1.0
29 313 1.0
29 491 1.0
29 538 1.0
29 593 1.0
29 606 1.0
29 805 1.0
29 886 1.0
29 133 1.0
29 509 1.0
29 556 1.0
29 302 1.0
29 912 1.0
29 150 1.0
29 328 1.0
29 527 1.0
29 705 1.0
29 833 1.0
29 270 1.0
29 503 1.0
29 647 1.0
29 406 1.0
29 207 1.0
29 461 1.0
29 694 1.0
29 165 1.0
29 398 1.0
30 361 1.0
30 594 1.0
30 340 1.0
30 662 1.0
30 654 1.0
30 489 1.0
30 536 1.0
30 604 1.0
30 118 1.0
30 329 1.0
30 473 1.0
30 884 1.0
30 541 1.0
30 986 1.0
30 177 1.0
30 245 1.0
30 716 1.0
30 140 1.0
30 174 1.0
30 551 1.0
30 818 1.0
30 386 1.0
30 941 1.0
30 420 1.0
30 983 1.0
30 831 1.0
30 556 1.0
30 247 1.0
30 768 1.0
30 137 1.0
30 946 1.0
30 438 1.0
30 328 1.0
30 616 1.0
30 595 1.0
30 540 1.0
30 485 1.0
30 574 1.0
30 760 1.0
30 773 1.0
30 854 1.0
30 943 1.0
30 689 1.0
30 867 1.0
30 346 1.0
30 147 1.0
30 571 1.0
30 53 1.0
30 173 1.0
30 296 1.0
30 906 1.0
30 864 1.0
30 199 1.0
30 521 1.0
30 932 1.0
30 953 1.0
31 877 1.0
31 157 1.0
31 623 1.0
31 793 1.0
31 416 1.0
31 882 1.0
31 683 1.0
31 340 1.0
31 806 1.0
31 264 1.0
31 476 1.0
31 887 1.0
31 722 1.0
31 180 1.0
31 824 1.0
31 536 1.0
31 769 1.0
31 947 1.0
31 672 1.0
31 617 1.0
31 850 1.0
31 185 1.0
31 507 1.0
31 77 1.0
31 321 1.0
31 622 1.0
31 847 1.0
31 593 1.0
31 915 1.0
31 36 1.0
31 66 1.0
31 153 1.0
31 441 1.0
31 886 1.0
31 831 1.0
31 179 1.0
31 556 1.0
31 645 1.0
31 336 1.0
31 815 1.0
31 629 1.0
31 123 1.0
31 545 1.0
31 778 1.0
31 956 1.0
31 215 1.0
31 106 1.0
31 194 1.0
31 838 1.0
31 98 1.0
31 432 1.0
31 665 1.0
31 91 1.0
32 212 1.0
32 136 1.0
32 458 1.0
32 759 1.0
32 272 1.0
32 594 1.0
32 340 1.0
32 141 1.0
32 298 1.0
32 709 1.0
32 180 1.0
32 824 1.0
32 138 1.0
32 261 1.0
32 816 1.0
32 858 1.0
32 452 1.0
32 198 1.0
32 685 1.0
32 124 1.0
32 643 1.0
32 135 1.0
32 884 1.0
32 347 1.0
32 926 1.0
32 284 1.0
32 121 1.0
32 530 1.0
32 729 1.0
32 768 1.0
32 637 1.0
32 616 1.0
32 794 1.0
32 718 1.0
32 815 1.0
32 231 1.0
32 930 1.0
32 655 1.0
32 60 1.0
32 128 1.0
32 168 1.0
32 668 1.0
32 707 1.0
32 652 1.0
32 487 1.0
32 864 1.0
33 390 1.0
33 657 1.0
33 602 1.0
33 979 1.0
33 382 1.0
33 704 1.0
33 497 1.0
33 353 1.0
33 366 1.0
33 756 1.0
33 515 1.0
33 460 1.0
33 151 1.0
33 131 1.0
33 829 1.0
33 287 1.0
33 520 1.0
33 39 1.0
33 753 1.0
33 49 1.0
33 334 1.0
33 368 1.0
33 115 1.0
33 326 1.0
33 703 1.0
33 593 1.0
33 949 1.0
33 839 1.0
33 174 1.0
33 585 1.0
33 255 1.0
33 378 1.0
33 234 1.0
33 179 1.0
33 611 1.0
33 904 1.0
33 150 1.0
33 43 1.0
33 739 1.0
33 794 1.0
33 752 1.0
33 89 1.0
33 176 1.0
33 621 1.0
33 367 1.0
33 202 1.0
33 592 1.0
33 427 1.0
33 893 1.0
33 783 1.0
33 639 1.0
33 275 1.0
33 453 1.0
33 699 1.0
34 657 1.0
34 636 1.0
34 780 1.0
34 149 1.0
34 560 1.0
34 738 1.0
34 594 1.0
34 108 1.0
34 497 1.0
34 633 1.0
34 646 1.0
34 934 1.0
34 947 1.0
34 118 1.0
34 350 1.0
34 672 1.0
34 727 1.0
34 274 1.0
34 651 1.0
34 541 1.0
34 808 1.0
34 902 1.0
34 449 1.0
34 305 1.0
34 661 1.0
34 99 1.0
34 886 1.0
34 598 1.0
34 776 1.0
34 92 1.0
34 789 1.0
34 933 1.0
34 781 1.0
34 349 1.0
34 616 1.0
34 328 1.0
34 210 1.0
34 68 1.0
34 621 1.0
34 964 1.0
34 511 1.0
34 456 1.0
34 346 1.0
34 550 1.0
34 639 1.0
34 351 1.0
34 694 1.0
34 762 1.0
34 220 1.0
34 741 1.0
34 398 1.0
34 665 1.0
35 280 1.0
35 746 1.0
35 869 1.0
35 903 1.0
35 958 1.0
35 374 1.0
35 497 1.0
35 442 1.0
35 201 1.0
35 502 1.0
35 879 1.0
35 947 1.0
35 371 1.0
35 981 1.0
35 295 1.0
35 528 1.0
35 97 1.0
35 219 1.0
35 664 1.0
35 677 1.0
35 190 1.0
35 402 1.0
35 779 1.0
35 902 1.0
35 936 1.0
35 216 1.0
35 716 1.0
35 805 1.0
35 674 1.0
35 941 1.0
35 687 1.0
35 878 1.0
35 823 1.0
35 247 1.0
35 480 1.0
35 370 1.0
35 404 1.0
35 430 1.0
35 464 1.0
35 443 1.0
35 511 1.0
35 312 1.0
35 634 1.0
35 236 1.0
35 791 1.0
35 592 1.0
35 880 1.0
35 935 1.0
35 969 1.0
35 749 1.0
35 262 1.0
35 152 1.0
35 351 1.0
35 186 1.0
35 851 1.0
36 136 1.0
36 63 1.0
36 382 1.0
36 937 1.0
36 285 1.0
36 319 1.0
36 408 1.0
36 531 1.0
36 222 1.0
36 201 1.0
36 557 1.0
36 72 1.0
36 105 1.0
36 303 1.0
36 316 1.0
36 337 1.0
36 604 1.0
36 845 1.0
36 908 1.0
36 321 1.0
36 981 1.0
36 635 1.0
36 292 1.0
36 140 1.0
36 551 1.0
36 187 1.0
36 988 1.0
36 247 1.0
36 658 1.0
36 142 1.0
36 123 1.0
36 346 1.0
36 956 1.0
36 702 1.0
36 448 1.0
36 537 1.0
36 207 1.0
36 906 1.0
36 487 1.0
36 919 1.0
36 610 1.0
36 678 1.0
37 526 1.0
37 882 1.0
37 162 1.0
37 662 1.0
37 366 1.0
37 358 1.0
37 248 1.0
37 460 1.0
37 405 1.0
37 879 1.0
37 44 1.0
37 308 1.0
37 342 1.0
37 562 1.0
37 863 1.0
37 973 1.0
37 279 1.0
37 978 1.0
37 491 1.0
37 868 1.0
37 957 1.0
37 250 1.0
37 297 1.0
37 310 1.0
37 344 1.0
37 365 1.0
37 433 1.0
37 158 1.0
37 480 1.0
37 43 1.0
37 396 1.0
37 867 1.0
37 291 1.0
37 42 1.0
37 393 1.0
37 571 1.0
37 173 1.0
37 351 1.0
37 647 1.0
37 132 1.0
37 186 1.0
37 597 1.0
37 770 1.0
37 885 1.0
37 901 1.0
37 940 1.0
38 369 1.0
38 725 1.0
38 979 1.0
38 882 1.0
38 162 1.0
38 997 1.0
38 798 1.0
38 167 1.0
38 633 1.0
38 41 1.0
38 227 1.0
38 549 1.0
38 727 1.0
38 473 1.0
38 253 1.0
38 931 1.0
38 787 1.0
38 279 1.0
38 148 1.0
38 271 1.0
38 983 1.0
38 99 1.0
38 242 1.0
38 255 1.0
38 420 1.0
38 126 1.0
38 446 1.0
38 454 1.0
38 488 1.0
38 653 1.0
38 328 1.0
38 130 1.0
38 218 1.0
38 286 1.0
38 891 1.0
38 587 1.0
38 189 1.0
38 312 1.0
38 490 1.0
38 469 1.0
38 731 1.0
38 912 1.0
38 925 1.0
38 946 1.0
38 584 1.0
38 686 1.0
38 665 1.0
39 75 1.0
39 895 1.0
39 840 1.0
39 264 1.0
39 853 1.0
39 942 1.0
39 455 1.0
39 777 1.0
39 866 1.0
39 358 1.0
39 968 1.0
39 984 1.0
39 549 1.0
39 97 1.0
39 507 1.0
39 939 1.0
39 376 1.0
39 643 1.0
39 423 1.0
39 580 1.0
39 868 1.0
39 339 1.0
39 750 1.0
39 839 1.0
39 446 1.0
39 192 1.0
39 493 1.0
39 883 1.0
39 76 1.0
39 197 1.0
39 854 1.0
39 977 1.0
39 545 1.0
39 291 1.0
39 558 1.0
39 393 1.0
39 283 1.0
39 783 1.0
39 119 1.0
39 529 1.0
39 508 1.0
39 919 1.0
39 432 1.0
39 974 1.0
39 212 1.0
39 623 1.0
39 513 1.0
40 484 1.0
40 751 1.0
40 641 1.0
40 387 1.0
40 59 1.0
40 434 1.0
40 274 1.0
40 596 1.0
40 664 1.0
40 368 1.0
40 148 1.0
40 894 1.0
40 640 1.0
40 208 1.0
40 331 1.0
40 454 1.0
40 810 1.0
40 645 1.0
40 768 1.0
40 603 1.0
40 294 1.0
40 239 1.0
40 273 1.0
40 739 1.0
40 946 1.0
40 930 1.0
40 155 1.0
40 443 1.0
40 223 1.0
40 168 1.0
40 147 1.0
40 367 1.0
40 160 1.0
40 668 1.0
40 139 1.0
40 372 1.0
40 715 1.0
40 893 1.0
40 922 1.0
40 943 1.0
40 911 1.0
40 767 1.0
40 691 1.0
41 767 1.0
41 602 1.0
41 848 1.0
41 95 1.0
41 683 1.0
41 662 1.0
41 408 1.0
41 730 1.0
41 819 1.0
41 243 1.0
41 188 1.0
41 421 1.0
41 853 1.0
41 193 1.0
41 138 1.0
41 570 1.0
41 261 1.0
41 219 1.0
41 596 1.0
41 808 1.0
41 567 1.0
41 368 1.0
41 868 1.0
41 62 1.0
41 758 1.0
41 936 1.0
41 360 1.0
41 538 1.0
41 928 1.0
41 407 1.0
41 496 1.0
41 242 1.0
41 598 1.0
41 310 1.0
41 454 1.0
41 776 1.0
41 789 1.0
41 679 1.0
41 624 1.0
41 336 1.0
41 739 1.0
41 917 1.0
41 718 1.0
41 55 1.0
41 786 1.0
41 689 1.0
41 956 1.0
41 901 1.0
41 236 1.0
41 448 1.0
41 948 1.0
41 495 1.0
41 563 1.0
41 508 1.0
41 885 1.0
41 809 1.0
41 555 1.0
41 356 1.0
42 88 1.0
42 122 1.0
42 319 1.0
42 798 1.0
42 824 1.0
42 845 1.0
42 638 1.0
42 329 1.0
42 102 1.0
42 368 1.0
42 62 1.0
42 470 1.0
42 360 1.0
42 792 1.0
42 462 1.0
42 153 1.0
42 886 1.0
42 776 1.0
42 104 1.0
42 404 1.0
42 64 1.0
42 96 1.0
42 76 1.0
42 951 1.0
42 265 1.0
42 553 1.0
42 566 1.0
42 697 1.0
42 930 1.0
42 94 1.0
42 736 1.0
42 880 1.0
42 956 1.0
42 985 1.0
42 351 1.0
42 241 1.0
42 817 1.0
42 309 1.0
42 398 1.0
42 322 1.0
42 945 1.0
42 602 1.0
42 961 1.0
42 670 1.0
42 759 1.0
43 615 1.0
43 306 1.0
43 895 1.0
43 840 1.0
43 408 1.0
43 531 1.0
43 489 1.0
43 667 1.0
43 777 1.0
43 358 1.0
43 248 1.0
43 426 1.0
43 172 1.0
43 447 1.0
43 44 1.0
43 452 1.0
43 832 1.0
43 580 1.0
43 470 1.0
43 847 1.0
43 674 1.0
43 708 1.0
43 454 1.0
43 577 1.0
43 933 1.0
43 679 1.0
43 51 1.0
43 239 1.0
43 705 1.0
43 663 1.0
43 68 1.0
43 422 1.0
43 689 1.0
43 270 1.0
43 73 1.0
43 626 1.0
43 804 1.0
43 817 1.0
43 762 1.0
43 652 1.0
43 411 1.0
43 678 1.0
44 103 1.0
44 636 1.0
44 958 1.0
44 416 1.0
44 971 1.0
44 484 1.0
44 874 1.0
44 997 1.0
44 47 1.0
44 180 1.0
44 968 1.0
44 549 1.0
44 65 1.0
44 672 1.0
44 329 1.0
44 274 1.0
44 418 1.0
44 473 1.0
44 110 1.0
44 719 1.0
44 808 1.0
44 842 1.0
44 850 1.0
44 355 1.0
44 499 1.0
44 897 1.0
44 190 1.0
44 635 1.0
44 339 1.0
44 818 1.0
44 297 1.0
44 674 1.0
44 46 1.0
44 509 1.0
44 467 1.0
44 933 1.0
44 268 1.0
44 624 1.0
44 802 1.0
44 946 1.0
44 980 1.0
44 205 1.0
44 582 1.0
44 616 1.0
44 218 1.0
44 993 1.0
44 430 1.0
44 820 1.0
44 566 1.0
44 812 1.0
44 380 1.0
44 215 1.0
44 45 1.0
44 652 1.0
44 830 1.0
44 919 1.0
44 843 1.0
45 966 1.0
45 979 1.0
45 149 1.0
45 670 1.0
45 683 1.0
45 463 1.0
45 209 1.0
45 442 1.0
45 188 1.0
45 552 1.0
45 290 1.0
45 379 1.0
45 358 1.0
45 502 1.0
45 654 1.0
45 879 1.0
45 185 1.0
45 622 1.0
45 169 1.0
45 347 1.0
45 682 1.0
45 107 1.0
45 339 1.0
45 661 1.0
45 771 1.0
45 805 1.0
45 543 1.0
45 112 1.0
45 687 1.0
45 247 1.0
45 336 1.0
45 535 1.0
45 789 1.0
45 96 1.0
45 218 1.0
45 396 1.0
45 197 1.0
45 223 1.0
45 888 1.0
45 647 1.0
45 969 1.0
45 86 1.0
45 119 1.0
45 317 1.0
45 385 1.0
45 639 1.0
45 796 1.0
46 869 1.0
46 882 1.0
46 450 1.0
46 196 1.0
46 696 1.0
46 353 1.0
46 620 1.0
46 984 1.0
46 777 1.0
46 824 1.0
46 337 1.0
46 625 1.0
46 274 1.0
46 609 1.0
46 115 1.0
46 394 1.0
46 907 1.0
46 454 1.0
46 632 1.0
46 234 1.0
46 865 1.0
46 302 1.0
46 912 1.0
46 781 1.0
46 582 1.0
46 616 1.0
46 273 1.0
46 828 1.0
46 849 1.0
46 265 1.0
46 299 1.0
46 954 1.0
46 998 1.0
46 757 1.0
46 503 1.0
46 139 1.0
46 119 1.0
46 932 1.0
46 125 1.0
46 678 1.0
47 369 1.0
47 458 1.0
47 780 1.0
47 348 1.0
47 204 1.0
47 670 1.0
47 848 1.0
47 628 1.0
47 88 1.0
47 552 1.0
47 122 1.0
47 997 1.0
47 311 1.0
47 167 1.0
47 646 1.0
47 371 1.0
47 638 1.0
47 206 1.0
47 452 1.0
47 164 1.0
47 486 1.0
47 232 1.0
47 787 1.0
47 635 1.0
47 923 1.0
47 62 1.0
47 237 1.0
47 559 1.0
47 758 1.0
47 881 1.0
47 860 1.0
47 229 1.0
47 983 1.0
47 420 1.0
47 797 1.0
47 166 1.0
47 289 1.0
47 611 1.0
47 844 1.0
47 294 1.0
47 184 1.0
47 917 1.0
47 430 1.0
47 710 1.0
47 888 1.0
47 312 1.0
47 173 1.0
47 872 1.0
47 351 1.0
47 927 1.0
47 98 1.0
47 652 1.0
47 707 1.0
47 78 1.0
48 531 1.0
48 256 1.0
48 146 1.0
48 557 1.0
48 591 1.0
48 193 1.0
48 460 1.0
48 481 1.0
48 494 1.0
48 418 1.0
48 795 1.0
48 803 1.0
48 124 1.0
48 211 1.0
48 614 1.0
48 161 1.0
48 750 1.0
48 949 1.0
48 79 1.0
48 200 1.0
48 92 1.0
48 268 1.0
48 548 1.0
48 205 1.0
48 130 1.0
48 485 1.0
48 155 1.0
48 820 1.0
48 81 1.0
48 257 1.0
48 456 1.0
48 325 1.0
48 736 1.0
48 139 1.0
48 173 1.0
48 906 1.0
48 398 1.0
48 57 1.0
48 982 1.0
48 987 1.0
48 568 1.0
48 835 1.0
48 636 1.0
48 615 1.0
48 903 1.0
48 306 1.0
48 958 1.0
49 314 1.0
49 403 1.0
49 217 1.0
49 772 1.0
49 971 1.0
49 353 1.0
49 709 1.0
49 277 1.0
49 984 1.0
49 811 1.0
49 303 1.0
49 159 1.0
49 337 1.0
49 926 1.0
49 97 1.0
49 829 1.0
49 376 1.0
49 124 1.0
49 478 1.0
49 135 1.0
49 313 1.0
49 381 1.0
49 504 1.0
49 305 1.0
49 554 1.0
49 732 1.0
49 787 1.0
49 653 1.0
49 797 1.0
49 577 1.0
49 876 1.0
49 894 1.0
49 158 1.0
49 768 1.0
49 933 1.0
49 986 1.0
49 76 1.0
49 286 1.0
49 375 1.0
49 718 1.0
49 566 1.0
49 778 1.0
49 207 1.0
49 940 1.0
49 275 1.0
50 712 1.0
50 518 1.0
50 607 1.0
50 696 1.0
50 874 1.0
50 675 1.0
50 709 1.0
50 167 1.0
50 59 1.0
50 290 1.0
50 52 1.0
50 227 1.0
50 871 1.0
50 583 1.0
50 151 1.0
50 706 1.0
50 342 1.0
50 588 1.0
50 533 1.0
50 190 1.0
50 512 1.0
50 944 1.0
50 847 1.0
50 949 1.0
50 386 1.0
50 653 1.0
50 700 1.0
50 51 1.0
50 980 1.0
50 972 1.0
50 163 1.0
50 307 1.0
50 341 1.0
50 375 1.0
50 299 1.0
50 223 1.0
50 401 1.0
50 359 1.0
50 53 1.0
50 440 1.0
50 995 1.0
50 707 1.0
50 851 1.0
50 364 1.0
50 57 1.0
50 576 1.0
50 233 1.0
50 953 1.0
50 125 1.0
50 733 1.0
51 589 1.0
51 623 1.0
51 416 1.0
51 950 1.0
51 442 1.0
51 332 1.0
51 188 1.0
51 80 1.0
51 874 1.0
51 468 1.0
51 701 1.0
51 105 1.0
51 672 1.0
51 740 1.0
51 876 1.0
51 245 1.0
51 389 1.0
51 910 1.0
51 991 1.0
51 826 1.0
51 881 1.0
51 373 1.0
51 606 1.0
51 99 1.0
51 509 1.0
51 112 1.0
51 255 1.0
51 126 1.0
51 747 1.0
51 459 1.0
51 349 1.0
51 548 1.0
51 218 1.0
51 307 1.0
51 506 1.0
51 540 1.0
51 388 1.0
51 257 1.0
51 862 1.0
51 998 1.0
51 419 1.0
51 830 1.0
51 953 1.0
52 458 1.0
52 594 1.0
52 586 1.0
52 366 1.0
52 523 1.0
52 612 1.0
52 65 1.0
52 583 1.0
52 842 1.0
52 102 1.0
52 745 1.0
52 779 1.0
52 525 1.0
52 470 1.0
52 669 1.0
52 140 1.0
52 318 1.0
52 208 1.0
52 242 1.0
52 551 1.0
52 912 1.0
52 96 1.0
52 252 1.0
52 472 1.0
52 155 1.0
52 616 1.0
52 278 1.0
52 401 1.0
52 469 1.0
52 128 1.0
52 799 1.0
52 812 1.0
52 841 1.0
52 888 1.0
52 385 1.0
52 993 1.0
53 534 1.0
53 204 1.0
53 122 1.0
53 243 1.0
53 455 1.0
53 722 1.0
53 413 1.0
53 646 1.0
53 570 1.0
53 77 1.0
53 622 1.0
53 601 1.0
53 271 1.0
53 504 1.0
53 373 1.0
53 428 1.0
53 784 1.0
53 708 1.0
53 509 1.0
53 112 1.0
53 126 1.0
53 247 1.0
53 378 1.0
53 501 1.0
53 527 1.0
53 907 1.0
53 951 1.0
53 155 1.0
53 189 1.0
53 257 1.0
53 380 1.0
53 469 1.0
53 448 1.0
53 461 1.0
53 817 1.0
53 940 1.0
53 220 1.0
53 254 1.0
54 212 1.0
54 301 1.0
54 103 1.0
54 513 1.0
54 458 1.0
54 835 1.0
54 348 1.0
54 615 1.0
54 327 1.0
54 560 1.0
54 848 1.0
54 387 1.0
54 100 1.0
54 248 1.0
54 625 1.0
54 426 1.0
54 981 1.0
54 405 1.0
54 871 1.0
54 473 1.0
54 507 1.0
54 884 1.0
54 164 1.0
54 198 1.0
54 342 1.0
54 90 1.0
54 533 1.0
54 504 1.0
54 627 1.0
54 483 1.0
54 865 1.0
54 954 1.0
54 58 1.0
54 988 1.0
54 967 1.0
54 823 1.0
54 624 1.0
54 768 1.0
54 912 1.0
54 171 1.0
54 972 1.0
54 265 1.0
54 155 1.0
54 422 1.0
54 689 1.0
54 469 1.0
54 935 1.0
54 537 1.0
54 783 1.0
54 241 1.0
54 665 1.0
55 746 1.0
55 183 1.0
55 416 1.0
55 793 1.0
55 882 1.0
55 196 1.0
55 264 1.0
55 209 1.0
55 510 1.0
55 201 1.0
55 59 1.0
55 337 1.0
55 405 1.0
55 295 1.0
55 528 1.0
55 960 1.0
55 77 1.0
55 308 1.0
55 931 1.0
55 444 1.0
55 944 1.0
55 457 1.0
55 635 1.0
55 614 1.0
55 936 1.0
55 627 1.0
55 339 1.0
55 441 1.0
55 530 1.0
55 708 1.0
55 653 1.0
55 852 1.0
55 543 1.0
55 865 1.0
55 666 1.0
55 755 1.0
55 946 1.0
55 959 1.0
55 76 1.0
55 773 1.0
55 519 1.0
55 909 1.0
55 998 1.0
55 278 1.0
55 81 1.0
55 291 1.0
55 414 1.0
55 791 1.0
55 715 1.0
55 550 1.0
55 398 1.0
55 343 1.0
55 576 1.0
56 599 1.0
56 921 1.0
56 667 1.0
56 722 1.0
56 138 1.0
56 316 1.0
56 596 1.0
56 110 1.0
56 376 1.0
56 177 1.0
56 876 1.0
56 918 1.0
56 635 1.0
56 957 1.0
56 148 1.0
56 271 1.0
56 360 1.0
56 703 1.0
56 695 1.0
56 737 1.0
56 847 1.0
56 221 1.0
56 852 1.0
56 920 1.0
56 213 1.0
56 192 1.0
56 548 1.0
56 438 1.0
56 679 1.0
56 781 1.0
56 396 1.0
56 197 1.0
56 202 1.0
56 812 1.0
56 969 1.0
56 215 1.0
56 838 1.0
56 817 1.0
56 241 1.0
56 57 1.0
56 343 1.0
56 788 1.0
56 712 1.0
56 369 1.0
56 746 1.0
56 526 1.0
56 924 1.0
56 966 1.0
57 623 1.0
57 937 1.0
57 827 1.0
57 819 1.0
57 908 1.0
57 887 1.0
57 688 1.0
57 434 1.0
57 494 1.0
57 439 1.0
57 651 1.0
57 90 1.0
57 342 1.0
57 478 1.0
57 622 1.0
57 732 1.0
57 271 1.0
57 121 1.0
57 66 1.0
57 331 1.0
57 200 1.0
57 234 1.0
57 645 1.0
57 810 1.0
57 941 1.0
57 988 1.0
57 815 1.0
57 540 1.0
57 123 1.0
57 833 1.0
57 948 1.0
57 440 1.0
57 474 1.0
57 618 1.0
58 835 1.0
58 259 1.0
58 560 1.0
58 539 1.0
58 738 1.0
58 790 1.0
58 913 1.0
58 248 1.0
58 905 1.0
58 795 1.0
58 609 1.0
58 211 1.0
58 69 1.0
58 423 1.0
58 402 1.0
58 821 1.0
58 381 1.0
58 648 1.0
58 957 1.0
58 999 1.0
58 331 1.0
58 865 1.0
58 425 1.0
58 815 1.0
58 142 1.0
58 333 1.0
58 114 1.0
58 490 1.0
58 524 1.0
58 160 1.0
58 427 1.0
58 613 1.0
58 508 1.0
58 974 1.0
58 322 1.0
59 93 1.0
59 214 1.0
59 536 1.0
59 316 1.0
59 761 1.0
59 418 1.0
59 829 1.0
59 978 1.0
59 491 1.0
59 724 1.0
59 504 1.0
59 771 1.0
59 784 1.0
59 289 1.0
59 104 1.0
59 336 1.0
59 650 1.0
59 299 1.0
59 81 1.0
59 202 1.0
59 901 1.0
59 304 1.0
59 317 1.0
59 762 1.0
59 186 1.0
59 275 1.0
59 521 1.0
59 809 1.0
59 259 1.0
59 505 1.0
59 995 1.0
59 895 1.0
59 751 1.0
59 122 1.0
59 853 1.0
59 366 1.0
59 997 1.0
60 212 1.0
60 306 1.0
60 772 1.0
60 366 1.0
60 256 1.0
60 413 1.0
60 976 1.0
60 337 1.0
60 659 1.0
60 405 1.0
60 795 1.0
60 685 1.0
60 850 1.0
60 876 1.0
60 800 1.0
60 991 1.0
60 305 1.0
60 229 1.0
60 394 1.0
60 153 1.0
60 488 1.0
60 645 1.0
60 336 1.0
60 985 1.0
60 231 1.0
60 123 1.0
60 155 1.0
60 799 1.0
60 346 1.0
60 435 1.0
60 359 1.0
60 626 1.0
60 757 1.0
60 833 1.0
60 673 1.0
60 741 1.0
60 343 1.0
61 204 1.0
61 217 1.0
61 861 1.0
61 984 1.0
61 442 1.0
61 243 1.0
61 565 1.0
61 311 1.0
61 586 1.0
61 730 1.0
61 764 1.0
61 570 1.0
61 460 1.0
61 853 1.0
61 65 1.0
61 418 1.0
61 617 1.0
61 761 1.0
61 795 1.0
61 808 1.0
61 800 1.0
61 115 1.0
61 724 1.0
61 216 1.0
61 271 1.0
61 813 1.0
61 420 1.0
61 831 1.0
61 112 1.0
61 234 1.0
61 488 1.0
61 721 1.0
61 281 1.0
61 904 1.0
61 96 1.0
61 739 1.0
61 993 1.0
61 922 1.0
61 490 1.0
61 927 1.0
61 508 1.0
61 796 1.0
61 377 1.0
61 322 1.0
61 576 1.0
61 644 1.0
61 754 1.0
62 356 1.0
62 822 1.0
62 513 1.0
62 259 1.0
62 877 1.0
62 827 1.0
62 108 1.0
62 175 1.0
62 442 1.0
62 67 1.0
62 717 1.0
62 201 1.0
62 303 1.0
62 811 1.0
62 227 1.0
62 638 1.0
62 994 1.0
62 719 1.0
62 177 1.0
62 622 1.0
62 643 1.0
62 656 1.0
62 491 1.0
62 792 1.0
62 915 1.0
62 517 1.0
62 640 1.0
62 331 1.0
62 886 1.0
62 624 1.0
62 912 1.0
62 938 1.0
62 218 1.0
62 828 1.0
62 89 1.0
62 464 1.0
62 81 1.0
62 676 1.0
62 469 1.0
62 215 1.0
62 820 1.0
62 825 1.0
62 207 1.0
62 817 1.0
62 901 1.0
62 930 1.0
62 982 1.0
63 157 1.0
63 801 1.0
63 602 1.0
63 835 1.0
63 882 1.0
63 75 1.0
63 374 1.0
63 408 1.0
63 785 1.0
63 675 1.0
63 756 1.0
63 379 1.0
63 180 1.0
63 790 1.0
63 570 1.0
63 803 1.0
63 871 1.0
63 295 1.0
63 583 1.0
63 651 1.0
63 452 1.0
63 431 1.0
63 90 1.0
63 889 1.0
63 546 1.0
63 161 1.0
63 572 1.0
63 517 1.0
63 496 1.0
63 996 1.0
63 331 1.0
63 323 1.0
63 179 1.0
63 268 1.0
63 967 1.0
63 569 1.0
63 84 1.0
63 109 1.0
63 807 1.0
63 532 1.0
63 765 1.0
63 655 1.0
63 278 1.0
63 545 1.0
63 490 1.0
63 927 1.0
63 351 1.0
63 385 1.0
63 440 1.0
63 597 1.0
63 906 1.0
64 70 1.0
64 301 1.0
64 877 1.0
64 492 1.0
64 272 1.0
64 484 1.0
64 175 1.0
64 586 1.0
64 662 1.0
64 599 1.0
64 400 1.0
64 455 1.0
64 751 1.0
64 72 1.0
64 714 1.0
64 981 1.0
64 541 1.0
64 253 1.0
64 753 1.0
64 931 1.0
64 512 1.0
64 533 1.0
64 491 1.0
64 237 1.0
64 559 1.0
64 339 1.0
64 648 1.0
64 551 1.0
64 962 1.0
64 742 1.0
64 92 1.0
64 556 1.0
64 213 1.0
64 425 1.0
64 84 1.0
64 569 1.0
64 590 1.0
64 710 1.0
64 312 1.0
64 511 1.0
64 689 1.0
64 901 1.0
64 338 1.0
64 550 1.0
64 495 1.0
64 111 1.0
65 513 1.0
65 348 1.0
65 636 1.0
65 670 1.0
65 217 1.0
65 628 1.0
65 691 1.0
65 408 1.0
65 387 1.0
65 421 1.0
65 544 1.0
65 345 1.0
65 620 1.0
65 591 1.0
65 738 1.0
65 261 1.0
65 583 1.0
65 185 1.0
65 659 1.0
65 664 1.0
65 748 1.0
65 478 1.0
65 279 1.0
65 313 1.0
65 368 1.0
65 525 1.0
65 761 1.0
65 250 1.0
65 284 1.0
65 805 1.0
65 892 1.0
65 276 1.0
65 897 1.0
65 112 1.0
65 988 1.0
65 446 1.0
65 117 1.0
65 904 1.0
65 218 1.0
65 451 1.0
65 430 1.0
65 794 1.0
65 993 1.0
65 168 1.0
65 503 1.0
65 804 1.0
65 974 1.0
66 238 1.0
66 827 1.0
66 929 1.0
66 67 1.0
66 408 1.0
66 709 1.0
66 984 1.0
66 379 1.0
66 127 1.0
66 303 1.0
66 85 1.0
66 460 1.0
66 363 1.0
66 978 1.0
66 923 1.0
66 74 1.0
66 148 1.0
66 339 1.0
66 504 1.0
66 530 1.0
66 187 1.0
66 276 1.0
66 454 1.0
66 585 1.0
66 171 1.0
66 616 1.0
66 972 1.0
66 629 1.0
66 697 1.0
66 930 1.0
66 710 1.0
66 338 1.0
66 186 1.0
66 199 1.0
66 644 1.0
66 754 1.0
66 932 1.0
67 780 1.0
67 840 1.0
67 599 1.0
67 756 1.0
67 379 1.0
67 358 1.0
67 913 1.0
67 947 1.0
67 871 1.0
67 968 1.0
67 973 1.0
67 698 1.0
67 787 1.0
67 69 1.0
67 389 1.0
67 622 1.0
67 690 1.0
67 360 1.0
67 339 1.0
67 449 1.0
67 504 1.0
67 187 1.0
67 653 1.0
67 758 1.0
67 776 1.0
67 800 1.0
67 873 1.0
67 192 1.0
67 881 1.0
67 815 1.0
67 902 1.0
67 944 1.0
67 629 1.0
67 375 1.0
67 642 1.0
67 68 1.0
67 909 1.0
67 954 1.0
67 964 1.0
67 901 1.0
67 503 1.0
67 914 1.0
67 969 1.0
67 998 1.0
67 720 1.0
67 178 1.0
67 267 1.0
67 568 1.0
68 612 1.0
68 447 1.0
68 105 1.0
68 193 1.0
68 638 1.0
68 617 1.0
68 769 1.0
68 643 1.0
68 300 1.0
68 999 1.0
68 559 1.0
68 352 1.0
68 852 1.0
68 226 1.0
68 637 1.0
68 629 1.0
68 718 1.0
68 807 1.0
68 676 1.0
68 244 1.0
68 312 1.0
68 422 1.0
68 930 1.0
68 914 1.0
68 139 1.0
68 98 1.0
68 521 1.0
68 809 1.0
68 125 1.0
68 390 1.0
68 657 1.0
68 848 1.0
68 882 1.0
68 772 1.0
68 987 1.0
68 319 1.0
68 374 1.0
69 178 1.0
69 534 1.0
69 103 1.0
69 801 1.0
69 526 1.0
69 382 1.0
69 272 1.0
69 738 1.0
69 285 1.0
69 709 1.0
69 853 1.0
69 72 1.0
69 392 1.0
69 769 1.0
69 282 1.0
69 371 1.0
69 858 1.0
69 638 1.0
69 727 1.0
69 384 1.0
69 905 1.0
69 630 1.0
69 211 1.0
69 313 1.0
69 813 1.0
69 470 1.0
69 559 1.0
69 504 1.0
69 792 1.0
69 970 1.0
69 695 1.0
69 352 1.0
69 823 1.0
69 391 1.0
69 459 1.0
69 582 1.0
69 883 1.0
69 451 1.0
69 252 1.0
69 574 1.0
69 752 1.0
69 354 1.0
69 81 1.0
69 846 1.0
69 715 1.0
69 495 1.0
69 529 1.0
69 98 1.0
69 186 1.0
69 652 1.0
69 885 1.0
69 940 1.0
69 974 1.0
69 521 1.0
70 539 1.0
70 573 1.0
70 243 1.0
70 256 1.0
70 455 1.0
70 303 1.0
70 159 1.0
70 282 1.0
70 172 1.0
70 316 1.0
70 358 1.0
70 363 1.0
70 439 1.0
70 680 1.0
70 685 1.0
70 787 1.0
70 824 1.0
70 913 1.0
70 868 1.0
70 991 1.0
70 682 1.0
70 860 1.0
70 915 1.0
70 999 1.0
70 996 1.0
70 255 1.0
70 433 1.0
70 810 1.0
70 954 1.0
70 603 1.0
70 760 1.0
70 841 1.0
70 532 1.0
70 422 1.0
70 511 1.0
70 600 1.0
70 710 1.0
70 359 1.0
70 647 1.0
70 427 1.0
70 744 1.0
70 859 1.0
70 364 1.0
70 419 1.0
70 521 1.0
70 686 1.0
70 678 1.0
70 843 1.0
71 636 1.0
71 848 1.0
71 992 1.0
71 539 1.0
71 489 1.0
71 756 1.0
71 921 1.0
71 824 1.0
71 138 1.0
71 604 1.0
71 151 1.0
71 994 1.0
71 698 1.0
71 389 1.0
71 533 1.0
71 74 1.0
71 360 1.0
71 195 1.0
71 475 1.0
71 509 1.0
71 577 1.0
71 522 1.0
71 742 1.0
71 391 1.0
71 104 1.0
71 370 1.0
71 349 1.0
71 239 1.0
71 425 1.0
71 485 1.0
71 430 1.0
71 718 1.0
71 210 1.0
71 797 1.0
71 925 1.0
71 951 1.0
71 935 1.0
71 948 1.0
71 783 1.0
71 119 1.0
71 673 1.0
71 563 1.0
71 851 1.0
71 809 1.0
71 788 1.0
71 864 1.0
72 945 1.0
72 937 1.0
72 772 1.0
72 429 1.0
72 827 1.0
72 641 1.0
72 100 1.0
72 243 1.0
72 874 1.0
72 950 1.0
72 127 1.0
72 303 1.0
72 714 1.0
72 892 1.0
72 418 1.0
72 918 1.0
72 232 1.0
72 321 1.0
72 135 1.0
72 402 1.0
72 698 1.0
72 771 1.0
72 839 1.0
72 915 1.0
72 509 1.0
72 488 1.0
72 687 1.0
72 988 1.0
72 624 1.0
72 104 1.0
72 84 1.0
72 171 1.0
72 548 1.0
72 540 1.0
72 286 1.0
72 637 1.0
72 671 1.0
72 101 1.0
72 697 1.0
72 799 1.0
72 291 1.0
72 558 1.0
72 448 1.0
72 854 1.0
72 618 1.0
72 974 1.0
72 995 1.0
73 691 1.0
73 958 1.0
73 95 1.0
73 230 1.0
73 175 1.0
73 751 1.0
73 565 1.0
73 311 1.0
73 256 1.0
73 489 1.0
73 578 1.0
73 921 1.0
73 968 1.0
73 392 1.0
73 193 1.0
73 282 1.0
73 206 1.0
73 994 1.0
73 706 1.0
73 452 1.0
73 177 1.0
73 533 1.0
73 389 1.0
73 910 1.0
73 999 1.0
73 779 1.0
73 237 1.0
73 614 1.0
73 74 1.0
73 305 1.0
73 208 1.0
73 530 1.0
73 962 1.0
73 865 1.0
73 967 1.0
73 336 1.0
73 781 1.0
73 349 1.0
73 294 1.0
73 671 1.0
73 993 1.0
73 286 1.0
73 985 1.0
73 799 1.0
73 346 1.0
73 579 1.0
73 990 1.0
73 448 1.0
73 427 1.0
73 550 1.0
73 584 1.0
73 220 1.0
73 864 1.0
74 733 1.0
74 424 1.0
74 259 1.0
74 492 1.0
74 615 1.0
74 793 1.0
74 869 1.0
74 950 1.0
74 929 1.0
74 641 1.0
74 654 1.0
74 976 1.0
74 633 1.0
74 345 1.0
74 379 1.0
74 127 1.0
74 913 1.0
74 392 1.0
74 934 1.0
74 748 1.0
74 782 1.0
74 727 1.0
74 617 1.0
74 308 1.0
74 376 1.0
74 410 1.0
74 423 1.0
74 135 1.0
74 279 1.0
74 580 1.0
74 525 1.0
74 148 1.0
74 271 1.0
74 305 1.0
74 483 1.0
74 428 1.0
74 805 1.0
74 496 1.0
74 585 1.0
74 920 1.0
74 899 1.0
74 611 1.0
74 739 1.0
74 752 1.0
74 367 1.0
74 312 1.0
74 634 1.0
74 956 1.0
74 901 1.0
74 613 1.0
74 249 1.0
74 322 1.0
75 267 1.0
75 555 1.0
75 911 1.0
75 259 1.0
75 560 1.0
75 450 1.0
75 717 1.0
75 950 1.0
75 141 1.0
75 879 1.0
75 680 1.0
75 947 1.0
75 426 1.0
75 871 1.0
75 617 1.0
75 664 1.0
75 808 1.0
75 897 1.0
75 211 1.0
75 402 1.0
75 129 1.0
75 915 1.0
75 860 1.0
75 983 1.0
75 87 1.0
75 818 1.0
75 530 1.0
75 242 1.0
75 653 1.0
75 886 1.0
75 962 1.0
75 145 1.0
75 933 1.0
75 126 1.0
75 104 1.0
75 480 1.0
75 836 1.0
75 637 1.0
75 328 1.0
75 341 1.0
75 697 1.0
75 265 1.0
75 642 1.0
75 299 1.0
75 998 1.0
75 312 1.0
75 833 1.0
75 867 1.0
75 128 1.0
75 106 1.0
75 571 1.0
75 817 1.0
75 796 1.0
75 220 1.0
75 686 1.0
75 919 1.0
76 445 1.0
76 390 1.0
76 403 1.0
76 725 1.0
76 204 1.0
76 95 1.0
76 196 1.0
76 463 1.0
76 887 1.0
76 80 1.0
76 921 1.0
76 345 1.0
76 85 1.0
76 227 1.0
76 371 1.0
76 460 1.0
76 939 1.0
76 131 1.0
76 541 1.0
76 685 1.0
76 829 1.0
76 287 1.0
76 321 1.0
76 918 1.0
76 931 1.0
76 923 1.0
76 724 1.0
76 292 1.0
76 415 1.0
76 504 1.0
76 826 1.0
76 936 1.0
76 263 1.0
76 331 1.0
76 187 1.0
76 797 1.0
76 645 1.0
76 768 1.0
76 857 1.0
76 658 1.0
76 980 1.0
76 349 1.0
76 150 1.0
76 383 1.0
76 130 1.0
76 417 1.0
76 718 1.0
76 697 1.0
76 765 1.0
76 710 1.0
76 592 1.0
76 283 1.0
76 98 1.0
76 111 1.0
76 254 1.0
76 665 1.0
76 466 1.0
77 191 1.0
77 369 1.0
77 424 1.0
77 712 1.0
77 793 1.0
77 586 1.0
77 298 1.0
77 667 1.0
77 93 1.0
77 646 1.0
77 900 1.0
77 913 1.0
77 536 1.0
77 625 1.0
77 659 1.0
77 604 1.0
77 473 1.0
77 274 1.0
77 706 1.0
77 575 1.0
77 82 1.0
77 115 1.0
77 237 1.0
77 415 1.0
77 771 1.0
77 373 1.0
77 517 1.0
77 742 1.0
77 112 1.0
77 192 1.0
77 925 1.0
77 150 1.0
77 383 1.0
77 273 1.0
77 972 1.0
77 320 1.0
77 443 1.0
77 244 1.0
77 333 1.0
77 778 1.0
77 346 1.0
77 490 1.0
77 901 1.0
77 558 1.0
77 791 1.0
77 571 1.0
77 173 1.0
77 495 1.0
77 550 1.0
77 783 1.0
77 940 1.0
77 610 1.0
78 267 1.0
78 191 1.0
78 369 1.0
78 492 1.0
78 725 1.0
78 149 1.0
78 827 1.0
78 484 1.0
78 573 1.0
78 984 1.0
78 463 1.0
78 840 1.0
78 730 1.0
78 675 1.0
78 942 1.0
78 222 1.0
78 633 1.0
78 290 1.0
78 447 1.0
78 528 1.0
78 329 1.0
78 274 1.0
78 507 1.0
78 740 1.0
78 609 1.0
78 999 1.0
78 313 1.0
78 525 1.0
78 271 1.0
78 216 1.0
78 107 1.0
78 339 1.0
78 386 1.0
78 242 1.0
78 619 1.0
78 454 1.0
78 357 1.0
78 514 1.0
78 836 1.0
78 726 1.0
78 671 1.0
78 341 1.0
78 718 1.0
78 807 1.0
78 89 1.0
78 566 1.0
78 744 1.0
78 168 1.0
78 812 1.0
78 325 1.0
78 537 1.0
78 715 1.0
78 495 1.0
78 639 1.0
78 961 1.0
78 364 1.0
78 199 1.0
79 162 1.0
79 539 1.0
79 984 1.0
79 675 1.0
79 837 1.0
79 528 1.0
79 473 1.0
79 761 1.0
79 431 1.0
79 520 1.0
79 355 1.0
79 855 1.0
79 224 1.0
79 724 1.0
79 216 1.0
79 648 1.0
79 873 1.0
79 818 1.0
79 133 1.0
79 577 1.0
79 582 1.0
79 519 1.0
79 89 1.0
79 608 1.0
79 896 1.0
79 634 1.0
79 537 1.0
79 749 1.0
79 728 1.0
79 597 1.0
79 254 1.0
79 411 1.0
79 610 1.0
79 157 1.0
79 83 1.0
79 492 1.0
79 691 1.0
80 191 1.0
80 246 1.0
80 116 1.0
80 437 1.0
80 801 1.0
80 450 1.0
80 539 1.0
80 230 1.0
80 353 1.0
80 476 1.0
80 277 1.0
80 832 1.0
80 848 1.0
80 921 1.0
80 329 1.0
80 939 1.0
80 486 1.0
80 999 1.0
80 82 1.0
80 546 1.0
80 580 1.0
80 792 1.0
80 339 1.0
80 428 1.0
80 805 1.0
80 166 1.0
80 624 1.0
80 616 1.0
80 739 1.0
80 142 1.0
80 163 1.0
80 341 1.0
80 422 1.0
80 430 1.0
80 477 1.0
80 553 1.0
80 503 1.0
80 579 1.0
80 901 1.0
80 372 1.0
80 119 1.0
80 618 1.0
80 132 1.0
80 943 1.0
80 322 1.0
81 314 1.0
81 848 1.0
81 327 1.0
81 319 1.0
81 853 1.0
81 688 1.0
81 900 1.0
81 206 1.0
81 164 1.0
81 753 1.0
81 300 1.0
81 847 1.0
81 750 1.0
81 640 1.0
81 297 1.0
81 475 1.0
81 674 1.0
81 747 1.0
81 84 1.0
81 239 1.0
81 650 1.0
81 109 1.0
81 286 1.0
81 765 1.0
81 101 1.0
81 545 1.0
81 236 1.0
81 503 1.0
81 849 1.0
81 982 1.0
81 111 1.0
81 343 1.0
81 610 1.0
81 953 1.0
81 712 1.0
82 445 1.0
82 136 1.0
82 581 1.0
82 890 1.0
82 505 1.0
82 594 1.0
82 971 1.0
82 667 1.0
82 832 1.0
82 105 1.0
82 562 1.0
82 397 1.0
82 719 1.0
82 211 1.0
82 533 1.0
82 889 1.0
82 224 1.0
82 580 1.0
82 873 1.0
82 187 1.0
82 310 1.0
82 988 1.0
82 336 1.0
82 459 1.0
82 658 1.0
82 705 1.0
82 218 1.0
82 273 1.0
82 142 1.0
82 891 1.0
82 354 1.0
82 189 1.0
82 477 1.0
82 812 1.0
82 846 1.0
82 516 1.0
82 741 1.0
82 453 1.0
82 686 1.0
83 217 1.0
83 353 1.0
83 798 1.0
83 900 1.0
83 994 1.0
83 541 1.0
83 342 1.0
83 685 1.0
83 732 1.0
83 478 1.0
83 711 1.0
83 601 1.0
83 525 1.0
83 237 1.0
83 580 1.0
83 161 1.0
83 724 1.0
83 87 1.0
83 674 1.0
83 420 1.0
83 598 1.0
83 729 1.0
83 766 1.0
83 774 1.0
83 514 1.0
83 805 1.0
83 493 1.0
83 954 1.0
83 595 1.0
83 430 1.0
83 231 1.0
83 731 1.0
83 101 1.0
83 168 1.0
83 291 1.0
83 325 1.0
83 901 1.0
83 660 1.0
83 859 1.0
83 639 1.0
83 741 1.0
83 91 1.0
83 178 1.0
83 555 1.0
83 136 1.0
84 534 1.0
84 911 1.0
84 568 1.0
84 280 1.0
84 492 1.0
84 450 1.0
84 861 1.0
84 374 1.0
84 264 1.0
84 345 1.0
84 426 1.0
84 659 1.0
84 507 1.0
84 219 1.0
84 952 1.0
84 931 1.0
84 677 1.0
84 991 1.0
84 792 1.0
84 648 1.0
84 716 1.0
84 839 1.0
84 378 1.0
84 836 1.0
84 171 1.0
84 493 1.0
84 726 1.0
84 849 1.0
84 938 1.0
84 642 1.0
84 676 1.0
84 710 1.0
84 456 1.0
84 579 1.0
84 668 1.0
84 778 1.0
84 181 1.0
84 558 1.0
84 537 1.0
84 372 1.0
84 86 1.0
84 173 1.0
84 317 1.0
84 495 1.0
84 652 1.0
84 597 1.0
84 775 1.0
84 872 1.0
84 919 1.0
85 157 1.0
85 801 1.0
85 136 1.0
85 513 1.0
85 327 1.0
85 937 1.0
85 895 1.0
85 586 1.0
85 908 1.0
85 243 1.0
85 421 1.0
85 777 1.0
85 612 1.0
85 591 1.0
85 248 1.0
85 761 1.0
85 562 1.0
85 143 1.0
85 287 1.0
85 643 1.0
85 124 1.0
85 588 1.0
85 931 1.0
85 999 1.0
85 690 1.0
85 546 1.0
85 292 1.0
85 669 1.0
85 415 1.0
85 792 1.0
85 970 1.0
85 305 1.0
85 661 1.0
85 585 1.0
85 323 1.0
85 624 1.0
85 692 1.0
85 150 1.0
85 739 1.0
85 629 1.0
85 89 1.0
85 176 1.0
85 464 1.0
85 299 1.0
85 101 1.0
85 956 1.0
85 880 1.0
85 537 1.0
85 372 1.0
85 317 1.0
85 241 1.0
85 699 1.0
85 644 1.0
86 246 1.0
86 746 1.0
86 890 1.0
86 924 1.0
86 937 1.0
86 827 1.0
86 599 1.0
86 460 1.0
86 350 1.0
86 164 1.0
86 829 1.0
86 753 1.0
86 897 1.0
86 677 1.0
86 279 1.0
86 415 1.0
86 894 1.0
86 263 1.0
86 585 1.0
86 420 1.0
86 166 1.0
86 729 1.0
86 234 1.0
86 865 1.0
86 281 1.0
86 226 1.0
86 514 1.0
86 891 1.0
86 917 1.0
86 375 1.0
86 786 1.0
86 807 1.0
86 477 1.0
86 959 1.0
86 401 1.0
86 673 1.0
86 631 1.0
86 987 1.0
87 814 1.0
87 95 1.0
87 306 1.0
87 882 1.0
87 971 1.0
87 510 1.0
87 976 1.0
87 735 1.0
87 405 1.0
87 384 1.0
87 638 1.0
87 164 1.0
87 693 1.0
87 876 1.0
87 292 1.0
87 347 1.0
87 792 1.0
87 331 1.0
87 420 1.0
87 509 1.0
87 247 1.0
87 336 1.0
87 315 1.0
87 294 1.0
87 493 1.0
87 548 1.0
87 815 1.0
87 286 1.0
87 925 1.0
87 532 1.0
87 634 1.0
87 427 1.0
87 406 1.0
87 144 1.0
87 178 1.0
87 966 1.0
88 212 1.0
88 437 1.0
88 992 1.0
88 505 1.0
88 450 1.0
88 683 1.0
88 484 1.0
88 285 1.0
88 628 1.0
88 738 1.0
88 122 1.0
88 154 1.0
88 243 1.0
88 586 1.0
88 146 1.0
88 235 1.0
88 468 1.0
88 502 1.0
88 481 1.0
88 892 1.0
88 371 1.0
88 604 1.0
88 926 1.0
88 761 1.0
88 973 1.0
88 253 1.0
88 863 1.0
88 143 1.0
88 90 1.0
88 266 1.0
88 124 1.0
88 978 1.0
88 614 1.0
88 991 1.0
88 771 1.0
88 873 1.0
88 352 1.0
88 996 1.0
88 598 1.0
88 234 1.0
88 412 1.0
88 768 1.0
88 802 1.0
88 658 1.0
88 857 1.0
88 404 1.0
88 561 1.0
88 273 1.0
88 938 1.0
88 299 1.0
88 388 1.0
88 333 1.0
88 257 1.0
88 867 1.0
88 181 1.0
88 503 1.0
88 106 1.0
88 194 1.0
88 783 1.0
88 207 1.0
88 254 1.0
88 898 1.0
89 445 1.0
89 246 1.0
89 280 1.0
89 589 1.0
89 437 1.0
89 971 1.0
89 573 1.0
89 141 1.0
89 565 1.0
89 599 1.0
89 832 1.0
89 845 1.0
89 494 1.0
89 994 1.0
89 541 1.0
89 512 1.0
89 525 1.0
89 394 1.0
89 229 1.0
89 174 1.0
89 208 1.0
89 441 1.0
89 648 1.0
89 611 1.0
89 179 1.0
89 158 1.0
89 868 1.0
89 915 1.0
89 671 1.0
89 815 1.0
89 409 1.0
89 299 1.0
89 312 1.0
89 393 1.0
89 482 1.0
89 592 1.0
89 605 1.0
89 804 1.0
89 597 1.0
90 822 1.0
90 246 1.0
90 390 1.0
90 513 1.0
90 827 1.0
90 628 1.0
90 662 1.0
90 717 1.0
90 387 1.0
90 256 1.0
90 345 1.0
90 146 1.0
90 523 1.0
90 866 1.0
90 303 1.0
90 858 1.0
90 494 1.0
90 685 1.0
90 253 1.0
90 664 1.0
90 334 1.0
90 889 1.0
90 580 1.0
90 902 1.0
90 305 1.0
90 784 1.0
90 975 1.0
90 234 1.0
90 268 1.0
90 946 1.0
90 891 1.0
90 781 1.0
90 493 1.0
90 438 1.0
90 383 1.0
90 705 1.0
90 642 1.0
90 875 1.0
90 155 1.0
90 244 1.0
90 545 1.0
90 579 1.0
90 778 1.0
90 558 1.0
90 270 1.0
90 791 1.0
90 935 1.0
90 817 1.0
90 809 1.0
91 850 1.0
91 342 1.0
91 719 1.0
91 115 1.0
91 813 1.0
91 271 1.0
91 860 1.0
91 805 1.0
91 868 1.0
91 352 1.0
91 166 1.0
91 611 1.0
91 412 1.0
91 302 1.0
91 988 1.0
91 349 1.0
91 438 1.0
91 985 1.0
91 498 1.0
91 676 1.0
91 778 1.0
91 291 1.0
91 160 1.0
91 393 1.0
91 694 1.0
91 639 1.0
91 398 1.0
91 754 1.0
91 212 1.0
91 458 1.0
91 149 1.0
91 293 1.0
91 217 1.0
91 395 1.0
91 374 1.0
91 484 1.0
91 560 1.0
91 599 1.0
91 869 1.0
92 746 1.0
92 293 1.0
92 95 1.0
92 327 1.0
92 835 1.0
92 497 1.0
92 332 1.0
92 523 1.0
92 722 1.0
92 989 1.0
92 905 1.0
92 596 1.0
92 342 1.0
92 664 1.0
92 842 1.0
92 423 1.0
92 957 1.0
92 661 1.0
92 873 1.0
92 187 1.0
92 166 1.0
92 797 1.0
92 700 1.0
92 412 1.0
92 595 1.0
92 807 1.0
92 731 1.0
92 621 1.0
92 291 1.0
92 969 1.0
92 605 1.0
92 838 1.0
92 98 1.0
92 762 1.0
92 686 1.0
92 343 1.0
92 521 1.0
92 500 1.0
93 911 1.0
93 95 1.0
93 306 1.0
93 340 1.0
93 248 1.0
93 105 1.0
93 426 1.0
93 803 1.0
93 494 1.0
93 507 1.0
93 397 1.0
93 808 1.0
93 156 1.0
93 245 1.0
93 190 1.0
93 389 1.0
93 999 1.0
93 779 1.0
93 347 1.0
93 237 1.0
93 271 1.0
93 441 1.0
93 386 1.0
93 242 1.0
93 564 1.0
93 302 1.0
93 247 1.0
93 336 1.0
93 603 1.0
93 349 1.0
93 870 1.0
93 883 1.0
93 485 1.0
93 430 1.0
93 519 1.0
93 320 1.0
93 464 1.0
93 210 1.0
93 155 1.0
93 354 1.0
93 189 1.0
93 346 1.0
93 723 1.0
93 969 1.0
93 194 1.0
93 372 1.0
93 749 1.0
93 906 1.0
93 974 1.0
93 686 1.0
93 953 1.0
93 754 1.0
94 413 1.0
94 358 1.0
94 913 1.0
94 981 1.0
94 944 1.0
94 271 1.0
94 394 1.0
94 504 1.0
94 121 1.0
94 559 1.0
94 572 1.0
94 543 1.0
94 687 1.0
94 763 1.0
94 865 1.0
94 247 1.0
94 446 1.0
94 171 1.0
94 226 1.0
94 663 1.0
94 464 1.0
94 532 1.0
94 854 1.0
94 998 1.0
94 757 1.0
94 592 1.0
94 859 1.0
94 694 1.0
94 207 1.0
94 132 1.0
94 364 1.0
94 398 1.0
94 665 1.0
94 796 1.0
94 390 1.0
94 746 1.0
94 636 1.0
94 670 1.0
94 704 1.0
94 759 1.0
94 916 1.0
94 552 1.0
94 209 1.0
94 497 1.0
94 531 1.0
94 641 1.0
95 479 1.0
95 103 1.0
95 424 1.0
95 704 1.0
95 738 1.0
95 306 1.0
95 108 1.0
95 196 1.0
95 141 1.0
95 374 1.0
95 395 1.0
95 442 1.0
95 675 1.0
95 159 1.0
95 803 1.0
95 892 1.0
95 97 1.0
95 918 1.0
95 698 1.0
95 190 1.0
95 711 1.0
95 690 1.0
95 635 1.0
95 813 1.0
95 381 1.0
95 129 1.0
95 593 1.0
95 394 1.0
95 318 1.0
95 975 1.0
95 378 1.0
95 611 1.0
95 734 1.0
95 535 1.0
95 823 1.0
95 569 1.0
95 692 1.0
95 438 1.0
95 616 1.0
95 595 1.0
95 621 1.0
95 380 1.0
95 448 1.0
95 482 1.0
95 872 1.0
95 207 1.0
95 330 1.0
95 851 1.0
95 288 1.0
96 856 1.0
96 136 1.0
96 369 1.0
96 924 1.0
96 581 1.0
96 670 1.0
96 272 1.0
96 416 1.0
96 319 1.0
96 586 1.0
96 976 1.0
96 544 1.0
96 811 1.0
96 646 1.0
96 769 1.0
96 350 1.0
96 871 1.0
96 97 1.0
96 808 1.0
96 753 1.0
96 321 1.0
96 177 1.0
96 355 1.0
96 842 1.0
96 190 1.0
96 580 1.0
96 129 1.0
96 648 1.0
96 737 1.0
96 572 1.0
96 860 1.0
96 187 1.0
96 742 1.0
96 543 1.0
96 886 1.0
96 467 1.0
96 611 1.0
96 501 1.0
96 933 1.0
96 802 1.0
96 548 1.0
96 637 1.0
96 438 1.0
96 760 1.0
96 273 1.0
96 595 1.0
96 286 1.0
96 608 1.0
96 663 1.0
96 566 1.0
96 791 1.0
96 215 1.0
96 647 1.0
96 516 1.0
96 770 1.0
96 872 1.0
96 529 1.0
96 597 1.0
96 111 1.0
96 720 1.0
96 809 1.0
96 953 1.0
97 607 1.0
97 167 1.0
97 688 1.0
97 481 1.0
97 426 1.0
97 947 1.0
97 473 1.0
97 562 1.0
97 651 1.0
97 258 1.0
97 580 1.0
97 271 1.0
97 593 1.0
97 661 1.0
97 826 1.0
97 187 1.0
97 920 1.0
97 941 1.0
97 234 1.0
97 700 1.0
97 548 1.0
97 383 1.0
97 307 1.0
97 142 1.0
97 265 1.0
97 451 1.0
97 388 1.0
97 506 1.0
97 917 1.0
97 194 1.0
97 119 1.0
97 495 1.0
97 673 1.0
97 707 1.0
97 466 1.0
97 728 1.0
97 796 1.0
97 843 1.0
97 958 1.0
97 149 1.0
97 966 1.0
98 212 1.0
98 856 1.0
98 335 1.0
98 424 1.0
98 848 1.0
98 649 1.0
98 683 1.0
98 484 1.0
98 285 1.0
98 861 1.0
98 840 1.0
98 408 1.0
98 984 1.0
98 832 1.0
98 955 1.0
98 659 1.0
98 685 1.0
98 143 1.0
98 368 1.0
98 868 1.0
98 381 1.0
98 271 1.0
98 970 1.0
98 991 1.0
98 187 1.0
98 653 1.0
98 289 1.0
98 378 1.0
98 556 1.0
98 700 1.0
98 226 1.0
98 637 1.0
98 205 1.0
98 150 1.0
98 472 1.0
98 807 1.0
98 498 1.0
98 757 1.0
98 681 1.0
98 825 1.0
98 605 1.0
98 351 1.0
98 584 1.0
98 762 1.0
98 419 1.0
99 712 1.0
99 958 1.0
99 196 1.0
99 984 1.0
99 209 1.0
99 942 1.0
99 400 1.0
99 113 1.0
99 900 1.0
99 955 1.0
99 193 1.0
99 282 1.0
99 118 1.0
99 206 1.0
99 761 1.0
99 651 1.0
99 740 1.0
99 355 1.0
99 766 1.0
99 800 1.0
99 656 1.0
99 224 1.0
99 834 1.0
99 957 1.0
99 648 1.0
99 970 1.0
99 771 1.0
99 229 1.0
99 318 1.0
99 462 1.0
99 208 1.0
99 750 1.0
99 522 1.0
99 611 1.0
99 755 1.0
99 878 1.0
99 679 1.0
99 425 1.0
99 671 1.0
99 130 1.0
99 396 1.0
99 862 1.0
99 922 1.0
99 537 1.0
99 584 1.0
99 673 1.0
99 330 1.0
99 741 1.0
99 542 1.0
99 610 1.0
99 411 1.0
100 890 1.0
100 793 1.0
100 484 1.0
100 662 1.0
100 141 1.0
100 840 1.0
100 209 1.0
100 997 1.0
100 277 1.0
100 400 1.0
100 866 1.0
100 646 1.0
100 968 1.0
100 303 1.0
100 138 1.0
100 316 1.0
100 308 1.0
100 376 1.0
100 766 1.0
100 334 1.0
100 978 1.0
100 436 1.0
100 847 1.0
100 559 1.0
100 902 1.0
100 936 1.0
100 860 1.0
100 140 1.0
100 949 1.0
100 121 1.0
100 263 1.0
100 763 1.0
100 187 1.0
100 145 1.0
100 899 1.0
100 514 1.0
100 671 1.0
100 705 1.0
100 532 1.0
100 799 1.0
100 634 1.0
100 346 1.0
100 956 1.0
100 128 1.0
100 448 1.0
100 770 1.0
100 825 1.0
100 893 1.0
100 762 1.0
100 132 1.0
100 508 1.0
101 589 1.0
101 103 1.0
101 636 1.0
101 772 1.0
101 408 1.0
101 557 1.0
101 515 1.0
101 714 1.0
101 913 1.0
101 740 1.0
101 968 1.0
101 266 1.0
101 334 1.0
101 546 1.0
101 813 1.0
101 415 1.0
101 771 1.0
101 195 1.0
101 522 1.0
101 899 1.0
101 679 1.0
101 891 1.0
101 820 1.0
101 333 1.0
101 723 1.0
101 880 1.0
101 482 1.0
101 927 1.0
101 119 1.0
101 207 1.0
101 241 1.0
101 639 1.0
102 835 1.0
102 547 1.0
102 649 1.0
102 594 1.0
102 518 1.0
102 497 1.0
102 476 1.0
102 654 1.0
102 222 1.0
102 489 1.0
102 730 1.0
102 735 1.0
102 371 1.0
102 751 1.0
102 769 1.0
102 931 1.0
102 266 1.0
102 622 1.0
102 779 1.0
102 292 1.0
102 347 1.0
102 737 1.0
102 250 1.0
102 975 1.0
102 323 1.0
102 645 1.0
102 734 1.0
102 582 1.0
102 239 1.0
102 815 1.0
102 163 1.0
102 862 1.0
102 231 1.0
102 917 1.0
102 393 1.0
102 106 1.0
102 749 1.0
102 351 1.0
102 817 1.0
102 419 1.0
102 288 1.0
103 945 1.0
103 924 1.0
103 361 1.0
103 840 1.0
103 654 1.0
103 468 1.0
103 324 1.0
103 968 1.0
103 447 1.0
103 371 1.0
103 316 1.0
103 329 1.0
103 952 1.0
103 986 1.0
103 499 1.0
103 766 1.0
103 525 1.0
103 470 1.0
103 504 1.0
103 771 1.0
103 462 1.0
103 386 1.0
103 433 1.0
103 899 1.0
103 268 1.0
103 104 1.0
103 281 1.0
103 226 1.0
103 692 1.0
103 870 1.0
103 205 1.0
103 946 1.0
103 278 1.0
103 202 1.0
103 579 1.0
103 757 1.0
103 901 1.0
103 647 1.0
103 770 1.0
103 571 1.0
103 461 1.0
103 119 1.0
103 351 1.0
103 639 1.0
103 995 1.0
103 275 1.0
103 974 1.0
103 254 1.0
104 678 1.0
104 835 1.0
104 170 1.0
104 314 1.0
104 937 1.0
104 416 1.0
104 167 1.0
104 845 1.0
104 337 1.0
104 515 1.0
104 206 1.0
104 198 1.0
104 719 1.0
104 499 1.0
104 677 1.0
104 910 1.0
104 965 1.0
104 745 1.0
104 174 1.0
104 318 1.0
104 585 1.0
104 399 1.0
104 789 1.0
104 302 1.0
104 459 1.0
104 349 1.0
104 616 1.0
104 849 1.0
104 362 1.0
104 307 1.0
104 231 1.0
104 553 1.0
104 354 1.0
104 943 1.0
104 223 1.0
104 312 1.0
104 689 1.0
104 304 1.0
104 448 1.0
104 715 1.0
104 351 1.0
104 618 1.0
104 885 1.0
104 254 1.0
105 335 1.0
105 280 1.0
105 568 1.0
105 116 1.0
105 471 1.0
105 285 1.0
105 175 1.0
105 840 1.0
105 874 1.0
105 675 1.0
105 565 1.0
105 277 1.0
105 921 1.0
105 612 1.0
105 892 1.0
105 604 1.0
105 926 1.0
105 638 1.0
105 439 1.0
105 274 1.0
105 110 1.0
105 397 1.0
105 266 1.0
105 211 1.0
105 245 1.0
105 957 1.0
105 525 1.0
105 847 1.0
105 648 1.0
105 174 1.0
105 695 1.0
105 844 1.0
105 412 1.0
105 370 1.0
105 726 1.0
105 150 1.0
105 328 1.0
105 396 1.0
105 752 1.0
105 176 1.0
105 123 1.0
105 964 1.0
105 189 1.0
105 134 1.0
105 456 1.0
105 998 1.0
105 956 1.0
105 702 1.0
105 128 1.0
105 770 1.0
105 516 1.0
105 372 1.0
105 173 1.0
105 461 1.0
105 152 1.0
105 419 1.0
105 165 1.0
106 136 1.0
106 225 1.0
106 958 1.0
106 738 1.0
106 573 1.0
106 497 1.0
106 594 1.0
106 607 1.0
106 290 1.0
106 646 1.0
106 447 1.0
106 701 1.0
106 282 1.0
106 515 1.0
106 604 1.0
106 638 1.0
106 790 1.0
106 840 1.0
106 287 1.0
106 266 1.0
106 745 1.0
106 457 1.0
106 525 1.0
106 635 1.0
106 787 1.0
106 847 1.0
106 858 1.0
106 934 1.0
106 763 1.0
106 992 1.0
106 687 1.0
106 721 1.0
106 467 1.0
106 700 1.0
106 755 1.0
106 658 1.0
106 451 1.0
106 935 1.0
106 914 1.0
106 283 1.0
106 440 1.0
106 111 1.0
106 487 1.0
106 843 1.0
106 911 1.0
107 534 1.0
107 568 1.0
107 602 1.0
107 403 1.0
107 712 1.0
107 539 1.0
107 285 1.0
107 531 1.0
107 277 1.0
107 167 1.0
107 113 1.0
107 646 1.0
107 879 1.0
107 913 1.0
107 515 1.0
107 494 1.0
107 761 1.0
107 782 1.0
107 892 1.0
107 955 1.0
107 444 1.0
107 711 1.0
107 169 1.0
107 115 1.0
107 546 1.0
107 991 1.0
107 161 1.0
107 538 1.0
107 999 1.0
107 818 1.0
107 886 1.0
107 126 1.0
107 713 1.0
107 637 1.0
107 184 1.0
107 383 1.0
107 142 1.0
107 163 1.0
107 197 1.0
107 307 1.0
107 485 1.0
107 579 1.0
107 828 1.0
107 854 1.0
107 964 1.0
107 906 1.0
107 309 1.0
108 958 1.0
108 793 1.0
108 594 1.0
108 607 1.0
108 209 1.0
108 298 1.0
108 819 1.0
108 421 1.0
108 963 1.0
108 400 1.0
108 489 1.0
108 989 1.0
108 803 1.0
108 981 1.0
108 596 1.0
108 465 1.0
108 965 1.0
108 334 1.0
108 758 1.0
108 847 1.0
108 449 1.0
108 682 1.0
108 195 1.0
108 140 1.0
108 229 1.0
108 873 1.0
108 441 1.0
108 674 1.0
108 894 1.0
108 598 1.0
108 112 1.0
108 522 1.0
108 721 1.0
108 899 1.0
108 878 1.0
108 158 1.0
108 980 1.0
108 925 1.0
108 438 1.0
108 239 1.0
108 130 1.0
108 773 1.0
108 519 1.0
108 697 1.0
108 490 1.0
108 325 1.0
108 448 1.0
108 838 1.0
108 406 1.0
108 982 1.0
108 817 1.0
108 618 1.0
108 707 1.0
108 953 1.0
109 348 1.0
109 238 1.0
109 395 1.0
109 403 1.0
109 230 1.0
109 615 1.0
109 670 1.0
109 510 1.0
109 704 1.0
109 738 1.0
109 780 1.0
109 950 1.0
109 392 1.0
109 138 1.0
109 118 1.0
109 997 1.0
109 452 1.0
109 719 1.0
109 863 1.0
109 115 1.0
109 716 1.0
109 140 1.0
109 174 1.0
109 530 1.0
109 920 1.0
109 954 1.0
109 412 1.0
109 768 1.0
109 137 1.0
109 336 1.0
109 294 1.0
109 493 1.0
109 658 1.0
109 993 1.0
109 142 1.0
109 265 1.0
109 477 1.0
109 134 1.0
109 147 1.0
109 304 1.0
109 119 1.0
109 241 1.0
109 584 1.0
109 631 1.0
109 644 1.0
109 911 1.0
110 552 1.0
110 641 1.0
110 709 1.0
110 366 1.0
110 976 1.0
110 735 1.0
110 159 1.0
110 892 1.0
110 520 1.0
110 635 1.0
110 669 1.0
110 148 1.0
110 216 1.0
110 614 1.0
110 847 1.0
110 475 1.0
110 412 1.0
110 734 1.0
110 713 1.0
110 315 1.0
110 260 1.0
110 917 1.0
110 608 1.0
110 896 1.0
110 443 1.0
110 388 1.0
110 689 1.0
110 710 1.0
110 147 1.0
110 922 1.0
110 448 1.0
110 427 1.0
110 715 1.0
110 673 1.0
110 474 1.0
110 132 1.0
110 631 1.0
110 377 1.0
110 665 1.0
110 686 1.0
110 856 1.0
110 864 1.0
110 964 1.0
110 982 1.0
110 793 1.0
111 235 1.0
111 646 1.0
111 439 1.0
111 185 1.0
111 588 1.0
111 999 1.0
111 279 1.0
111 601 1.0
111 415 1.0
111 860 1.0
111 695 1.0
111 467 1.0
111 734 1.0
111 802 1.0
111 671 1.0
111 739 1.0
111 244 1.0
111 168 1.0
111 600 1.0
111 414 1.0
111 393 1.0
111 461 1.0
111 584 1.0
111 613 1.0
111 694 1.0
111 542 1.0
111 744 1.0
111 610 1.0
111 568 1.0
111 843 1.0
111 314 1.0
111 670 1.0
111 846 1.0
111 901 1.0
111 906 1.0
111 914 1.0
111 919 1.0
111 853 1.0
111 998 1.0
111 633 1.0
112 314 1.0
112 958 1.0
112 327 1.0
112 196 1.0
112 395 1.0
112 416 1.0
112 565 1.0
112 222 1.0
112 311 1.0
112 557 1.0
112 683 1.0
112 392 1.0
112 824 1.0
112 118 1.0
112 261 1.0
112 308 1.0
112 321 1.0
112 693 1.0
112 840 1.0
112 800 1.0
112 908 1.0
112 916 1.0
112 826 1.0
112 140 1.0
112 551 1.0
112 187 1.0
112 310 1.0
112 399 1.0
112 920 1.0
112 941 1.0
112 954 1.0
112 836 1.0
112 705 1.0
112 485 1.0
112 752 1.0
112 422 1.0
112 278 1.0
112 812 1.0
112 736 1.0
112 215 1.0
112 838 1.0
112 453 1.0
113 895 1.0
113 976 1.0
113 146 1.0
113 557 1.0
113 604 1.0
113 803 1.0
113 219 1.0
113 575 1.0
113 596 1.0
113 609 1.0
113 643 1.0
113 745 1.0
113 546 1.0
113 347 1.0
113 148 1.0
113 601 1.0
113 648 1.0
113 787 1.0
113 352 1.0
113 454 1.0
113 255 1.0
113 687 1.0
113 810 1.0
113 842 1.0
113 949 1.0
113 952 1.0
113 705 1.0
113 130 1.0
113 718 1.0
113 608 1.0
113 849 1.0
113 613 1.0
113 359 1.0
113 448 1.0
113 207 1.0
113 275 1.0
113 686 1.0
113 199 1.0
113 267 1.0
113 733 1.0
113 191 1.0
114 246 1.0
114 335 1.0
114 390 1.0
114 568 1.0
114 890 1.0
114 348 1.0
114 869 1.0
114 992 1.0
114 793 1.0
114 738 1.0
114 450 1.0
114 827 1.0
114 785 1.0
114 989 1.0
114 282 1.0
114 706 1.0
114 363 1.0
114 308 1.0
114 622 1.0
114 368 1.0
114 889 1.0
114 703 1.0
114 305 1.0
114 661 1.0
114 229 1.0
114 928 1.0
114 763 1.0
114 852 1.0
114 886 1.0
114 509 1.0
114 755 1.0
114 946 1.0
114 781 1.0
114 726 1.0
114 883 1.0
114 773 1.0
114 917 1.0
114 663 1.0
114 841 1.0
114 176 1.0
114 265 1.0
114 587 1.0
114 676 1.0
114 901 1.0
114 249 1.0
114 152 1.0
114 296 1.0
114 275 1.0
114 707 1.0
114 720 1.0
114 144 1.0
114 699 1.0
115 623 1.0
115 856 1.0
115 746 1.0
115 945 1.0
115 170 1.0
115 116 1.0
115 573 1.0
115 751 1.0
115 122 1.0
115 243 1.0
115 654 1.0
115 544 1.0
115 832 1.0
115 714 1.0
115 138 1.0
115 706 1.0
115 850 1.0
115 596 1.0
115 740 1.0
115 342 1.0
115 842 1.0
115 177 1.0
115 266 1.0
115 190 1.0
115 279 1.0
115 457 1.0
115 656 1.0
115 271 1.0
115 326 1.0
115 449 1.0
115 284 1.0
115 703 1.0
115 970 1.0
115 674 1.0
115 742 1.0
115 797 1.0
115 666 1.0
115 844 1.0
115 556 1.0
115 501 1.0
115 391 1.0
115 768 1.0
115 226 1.0
115 726 1.0
115 760 1.0
115 705 1.0
115 218 1.0
115 451 1.0
115 197 1.0
115 142 1.0
115 123 1.0
115 477 1.0
115 579 1.0
115 723 1.0
115 613 1.0
115 249 1.0
115 914 1.0
115 139 1.0
115 872 1.0
115 906 1.0
115 419 1.0
115 364 1.0
115 453 1.0
115 432 1.0
116 882 1.0
116 319 1.0
116 387 1.0
116 908 1.0
116 400 1.0
116 646 1.0
116 358 1.0
116 481 1.0
116 405 1.0
116 824 1.0
116 651 1.0
116 308 1.0
116 706 1.0
116 287 1.0
116 643 1.0
116 732 1.0
116 135 1.0
116 900 1.0
116 918 1.0
116 271 1.0
116 572 1.0
116 284 1.0
116 957 1.0
116 153 1.0
116 999 1.0
116 145 1.0
116 234 1.0
116 268 1.0
116 857 1.0
116 472 1.0
116 561 1.0
116 917 1.0
116 210 1.0
116 977 1.0
116 249 1.0
116 474 1.0
116 432 1.0
116 987 1.0
117 314 1.0
117 725 1.0
117 649 1.0
117 772 1.0
117 662 1.0
117 717 1.0
117 916 1.0
117 531 1.0
117 188 1.0
117 489 1.0
117 934 1.0
117 127 1.0
117 858 1.0
117 261 1.0
117 706 1.0
117 685 1.0
117 575 1.0
117 774 1.0
117 821 1.0
117 871 1.0
117 834 1.0
117 305 1.0
117 318 1.0
117 585 1.0
117 590 1.0
117 247 1.0
117 302 1.0
117 561 1.0
117 130 1.0
117 629 1.0
117 794 1.0
117 930 1.0
117 443 1.0
117 490 1.0
117 995 1.0
117 521 1.0
117 987 1.0
118 801 1.0
118 492 1.0
118 903 1.0
118 717 1.0
118 552 1.0
118 122 1.0
118 353 1.0
118 544 1.0
118 146 1.0
118 434 1.0
118 722 1.0
118 248 1.0
118 227 1.0
118 350 1.0
118 659 1.0
118 845 1.0
118 164 1.0
118 452 1.0
118 266 1.0
118 470 1.0
118 449 1.0
118 826 1.0
118 873 1.0
118 242 1.0
118 126 1.0
118 475 1.0
118 336 1.0
118 708 1.0
118 150 1.0
118 472 1.0
118 608 1.0
118 828 1.0
118 951 1.0
118 388 1.0
118 367 1.0
118 257 1.0
118 710 1.0
118 799 1.0
118 262 1.0
118 385 1.0
118 720 1.0
119 403 1.0
119 937 1.0
119 272 1.0
119 840 1.0
119 209 1.0
119 154 1.0
119 730 1.0
119 853 1.0
119 222 1.0
119 544 1.0
119 688 1.0
119 180 1.0
119 392 1.0
119 350 1.0
119 583 1.0
119 185 1.0
119 850 1.0
119 994 1.0
119 952 1.0
119 910 1.0
119 999 1.0
119 135 1.0
119 546 1.0
119 237 1.0
119 614 1.0
119 140 1.0
119 121 1.0
119 208 1.0
119 640 1.0
119 564 1.0
119 200 1.0
119 899 1.0
119 179 1.0
119 768 1.0
119 883 1.0
119 828 1.0
119 710 1.0
119 744 1.0
119 236 1.0
119 414 1.0
119 880 1.0
119 592 1.0
119 427 1.0
119 728 1.0
119 961 1.0
119 529 1.0
119 254 1.0
119 288 1.0
120 712 1.0
120 526 1.0
120 738 1.0
120 937 1.0
120 573 1.0
120 861 1.0
120 442 1.0
120 497 1.0
120 908 1.0
120 222 1.0
120 324 1.0
120 947 1.0
120 960 1.0
120 884 1.0
120 198 1.0
120 889 1.0
120 779 1.0
120 129 1.0
120 737 1.0
120 462 1.0
120 412 1.0
120 247 1.0
120 645 1.0
120 459 1.0
120 294 1.0
120 239 1.0
120 273 1.0
120 548 1.0
120 561 1.0
120 176 1.0
120 320 1.0
120 244 1.0
120 765 1.0
120 789 1.0
120 799 1.0
120 815 1.0
120 770 1.0
120 427 1.0
120 925 1.0
120 207 1.0
120 351 1.0
120 597 1.0
120 741 1.0
120 919 1.0
120 980 1.0
121 138 1.0
121 282 1.0
121 617 1.0
121 808 1.0
121 135 1.0
121 593 1.0
121 517 1.0
121 174 1.0
121 750 1.0
121 166 1.0
121 666 1.0
121 404 1.0
121 163 1.0
121 684 1.0
121 930 1.0
121 223 1.0
121 312 1.0
121 128 1.0
121 325 1.0
121 435 1.0
121 139 1.0
121 482 1.0
121 647 1.0
121 576 1.0
121 652 1.0
121 668 1.0
121 602 1.0
121 492 1.0
121 686 1.0
121 935 1.0
121 361 1.0
121 861 1.0
121 751 1.0
121 992 1.0
121 531 1.0
121 688 1.0
121 866 1.0
122 966 1.0
122 301 1.0
122 424 1.0
122 568 1.0
122 657 1.0
122 636 1.0
122 869 1.0
122 434 1.0
122 127 1.0
122 214 1.0
122 735 1.0
122 837 1.0
122 439 1.0
122 638 1.0
122 274 1.0
122 507 1.0
122 143 1.0
122 609 1.0
122 410 1.0
122 567 1.0
122 800 1.0
122 834 1.0
122 868 1.0
122 271 1.0
122 174 1.0
122 886 1.0
122 687 1.0
122 632 1.0
122 344 1.0
122 391 1.0
122 891 1.0
122 438 1.0
122 993 1.0
122 130 1.0
122 718 1.0
122 786 1.0
122 354 1.0
122 202 1.0
122 579 1.0
122 516 1.0
122 351 1.0
122 707 1.0
122 542 1.0
122 987 1.0
123 924 1.0
123 526 1.0
123 345 1.0
123 523 1.0
123 358 1.0
123 392 1.0
123 604 1.0
123 151 1.0
123 625 1.0
123 892 1.0
123 143 1.0
123 664 1.0
123 808 1.0
123 952 1.0
123 203 1.0
123 491 1.0
123 394 1.0
123 525 1.0
123 208 1.0
123 551 1.0
123 674 1.0
123 488 1.0
123 145 1.0
123 645 1.0
123 857 1.0
123 949 1.0
123 150 1.0
123 197 1.0
123 278 1.0
123 168 1.0
123 257 1.0
123 249 1.0
123 270 1.0
123 338 1.0
123 867 1.0
123 872 1.0
123 398 1.0
123 411 1.0
124 125 1.0
124 212 1.0
124 157 1.0
124 445 1.0
124 890 1.0
124 759 1.0
124 937 1.0
124 340 1.0
124 607 1.0
124 175 1.0
124 264 1.0
124 332 1.0
124 489 1.0
124 722 1.0
124 468 1.0
124 782 1.0
124 850 1.0
124 452 1.0
124 164 1.0
124 397 1.0
124 342 1.0
124 287 1.0
124 232 1.0
124 829 1.0
124 821 1.0
124 258 1.0
124 758 1.0
124 449 1.0
124 394 1.0
124 263 1.0
124 632 1.0
124 755 1.0
124 967 1.0
124 302 1.0
124 446 1.0
124 747 1.0
124 917 1.0
124 807 1.0
124 519 1.0
124 875 1.0
124 210 1.0
124 587 1.0
124 223 1.0
124 579 1.0
124 791 1.0
124 880 1.0
124 215 1.0
124 160 1.0
124 948 1.0
124 406 1.0
124 440 1.0
124 132 1.0
124 953 1.0
125 822 1.0
125 670 1.0
125 285 1.0
125 463 1.0
125 484 1.0
125 913 1.0
125 248 1.0
125 748 1.0
125 761 1.0
125 855 1.0
125 876 1.0
125 402 1.0
125 517 1.0
125 873 1.0
125 352 1.0
125 276 1.0
125 420 1.0
125 467 1.0
125 878 1.0
125 747 1.0
125 739 1.0
125 642 1.0
125 443 1.0
125 367 1.0
125 647 1.0
125 160 1.0
125 804 1.0
125 749 1.0
125 872 1.0
125 385 1.0
125 576 1.0
126 306 1.0
126 319 1.0
126 450 1.0
126 942 1.0
126 413 1.0
126 761 1.0
126 816 1.0
126 541 1.0
126 664 1.0
126 685 1.0
126 766 1.0
126 512 1.0
126 999 1.0
126 436 1.0
126 237 1.0
126 758 1.0
126 957 1.0
126 352 1.0
126 187 1.0
126 221 1.0
126 420 1.0
126 522 1.0
126 818 1.0
126 247 1.0
126 679 1.0
126 768 1.0
126 938 1.0
126 218 1.0
126 252 1.0
126 430 1.0
126 959 1.0
126 621 1.0
126 744 1.0
126 414 1.0
126 647 1.0
126 194 1.0
126 152 1.0
126 296 1.0
126 233 1.0
126 322 1.0
126 246 1.0
126 424 1.0
126 581 1.0
126 869 1.0
127 267 1.0
127 500 1.0
127 657 1.0
127 636 1.0
127 814 1.0
127 539 1.0
127 628 1.0
127 188 1.0
127 968 1.0
127 625 1.0
127 570 1.0
127 714 1.0
127 507 1.0
127 164 1.0
127 842 1.0
127 355 1.0
127 533 1.0
127 622 1.0
127 190 1.0
127 334 1.0
127 800 1.0
127 834 1.0
127 944 1.0
127 525 1.0
127 237 1.0
127 559 1.0
127 847 1.0
127 234 1.0
127 611 1.0
127 912 1.0
127 768 1.0
127 336 1.0
127 480 1.0
127 370 1.0
127 710 1.0
127 202 1.0
127 435 1.0
127 613 1.0
127 702 1.0
127 812 1.0
127 139 1.0
127 461 1.0
127 605 1.0
127 639 1.0
127 817 1.0
127 254 1.0
128 301 1.0
128 822 1.0
128 869 1.0
128 526 1.0
128 141 1.0
128 256 1.0
128 455 1.0
128 633 1.0
128 515 1.0
128 151 1.0
128 528 1.0
128 452 1.0
128 549 1.0
128 811 1.0
128 821 1.0
128 829 1.0
128 845 1.0
128 614 1.0
128 682 1.0
128 737 1.0
128 428 1.0
128 263 1.0
128 564 1.0
128 606 1.0
128 653 1.0
128 755 1.0
128 747 1.0
128 438 1.0
128 637 1.0
128 870 1.0
128 684 1.0
128 498 1.0
128 346 1.0
128 490 1.0
128 181 1.0
128 262 1.0
128 885 1.0
129 356 1.0
129 500 1.0
129 877 1.0
129 657 1.0
129 547 1.0
129 869 1.0
129 471 1.0
129 793 1.0
129 230 1.0
129 984 1.0
129 730 1.0
129 154 1.0
129 167 1.0
129 400 1.0
129 489 1.0
129 845 1.0
129 659 1.0
129 604 1.0
129 384 1.0
129 761 1.0
129 418 1.0
129 829 1.0
129 905 1.0
129 698 1.0
129 669 1.0
129 381 1.0
129 504 1.0
129 441 1.0
129 585 1.0
129 975 1.0
129 289 1.0
129 535 1.0
129 391 1.0
129 857 1.0
129 370 1.0
129 781 1.0
129 637 1.0
129 629 1.0
129 464 1.0
129 176 1.0
129 477 1.0
129 202 1.0
129 236 1.0
129 736 1.0
129 982 1.0
129 317 1.0
129 872 1.0
129 296 1.0
129 474 1.0
129 775 1.0
130 534 1.0
130 157 1.0
130 712 1.0
130 175 1.0
130 502 1.0
130 337 1.0
130 947 1.0
130 727 1.0
130 672 1.0
130 131 1.0
130 219 1.0
130 211 1.0
130 978 1.0
130 292 1.0
130 509 1.0
130 619 1.0
130 645 1.0
130 171 1.0
130 205 1.0
130 362 1.0
130 718 1.0
130 464 1.0
130 676 1.0
130 781 1.0
130 841 1.0
130 909 1.0
130 715 1.0
130 173 1.0
130 317 1.0
130 495 1.0
130 974 1.0
130 775 1.0
130 919 1.0
131 437 1.0
131 429 1.0
131 819 1.0
131 963 1.0
131 421 1.0
131 311 1.0
131 832 1.0
131 659 1.0
131 494 1.0
131 706 1.0
131 164 1.0
131 219 1.0
131 143 1.0
131 177 1.0
131 376 1.0
131 575 1.0
131 643 1.0
131 326 1.0
131 829 1.0
131 847 1.0
131 352 1.0
131 674 1.0
131 391 1.0
131 192 1.0
131 823 1.0
131 294 1.0
131 184 1.0
131 616 1.0
131 176 1.0
131 244 1.0
131 791 1.0
131 969 1.0
131 194 1.0
131 571 1.0
131 694 1.0
131 652 1.0
131 144 1.0
131 432 1.0
131 788 1.0
131 712 1.0
131 801 1.0
132 314 1.0
132 416 1.0
132 594 1.0
132 497 1.0
132 908 1.0
132 256 1.0
132 777 1.0
132 934 1.0
132 481 1.0
132 138 1.0
132 282 1.0
132 316 1.0
132 604 1.0
132 892 1.0
132 926 1.0
132 473 1.0
132 245 1.0
132 991 1.0
132 729 1.0
132 873 1.0
132 962 1.0
132 920 1.0
132 755 1.0
132 234 1.0
132 700 1.0
132 925 1.0
132 904 1.0
132 972 1.0
132 917 1.0
132 430 1.0
132 807 1.0
132 909 1.0
132 367 1.0
132 867 1.0
132 702 1.0
132 757 1.0
132 935 1.0
132 859 1.0
132 542 1.0
132 631 1.0
132 521 1.0
132 233 1.0
132 466 1.0
132 555 1.0
132 534 1.0
132 822 1.0
133 594 1.0
133 175 1.0
133 874 1.0
133 578 1.0
133 379 1.0
133 468 1.0
133 879 1.0
133 261 1.0
133 727 1.0
133 507 1.0
133 900 1.0
133 947 1.0
133 955 1.0
133 986 1.0
133 279 1.0
133 457 1.0
133 889 1.0
133 923 1.0
133 284 1.0
133 407 1.0
133 551 1.0
133 894 1.0
133 577 1.0
133 611 1.0
133 975 1.0
133 988 1.0
133 891 1.0
133 980 1.0
133 299 1.0
133 566 1.0
133 587 1.0
133 600 1.0
133 613 1.0
133 812 1.0
133 660 1.0
133 948 1.0
133 720 1.0
133 754 1.0
133 356 1.0
133 953 1.0
133 602 1.0
133 966 1.0
134 657 1.0
134 979 1.0
134 450 1.0
134 971 1.0
134 785 1.0
134 243 1.0
134 332 1.0
134 311 1.0
134 913 1.0
134 714 1.0
134 761 1.0
134 562 1.0
134 596 1.0
134 630 1.0
134 622 1.0
134 135 1.0
134 224 1.0
134 250 1.0
134 297 1.0
134 365 1.0
134 598 1.0
134 378 1.0
134 878 1.0
134 137 1.0
134 603 1.0
134 608 1.0
134 265 1.0
134 697 1.0
134 448 1.0
134 605 1.0
134 262 1.0
134 927 1.0
134 542 1.0
134 686 1.0
134 466 1.0
134 555 1.0
135 238 1.0
135 594 1.0
135 277 1.0
135 523 1.0
135 782 1.0
135 541 1.0
135 253 1.0
135 431 1.0
135 279 1.0
135 250 1.0
135 517 1.0
135 648 1.0
135 653 1.0
135 737 1.0
135 907 1.0
135 323 1.0
135 603 1.0
135 493 1.0
135 739 1.0
135 752 1.0
135 477 1.0
135 401 1.0
135 613 1.0
135 414 1.0
135 503 1.0
135 537 1.0
135 655 1.0
135 922 1.0
135 364 1.0
135 563 1.0
135 741 1.0
135 932 1.0
135 961 1.0
136 424 1.0
136 890 1.0
136 382 1.0
136 848 1.0
136 251 1.0
136 484 1.0
136 861 1.0
136 188 1.0
136 146 1.0
136 976 1.0
136 371 1.0
136 295 1.0
136 473 1.0
136 363 1.0
136 973 1.0
136 609 1.0
136 580 1.0
136 792 1.0
136 737 1.0
136 983 1.0
136 462 1.0
136 928 1.0
136 289 1.0
136 658 1.0
136 171 1.0
136 239 1.0
136 616 1.0
136 142 1.0
136 197 1.0
136 951 1.0
136 689 1.0
136 359 1.0
136 440 1.0
136 872 1.0
137 903 1.0
137 717 1.0
137 573 1.0
137 662 1.0
137 442 1.0
137 997 1.0
137 743 1.0
137 544 1.0
137 146 1.0
137 756 1.0
137 913 1.0
137 371 1.0
137 837 1.0
137 329 1.0
137 596 1.0
137 198 1.0
137 300 1.0
137 944 1.0
137 512 1.0
137 601 1.0
137 635 1.0
137 779 1.0
137 237 1.0
137 737 1.0
137 758 1.0
137 250 1.0
137 805 1.0
137 229 1.0
137 331 1.0
137 797 1.0
137 501 1.0
137 857 1.0
137 404 1.0
137 349 1.0
137 726 1.0
137 383 1.0
137 663 1.0
137 718 1.0
137 710 1.0
137 833 1.0
137 194 1.0
137 372 1.0
137 838 1.0
137 639 1.0
137 927 1.0
137 563 1.0
137 254 1.0
138 178 1.0
138 411 1.0
138 445 1.0
138 984 1.0
138 696 1.0
138 544 1.0
138 688 1.0
138 468 1.0
138 502 1.0
138 557 1.0
138 926 1.0
138 164 1.0
138 876 1.0
138 732 1.0
138 300 1.0
138 533 1.0
138 800 1.0
138 669 1.0
138 263 1.0
138 873 1.0
138 708 1.0
138 166 1.0
138 399 1.0
138 378 1.0
138 522 1.0
138 357 1.0
138 370 1.0
138 273 1.0
138 197 1.0
138 629 1.0
138 265 1.0
138 663 1.0
138 930 1.0
138 401 1.0
138 867 1.0
138 236 1.0
138 380 1.0
138 474 1.0
138 309 1.0
138 809 1.0
138 377 1.0
139 662 1.0
139 324 1.0
139 379 1.0
139 562 1.0
139 944 1.0
139 402 1.0
139 148 1.0
139 182 1.0
139 436 1.0
139 826 1.0
139 441 1.0
139 475 1.0
139 200 1.0
139 467 1.0
139 556 1.0
139 158 1.0
139 425 1.0
139 171 1.0
139 459 1.0
139 480 1.0
139 611 1.0
139 307 1.0
139 739 1.0
139 553 1.0
139 388 1.0
139 456 1.0
139 490 1.0
139 831 1.0
139 841 1.0
139 550 1.0
139 862 1.0
139 152 1.0
139 419 1.0
139 796 1.0
139 865 1.0
139 466 1.0
139 733 1.0
139 458 1.0
139 513 1.0
140 534 1.0
140 335 1.0
140 890 1.0
140 225 1.0
140 958 1.0
140 903 1.0
140 615 1.0
140 937 1.0
140 361 1.0
140 450 1.0
140 573 1.0
140 353 1.0
140 421 1.0
140 311 1.0
140 345 1.0
140 612 1.0
140 180 1.0
140 502 1.0
140 557 1.0
140 748 1.0
140 389 1.0
140 944 1.0
140 889 1.0
140 999 1.0
140 258 1.0
140 347 1.0
140 360 1.0
140 750 1.0
140 784 1.0
140 899 1.0
140 357 1.0
140 726 1.0
140 294 1.0
140 307 1.0
140 752 1.0
140 731 1.0
140 299 1.0
140 511 1.0
140 689 1.0
140 757 1.0
140 846 1.0
140 770 1.0
140 419 1.0
140 885 1.0
140 233 1.0
141 903 1.0
141 366 1.0
141 400 1.0
141 523 1.0
141 214 1.0
141 227 1.0
141 620 1.0
141 727 1.0
141 444 1.0
141 368 1.0
141 423 1.0
141 868 1.0
141 978 1.0
141 504 1.0
141 860 1.0
141 284 1.0
141 373 1.0
141 661 1.0
141 750 1.0
141 810 1.0
141 158 1.0
141 281 1.0
141 480 1.0
141 548 1.0
141 561 1.0
141 650 1.0
141 163 1.0
141 307 1.0
141 320 1.0
141 464 1.0
141 642 1.0
141 823 1.0
141 828 1.0
141 857 1.0
141 482 1.0
141 715 1.0
141 980 1.0
141 241 1.0
141 665 1.0
141 233 1.0
141 987 1.0
141 945 1.0
142 191 1.0
142 335 1.0
142 293 1.0
142 526 1.0
142 670 1.0
142 895 1.0
142 374 1.0
142 903 1.0
142 950 1.0
142 565 1.0
142 654 1.0
142 180 1.0
142 557 1.0
142 955 1.0
142 426 1.0
142 989 1.0
142 672 1.0
142 664 1.0
142 266 1.0
142 300 1.0
142 478 1.0
142 745 1.0
142 648 1.0
142 868 1.0
142 174 1.0
142 886 1.0
142 255 1.0
142 556 1.0
142 480 1.0
142 438 1.0
142 218 1.0
142 409 1.0
142 443 1.0
142 752 1.0
142 825 1.0
142 194 1.0
142 351 1.0
143 578 1.0
143 248 1.0
143 282 1.0
143 431 1.0
143 520 1.0
143 643 1.0
143 444 1.0
143 601 1.0
143 724 1.0
143 745 1.0
143 305 1.0
143 153 1.0
143 276 1.0
143 399 1.0
143 590 1.0
143 514 1.0
143 569 1.0
143 603 1.0
143 150 1.0
143 485 1.0
143 540 1.0
143 752 1.0
143 189 1.0
143 820 1.0
143 215 1.0
143 283 1.0
143 783 1.0
143 152 1.0
143 775 1.0
143 322 1.0
143 466 1.0
143 830 1.0
143 513 1.0
143 725 1.0
143 814 1.0
143 864 1.0
143 903 1.0
143 945 1.0
143 730 1.0
143 971 1.0
144 445 1.0
144 246 1.0
144 717 1.0
144 319 1.0
144 387 1.0
144 764 1.0
144 222 1.0
144 845 1.0
144 735 1.0
144 591 1.0
144 714 1.0
144 350 1.0
144 397 1.0
144 863 1.0
144 643 1.0
144 245 1.0
144 457 1.0
144 614 1.0
144 271 1.0
144 449 1.0
144 284 1.0
144 873 1.0
144 818 1.0
144 475 1.0
144 865 1.0
144 323 1.0
144 425 1.0
144 370 1.0
144 849 1.0
144 705 1.0
144 417 1.0
144 286 1.0
144 320 1.0
144 354 1.0
144 388 1.0
144 346 1.0
144 812 1.0
144 414 1.0
144 503 1.0
144 304 1.0
144 956 1.0
144 893 1.0
144 262 1.0
144 495 1.0
144 618 1.0
144 851 1.0
144 233 1.0
144 267 1.0
145 856 1.0
145 403 1.0
145 992 1.0
145 319 1.0
145 874 1.0
145 154 1.0
145 387 1.0
145 531 1.0
145 222 1.0
145 908 1.0
145 701 1.0
145 159 1.0
145 193 1.0
145 337 1.0
145 227 1.0
145 316 1.0
145 769 1.0
145 816 1.0
145 617 1.0
145 947 1.0
145 185 1.0
145 512 1.0
145 724 1.0
145 449 1.0
145 161 1.0
145 970 1.0
145 606 1.0
145 386 1.0
145 598 1.0
145 399 1.0
145 179 1.0
145 912 1.0
145 158 1.0
145 171 1.0
145 315 1.0
145 637 1.0
145 472 1.0
145 595 1.0
145 718 1.0
145 930 1.0
145 820 1.0
145 710 1.0
145 799 1.0
145 778 1.0
145 956 1.0
145 325 1.0
145 359 1.0
145 948 1.0
145 228 1.0
145 317 1.0
145 584 1.0
145 762 1.0
145 398 1.0
146 785 1.0
146 819 1.0
146 311 1.0
146 612 1.0
146 502 1.0
146 248 1.0
146 667 1.0
146 151 1.0
146 782 1.0
146 892 1.0
146 486 1.0
146 643 1.0
146 910 1.0
146 279 1.0
146 368 1.0
146 216 1.0
146 648 1.0
146 195 1.0
146 318 1.0
146 716 1.0
146 818 1.0
146 920 1.0
146 721 1.0
146 391 1.0
146 370 1.0
146 870 1.0
146 328 1.0
146 925 1.0
146 176 1.0
146 841 1.0
146 948 1.0
146 673 1.0
146 817 1.0
146 364 1.0
146 563 1.0
146 377 1.0
146 788 1.0
146 212 1.0
146 830 1.0
146 348 1.0
146 581 1.0
146 911 1.0
147 411 1.0
147 280 1.0
147 225 1.0
147 547 1.0
147 602 1.0
147 437 1.0
147 149 1.0
147 704 1.0
147 649 1.0
147 725 1.0
147 759 1.0
147 827 1.0
147 408 1.0
147 675 1.0
147 811 1.0
147 379 1.0
147 180 1.0
147 536 1.0
147 659 1.0
147 227 1.0
147 405 1.0
147 583 1.0
147 384 1.0
147 329 1.0
147 761 1.0
147 363 1.0
147 211 1.0
147 355 1.0
147 190 1.0
147 656 1.0
147 944 1.0
147 635 1.0
147 436 1.0
147 449 1.0
147 318 1.0
147 551 1.0
147 873 1.0
147 933 1.0
147 205 1.0
147 705 1.0
147 993 1.0
147 828 1.0
147 574 1.0
147 553 1.0
147 155 1.0
147 998 1.0
147 545 1.0
147 702 1.0
147 736 1.0
147 681 1.0
147 626 1.0
147 791 1.0
147 914 1.0
147 521 1.0
148 314 1.0
148 183 1.0
148 662 1.0
148 319 1.0
148 154 1.0
148 243 1.0
148 510 1.0
148 976 1.0
148 735 1.0
148 337 1.0
148 227 1.0
148 515 1.0
148 528 1.0
148 507 1.0
148 308 1.0
148 905 1.0
148 381 1.0
148 559 1.0
148 428 1.0
148 318 1.0
148 564 1.0
148 758 1.0
148 805 1.0
148 954 1.0
148 281 1.0
148 726 1.0
148 650 1.0
148 883 1.0
148 663 1.0
148 655 1.0
148 634 1.0
148 757 1.0
148 304 1.0
148 770 1.0
148 927 1.0
148 165 1.0
148 720 1.0
149 157 1.0
149 641 1.0
149 332 1.0
149 510 1.0
149 400 1.0
149 963 1.0
149 536 1.0
149 172 1.0
149 604 1.0
149 892 1.0
149 952 1.0
149 499 1.0
149 601 1.0
149 491 1.0
149 415 1.0
149 847 1.0
149 284 1.0
149 852 1.0
149 954 1.0
149 603 1.0
149 260 1.0
149 836 1.0
149 650 1.0
149 163 1.0
149 883 1.0
149 231 1.0
149 820 1.0
149 566 1.0
149 367 1.0
149 160 1.0
149 249 1.0
149 435 1.0
149 715 1.0
149 241 1.0
149 796 1.0
150 424 1.0
150 225 1.0
150 492 1.0
150 712 1.0
150 759 1.0
150 683 1.0
150 874 1.0
150 455 1.0
150 654 1.0
150 447 1.0
150 659 1.0
150 185 1.0
150 808 1.0
150 355 1.0
150 588 1.0
150 423 1.0
150 863 1.0
150 986 1.0
150 994 1.0
150 284 1.0
150 263 1.0
150 496 1.0
150 763 1.0
150 221 1.0
150 818 1.0
150 624 1.0
150 514 1.0
150 726 1.0
150 616 1.0
150 608 1.0
150 354 1.0
150 312 1.0
150 249 1.0
150 448 1.0
150 715 1.0
150 927 1.0
150 474 1.0
150 652 1.0
150 762 1.0
150 178 1.0
151 709 1.0
151 997 1.0
151 777 1.0
151 413 1.0
151 701 1.0
151 337 1.0
151 371 1.0
151 955 1.0
151 240 1.0
151 274 1.0
151 829 1.0
151 465 1.0
151 334 1.0
151 224 1.0
151 305 1.0
151 907 1.0
151 310 1.0
151 433 1.0
151 501 1.0
151 556 1.0
151 590 1.0
151 260 1.0
151 692 1.0
151 802 1.0
151 396 1.0
151 519 1.0
151 299 1.0
151 655 1.0
151 710 1.0
151 731 1.0
151 647 1.0
151 878 1.0
151 896 1.0
151 639 1.0
151 906 1.0
151 977 1.0
151 165 1.0
151 631 1.0
151 466 1.0
151 500 1.0
152 445 1.0
152 835 1.0
152 403 1.0
152 259 1.0
152 759 1.0
152 793 1.0
152 738 1.0
152 162 1.0
152 510 1.0
152 180 1.0
152 447 1.0
152 515 1.0
152 460 1.0
152 206 1.0
152 295 1.0
152 630 1.0
152 198 1.0
152 156 1.0
152 677 1.0
152 559 1.0
152 271 1.0
152 792 1.0
152 538 1.0
152 284 1.0
152 509 1.0
152 975 1.0
152 954 1.0
152 268 1.0
152 446 1.0
152 624 1.0
152 925 1.0
152 794 1.0
152 786 1.0
152 532 1.0
152 189 1.0
152 744 1.0
152 977 1.0
152 257 1.0
152 490 1.0
152 838 1.0
152 385 1.0
152 241 1.0
152 987 1.0
152 699 1.0
152 932 1.0
153 191 1.0
153 945 1.0
153 314 1.0
153 581 1.0
153 327 1.0
153 471 1.0
153 175 1.0
153 874 1.0
153 963 1.0
153 654 1.0
153 777 1.0
153 900 1.0
153 324 1.0
153 858 1.0
153 426 1.0
153 748 1.0
153 850 1.0
153 363 1.0
153 452 1.0
153 863 1.0
153 431 1.0
153 232 1.0
153 410 1.0
153 211 1.0
153 643 1.0
153 664 1.0
153 889 1.0
153 491 1.0
153 724 1.0
153 991 1.0
153 462 1.0
153 907 1.0
153 577 1.0
153 171 1.0
153 527 1.0
153 218 1.0
153 841 1.0
153 710 1.0
153 655 1.0
153 867 1.0
153 537 1.0
153 372 1.0
153 351 1.0
153 186 1.0
153 563 1.0
153 576 1.0
153 843 1.0
153 267 1.0
154 162 1.0
154 628 1.0
154 916 1.0
154 709 1.0
154 277 1.0
154 366 1.0
154 439 1.0
154 541 1.0
154 342 1.0
154 740 1.0
154 897 1.0
154 423 1.0
154 745 1.0
154 779 1.0
154 758 1.0
154 750 1.0
154 813 1.0
154 949 1.0
154 965 1.0
154 200 1.0
154 789 1.0
154 912 1.0
154 480 1.0
154 438 1.0
154 739 1.0
154 485 1.0
154 883 1.0
154 299 1.0
154 846 1.0
154 990 1.0
154 914 1.0
154 283 1.0
154 660 1.0
154 474 1.0
154 749 1.0
154 453 1.0
154 199 1.0
154 788 1.0
154 851 1.0
154 864 1.0
154 746 1.0
154 948 1.0
154 992 1.0
155 911 1.0
155 390 1.0
155 369 1.0
155 492 1.0
155 204 1.0
155 814 1.0
155 429 1.0
155 497 1.0
155 798 1.0
155 887 1.0
155 578 1.0
155 811 1.0
155 379 1.0
155 549 1.0
155 960 1.0
155 609 1.0
155 156 1.0
155 300 1.0
155 423 1.0
155 546 1.0
155 415 1.0
155 449 1.0
155 771 1.0
155 263 1.0
155 975 1.0
155 831 1.0
155 399 1.0
155 488 1.0
155 289 1.0
155 899 1.0
155 535 1.0
155 425 1.0
155 226 1.0
155 370 1.0
155 260 1.0
155 514 1.0
155 375 1.0
155 223 1.0
155 922 1.0
155 325 1.0
155 380 1.0
155 592 1.0
155 804 1.0
155 817 1.0
155 707 1.0
155 796 1.0
155 741 1.0
156 589 1.0
156 636 1.0
156 348 1.0
156 437 1.0
156 670 1.0
156 573 1.0
156 887 1.0
156 578 1.0
156 214 1.0
156 392 1.0
156 227 1.0
156 308 1.0
156 719 1.0
156 965 1.0
156 677 1.0
156 190 1.0
156 834 1.0
156 347 1.0
156 957 1.0
156 648 1.0
156 195 1.0
156 373 1.0
156 428 1.0
156 496 1.0
156 983 1.0
156 687 1.0
156 200 1.0
156 378 1.0
156 577 1.0
156 899 1.0
156 988 1.0
156 603 1.0
156 315 1.0
156 404 1.0
156 959 1.0
156 540 1.0
156 244 1.0
156 189 1.0
156 367 1.0
156 600 1.0
156 634 1.0
156 249 1.0
156 482 1.0
156 516 1.0
156 927 1.0
156 495 1.0
156 639 1.0
156 652 1.0
156 254 1.0
156 233 1.0
157 424 1.0
157 369 1.0
157 725 1.0
157 293 1.0
157 196 1.0
157 416 1.0
157 332 1.0
157 437 1.0
157 628 1.0
157 767 1.0
157 887 1.0
157 227 1.0
157 371 1.0
157 748 1.0
157 863 1.0
157 753 1.0
157 313 1.0
157 457 1.0
157 813 1.0
157 737 1.0
157 923 1.0
157 229 1.0
157 661 1.0
157 729 1.0
157 957 1.0
157 970 1.0
157 289 1.0
157 671 1.0
157 184 1.0
157 828 1.0
157 422 1.0
157 312 1.0
157 490 1.0
157 943 1.0
157 304 1.0
157 482 1.0
157 715 1.0
157 974 1.0
157 775 1.0
157 466 1.0
158 801 1.0
158 602 1.0
158 293 1.0
158 238 1.0
158 217 1.0
158 416 1.0
158 251 1.0
158 607 1.0
158 264 1.0
158 641 1.0
158 997 1.0
158 625 1.0
158 227 1.0
158 994 1.0
158 266 1.0
158 245 1.0
158 800 1.0
158 758 1.0
158 559 1.0
158 991 1.0
158 572 1.0
158 716 1.0
158 805 1.0
158 653 1.0
158 687 1.0
158 878 1.0
158 637 1.0
158 616 1.0
158 184 1.0
158 218 1.0
158 286 1.0
158 608 1.0
158 176 1.0
158 210 1.0
158 231 1.0
158 752 1.0
158 765 1.0
158 367 1.0
158 786 1.0
158 181 1.0
158 160 1.0
158 440 1.0
158 673 1.0
158 762 1.0
158 796 1.0
158 885 1.0
158 453 1.0
159 479 1.0
159 547 1.0
159 293 1.0
159 814 1.0
159 416 1.0
159 662 1.0
159 374 1.0
159 319 1.0
159 641 1.0
159 895 1.0
159 531 1.0
159 222 1.0
159 832 1.0
159 557 1.0
159 303 1.0
159 447 1.0
159 337 1.0
159 405 1.0
159 549 1.0
159 638 1.0
159 384 1.0
159 727 1.0
159 164 1.0
159 575 1.0
159 918 1.0
159 923 1.0
159 758 1.0
159 847 1.0
159 216 1.0
159 394 1.0
159 483 1.0
159 716 1.0
159 263 1.0
159 208 1.0
159 420 1.0
159 886 1.0
159 166 1.0
159 454 1.0
159 577 1.0
159 632 1.0
159 789 1.0
159 446 1.0
159 980 1.0
159 315 1.0
159 781 1.0
159 341 1.0
159 896 1.0
159 320 1.0
159 587 1.0
159 655 1.0
159 799 1.0
159 647 1.0
159 215 1.0
159 304 1.0
159 393 1.0
159 482 1.0
159 550 1.0
159 495 1.0
159 631 1.0
160 293 1.0
160 196 1.0
160 306 1.0
160 526 1.0
160 874 1.0
160 895 1.0
160 832 1.0
160 578 1.0
160 612 1.0
160 900 1.0
160 858 1.0
160 968 1.0
160 997 1.0
160 418 1.0
160 164 1.0
160 363 1.0
160 698 1.0
160 211 1.0
160 559 1.0
160 826 1.0
160 305 1.0
160 538 1.0
160 847 1.0
160 297 1.0
160 179 1.0
160 213 1.0
160 391 1.0
160 438 1.0
160 700 1.0
160 794 1.0
160 396 1.0
160 828 1.0
160 176 1.0
160 917 1.0
160 933 1.0
160 579 1.0
160 558 1.0
160 660 1.0
160 461 1.0
160 974 1.0
160 864 1.0
160 712 1.0
161 348 1.0
161 835 1.0
161 285 1.0
161 387 1.0
161 599 1.0
161 675 1.0
161 845 1.0
161 596 1.0
161 918 1.0
161 321 1.0
161 931 1.0
161 444 1.0
161 279 1.0
161 622 1.0
161 436 1.0
161 661 1.0
161 818 1.0
161 747 1.0
161 959 1.0
161 184 1.0
161 328 1.0
161 307 1.0
161 396 1.0
161 417 1.0
161 595 1.0
161 650 1.0
161 689 1.0
161 469 1.0
161 270 1.0
161 359 1.0
161 804 1.0
161 846 1.0
161 875 1.0
161 529 1.0
161 888 1.0
161 631 1.0
161 935 1.0
161 610 1.0
162 636 1.0
162 869 1.0
162 924 1.0
162 374 1.0
162 518 1.0
162 887 1.0
162 578 1.0
162 235 1.0
162 502 1.0
162 392 1.0
162 858 1.0
162 295 1.0
162 528 1.0
162 929 1.0
162 992 1.0
162 232 1.0
162 813 1.0
162 991 1.0
162 394 1.0
162 797 1.0
162 365 1.0
162 501 1.0
162 687 1.0
162 755 1.0
162 810 1.0
162 637 1.0
162 823 1.0
162 451 1.0
162 920 1.0
162 925 1.0
162 299 1.0
162 223 1.0
162 312 1.0
162 626 1.0
162 715 1.0
162 262 1.0
163 329 1.0
163 829 1.0
163 986 1.0
163 266 1.0
163 423 1.0
163 677 1.0
163 834 1.0
163 855 1.0
163 360 1.0
163 428 1.0
163 661 1.0
163 221 1.0
163 920 1.0
163 234 1.0
163 302 1.0
163 493 1.0
163 383 1.0
163 561 1.0
163 917 1.0
163 197 1.0
163 375 1.0
163 621 1.0
163 799 1.0
163 723 1.0
163 283 1.0
163 940 1.0
163 508 1.0
163 254 1.0
163 288 1.0
163 398 1.0
163 301 1.0
163 534 1.0
163 568 1.0
163 183 1.0
163 560 1.0
163 683 1.0
163 717 1.0
163 772 1.0
163 809 1.0
163 523 1.0
163 853 1.0
163 680 1.0
163 984 1.0
163 892 1.0
164 191 1.0
164 458 1.0
164 170 1.0
164 814 1.0
164 984 1.0
164 269 1.0
164 926 1.0
164 609 1.0
164 232 1.0
164 321 1.0
164 211 1.0
164 300 1.0
164 169 1.0
164 347 1.0
164 635 1.0
164 559 1.0
164 923 1.0
164 970 1.0
164 538 1.0
164 915 1.0
164 983 1.0
164 755 1.0
164 645 1.0
164 789 1.0
164 933 1.0
164 391 1.0
164 404 1.0
164 616 1.0
164 595 1.0
164 574 1.0
164 752 1.0
164 176 1.0
164 299 1.0
164 532 1.0
164 998 1.0
164 689 1.0
164 524 1.0
164 181 1.0
164 626 1.0
164 461 1.0
164 796 1.0
164 364 1.0
164 754 1.0
165 369 1.0
165 492 1.0
165 869 1.0
165 183 1.0
165 196 1.0
165 675 1.0
165 188 1.0
165 277 1.0
165 599 1.0
165 434 1.0
165 248 1.0
165 274 1.0
165 452 1.0
165 575 1.0
165 410 1.0
165 732 1.0
165 593 1.0
165 394 1.0
165 915 1.0
165 750 1.0
165 297 1.0
165 886 1.0
165 522 1.0
165 611 1.0
165 844 1.0
165 357 1.0
165 857 1.0
165 569 1.0
165 514 1.0
165 946 1.0
165 404 1.0
165 561 1.0
165 396 1.0
165 540 1.0
165 430 1.0
165 896 1.0
165 320 1.0
165 697 1.0
165 443 1.0
165 985 1.0
165 702 1.0
165 571 1.0
165 440 1.0
165 385 1.0
165 885 1.0
165 254 1.0
166 170 1.0
166 251 1.0
166 319 1.0
166 874 1.0
166 476 1.0
166 832 1.0
166 735 1.0
166 625 1.0
166 672 1.0
166 384 1.0
166 617 1.0
166 418 1.0
166 431 1.0
166 821 1.0
166 855 1.0
166 711 1.0
166 368 1.0
166 813 1.0
166 758 1.0
166 182 1.0
166 881 1.0
166 700 1.0
166 294 1.0
166 184 1.0
166 595 1.0
166 828 1.0
166 320 1.0
166 587 1.0
166 532 1.0
166 964 1.0
166 422 1.0
166 668 1.0
166 613 1.0
166 791 1.0
166 550 1.0
166 584 1.0
166 762 1.0
166 474 1.0
166 830 1.0
166 974 1.0
166 432 1.0
166 288 1.0
166 233 1.0
166 733 1.0
166 754 1.0
166 809 1.0
167 759 1.0
167 361 1.0
167 662 1.0
167 209 1.0
167 675 1.0
167 243 1.0
167 188 1.0
167 222 1.0
167 366 1.0
167 400 1.0
167 421 1.0
167 489 1.0
167 934 1.0
167 942 1.0
167 240 1.0
167 219 1.0
167 795 1.0
167 609 1.0
167 423 1.0
167 889 1.0
167 978 1.0
167 203 1.0
167 669 1.0
167 415 1.0
167 271 1.0
167 449 1.0
167 538 1.0
167 373 1.0
167 805 1.0
167 386 1.0
167 221 1.0
167 776 1.0
167 933 1.0
167 878 1.0
167 302 1.0
167 980 1.0
167 294 1.0
167 239 1.0
167 273 1.0
167 663 1.0
167 807 1.0
167 210 1.0
167 786 1.0
167 202 1.0
167 490 1.0
167 757 1.0
167 969 1.0
167 427 1.0
167 474 1.0
168 476 1.0
168 811 1.0
168 549 1.0
168 706 1.0
168 656 1.0
168 606 1.0
168 441 1.0
168 187 1.0
168 276 1.0
168 831 1.0
168 700 1.0
168 734 1.0
168 459 1.0
168 603 1.0
168 739 1.0
168 252 1.0
168 574 1.0
168 231 1.0
168 210 1.0
168 943 1.0
168 778 1.0
168 435 1.0
168 702 1.0
168 372 1.0
168 906 1.0
168 178 1.0
168 233 1.0
168 288 1.0
168 314 1.0
168 416 1.0
168 822 1.0
168 971 1.0
169 963 1.0
169 337 1.0
169 549 1.0
169 638 1.0
169 274 1.0
169 253 1.0
169 321 1.0
169 452 1.0
169 609 1.0
169 960 1.0
169 635 1.0
169 965 1.0
169 559 1.0
169 973 1.0
169 229 1.0
169 407 1.0
169 750 1.0
169 797 1.0
169 988 1.0
169 768 1.0
169 836 1.0
169 205 1.0
169 739 1.0
169 629 1.0
169 909 1.0
169 647 1.0
169 448 1.0
169 728 1.0
169 385 1.0
169 220 1.0
169 432 1.0
169 521 1.0
169 741 1.0
169 712 1.0
169 767 1.0
169 314 1.0
170 581 1.0
170 992 1.0
170 327 1.0
170 471 1.0
170 484 1.0
170 607 1.0
170 696 1.0
170 476 1.0
170 793 1.0
170 222 1.0
170 180 1.0
170 214 1.0
170 591 1.0
170 769 1.0
170 774 1.0
170 876 1.0
170 402 1.0
170 737 1.0
170 716 1.0
170 653 1.0
170 399 1.0
170 323 1.0
170 763 1.0
170 315 1.0
170 603 1.0
170 713 1.0
170 506 1.0
170 485 1.0
170 430 1.0
170 176 1.0
170 747 1.0
170 333 1.0
170 836 1.0
170 545 1.0
170 893 1.0
170 228 1.0
170 351 1.0
170 550 1.0
170 927 1.0
170 686 1.0
170 775 1.0
170 940 1.0
170 733 1.0
170 961 1.0
171 445 1.0
171 246 1.0
171 801 1.0
171 822 1.0
171 856 1.0
171 437 1.0
171 772 1.0
171 628 1.0
171 285 1.0
171 573 1.0
171 586 1.0
171 243 1.0
171 942 1.0
171 997 1.0
171 921 1.0
171 523 1.0
171 989 1.0
171 646 1.0
171 447 1.0
171 837 1.0
171 693 1.0
171 261 1.0
171 782 1.0
171 761 1.0
171 871 1.0
171 266 1.0
171 279 1.0
171 868 1.0
171 970 1.0
171 339 1.0
171 318 1.0
171 462 1.0
171 187 1.0
171 742 1.0
171 302 1.0
171 247 1.0
171 582 1.0
171 396 1.0
171 574 1.0
171 443 1.0
171 291 1.0
171 613 1.0
171 215 1.0
171 715 1.0
171 516 1.0
171 529 1.0
171 940 1.0
171 995 1.0
171 309 1.0
171 898 1.0
172 248 1.0
172 625 1.0
172 871 1.0
172 960 1.0
172 829 1.0
172 253 1.0
172 601 1.0
172 203 1.0
172 491 1.0
172 771 1.0
172 551 1.0
172 208 1.0
172 530 1.0
172 818 1.0
172 632 1.0
172 234 1.0
172 556 1.0
172 658 1.0
172 776 1.0
172 197 1.0
172 210 1.0
172 710 1.0
172 854 1.0
172 867 1.0
172 503 1.0
172 647 1.0
172 715 1.0
172 880 1.0
172 982 1.0
172 474 1.0
172 542 1.0
172 720 1.0
172 754 1.0
172 191 1.0
172 657 1.0
172 403 1.0
172 238 1.0
172 547 1.0
172 767 1.0
172 607 1.0
172 586 1.0
172 675 1.0
172 709 1.0
173 670 1.0
173 615 1.0
173 759 1.0
173 217 1.0
173 984 1.0
173 696 1.0
173 209 1.0
173 421 1.0
173 455 1.0
173 599 1.0
173 688 1.0
173 434 1.0
173 811 1.0
173 646 1.0
173 989 1.0
173 913 1.0
173 248 1.0
173 371 1.0
173 261 1.0
173 295 1.0
173 994 1.0
173 473 1.0
173 185 1.0
173 452 1.0
173 596 1.0
173 740 1.0
173 774 1.0
173 850 1.0
173 732 1.0
173 813 1.0
173 737 1.0
173 305 1.0
173 195 1.0
173 428 1.0
173 640 1.0
173 653 1.0
173 378 1.0
173 755 1.0
173 899 1.0
173 624 1.0
173 946 1.0
173 548 1.0
173 692 1.0
173 595 1.0
173 841 1.0
173 202 1.0
173 558 1.0
173 448 1.0
173 393 1.0
173 770 1.0
173 825 1.0
173 639 1.0
173 351 1.0
173 584 1.0
173 851 1.0
173 652 1.0
173 631 1.0
173 610 1.0
174 602 1.0
174 259 1.0
174 314 1.0
174 623 1.0
174 827 1.0
174 717 1.0
174 209 1.0
174 599 1.0
174 798 1.0
174 379 1.0
174 879 1.0
174 549 1.0
174 384 1.0
174 706 1.0
174 541 1.0
174 465 1.0
174 965 1.0
174 677 1.0
174 978 1.0
174 491 1.0
174 559 1.0
174 763 1.0
174 797 1.0
174 755 1.0
174 658 1.0
174 438 1.0
174 472 1.0
174 265 1.0
174 519 1.0
174 312 1.0
174 527 1.0
174 236 1.0
174 723 1.0
174 296 1.0
174 186 1.0
174 309 1.0
174 576 1.0
174 618 1.0
175 335 1.0
175 958 1.0
175 361 1.0
175 950 1.0
175 497 1.0
175 455 1.0
175 942 1.0
175 447 1.0
175 803 1.0
175 926 1.0
175 295 1.0
175 774 1.0
175 588 1.0
175 622 1.0
175 656 1.0
175 910 1.0
175 483 1.0
175 462 1.0
175 331 1.0
175 695 1.0
175 378 1.0
175 818 1.0
175 247 1.0
175 336 1.0
175 425 1.0
175 438 1.0
175 362 1.0
175 286 1.0
175 718 1.0
175 443 1.0
175 532 1.0
175 600 1.0
175 962 1.0
175 668 1.0
175 440 1.0
175 474 1.0
175 741 1.0
175 987 1.0
176 301 1.0
176 623 1.0
176 369 1.0
176 492 1.0
176 293 1.0
176 581 1.0
176 327 1.0
176 560 1.0
176 738 1.0
176 484 1.0
176 628 1.0
176 319 1.0
176 209 1.0
176 722 1.0
176 612 1.0
176 955 1.0
176 913 1.0
176 769 1.0
176 782 1.0
176 905 1.0
176 939 1.0
176 436 1.0
176 983 1.0
176 907 1.0
176 852 1.0
176 488 1.0
176 357 1.0
176 734 1.0
176 870 1.0
176 294 1.0
176 744 1.0
176 969 1.0
176 571 1.0
176 660 1.0
176 228 1.0
176 406 1.0
176 715 1.0
176 770 1.0
176 275 1.0
176 597 1.0
177 272 1.0
177 793 1.0
177 680 1.0
177 562 1.0
177 651 1.0
177 211 1.0
177 499 1.0
177 897 1.0
177 402 1.0
177 237 1.0
177 572 1.0
177 635 1.0
177 318 1.0
177 669 1.0
177 690 1.0
177 695 1.0
177 755 1.0
177 831 1.0
177 852 1.0
177 569 1.0
177 860 1.0
177 815 1.0
177 506 1.0
177 878 1.0
177 918 1.0
177 931 1.0
177 210 1.0
177 388 1.0
177 922 1.0
177 325 1.0
177 550 1.0
177 982 1.0
177 906 1.0
177 885 1.0
177 919 1.0
177 288 1.0
177 576 1.0
177 953 1.0
177 458 1.0
177 581 1.0
178 492 1.0
178 602 1.0
178 670 1.0
178 361 1.0
178 251 1.0
178 691 1.0
178 442 1.0
178 709 1.0
178 743 1.0
178 722 1.0
178 235 1.0
178 701 1.0
178 337 1.0
178 803 1.0
178 926 1.0
178 884 1.0
178 952 1.0
178 211 1.0
178 554 1.0
178 944 1.0
178 758 1.0
178 826 1.0
178 771 1.0
178 750 1.0
178 407 1.0
178 653 1.0
178 983 1.0
178 433 1.0
178 865 1.0
178 624 1.0
178 582 1.0
178 959 1.0
178 252 1.0
178 697 1.0
178 731 1.0
178 524 1.0
178 778 1.0
178 571 1.0
178 660 1.0
178 385 1.0
178 563 1.0
178 686 1.0
178 576 1.0
179 369 1.0
179 458 1.0
179 348 1.0
179 471 1.0
179 738 1.0
179 971 1.0
179 895 1.0
179 353 1.0
179 222 1.0
179 667 1.0
179 180 1.0
179 968 1.0
179 947 1.0
179 295 1.0
179 651 1.0
179 376 1.0
179 609 1.0
179 732 1.0
179 902 1.0
179 483 1.0
179 661 1.0
179 462 1.0
179 407 1.0
179 797 1.0
179 234 1.0
179 412 1.0
179 789 1.0
179 967 1.0
179 391 1.0
179 480 1.0
179 747 1.0
179 980 1.0
179 637 1.0
179 218 1.0
179 252 1.0
179 663 1.0
179 807 1.0
179 697 1.0
179 896 1.0
179 888 1.0
179 524 1.0
179 469 1.0
179 558 1.0
179 461 1.0
179 872 1.0
179 419 1.0
179 508 1.0
179 199 1.0
179 953 1.0
180 445 1.0
180 492 1.0
180 772 1.0
180 340 1.0
180 840 1.0
180 756 1.0
180 989 1.0
180 185 1.0
180 685 1.0
180 876 1.0
180 957 1.0
180 381 1.0
180 771 1.0
180 949 1.0
180 462 1.0
180 975 1.0
180 399 1.0
180 433 1.0
180 234 1.0
180 501 1.0
180 446 1.0
180 912 1.0
180 336 1.0
180 548 1.0
180 561 1.0
180 375 1.0
180 498 1.0
180 587 1.0
180 477 1.0
180 223 1.0
180 291 1.0
180 181 1.0
180 380 1.0
180 647 1.0
180 668 1.0
180 681 1.0
180 427 1.0
180 749 1.0
180 757 1.0
180 639 1.0
180 935 1.0
180 961 1.0
180 982 1.0
180 309 1.0
181 950 1.0
181 476 1.0
181 303 1.0
181 371 1.0
181 295 1.0
181 808 1.0
181 389 1.0
181 444 1.0
181 656 1.0
181 766 1.0
181 496 1.0
181 928 1.0
181 988 1.0
181 268 1.0
181 302 1.0
181 857 1.0
181 307 1.0
181 430 1.0
181 333 1.0
181 278 1.0
181 401 1.0
181 380 1.0
181 893 1.0
181 317 1.0
181 817 1.0
181 943 1.0
181 995 1.0
181 576 1.0
182 429 1.0
182 929 1.0
182 277 1.0
182 256 1.0
182 400 1.0
182 413 1.0
182 544 1.0
182 481 1.0
182 227 1.0
182 371 1.0
182 426 1.0
182 507 1.0
182 596 1.0
182 198 1.0
182 892 1.0
182 913 1.0
182 973 1.0
182 847 1.0
182 771 1.0
182 661 1.0
182 784 1.0
182 810 1.0
182 954 1.0
182 446 1.0
182 925 1.0
182 959 1.0
182 218 1.0
182 252 1.0
182 595 1.0
182 320 1.0
182 587 1.0
182 773 1.0
182 744 1.0
182 998 1.0
182 558 1.0
182 249 1.0
182 592 1.0
182 647 1.0
182 893 1.0
182 377 1.0
182 411 1.0
183 209 1.0
183 476 1.0
183 188 1.0
183 277 1.0
183 366 1.0
183 324 1.0
183 502 1.0
183 785 1.0
183 515 1.0
183 748 1.0
183 384 1.0
183 879 1.0
183 486 1.0
183 287 1.0
183 677 1.0
183 999 1.0
183 292 1.0
183 415 1.0
183 669 1.0
183 530 1.0
183 276 1.0
183 454 1.0
183 818 1.0
183 624 1.0
183 205 1.0
183 218 1.0
183 362 1.0
183 210 1.0
183 477 1.0
183 223 1.0
183 401 1.0
183 506 1.0
183 503 1.0
183 524 1.0
183 922 1.0
183 372 1.0
183 461 1.0
183 584 1.0
183 985 1.0
183 233 1.0
183 809 1.0
183 657 1.0
183 746 1.0
183 437 1.0
183 670 1.0
184 746 1.0
184 670 1.0
184 683 1.0
184 340 1.0
184 607 1.0
184 827 1.0
184 916 1.0
184 222 1.0
184 921 1.0
184 871 1.0
184 960 1.0
184 740 1.0
184 232 1.0
184 876 1.0
184 512 1.0
184 457 1.0
184 991 1.0
184 606 1.0
184 996 1.0
184 242 1.0
184 331 1.0
184 433 1.0
184 844 1.0
184 548 1.0
184 760 1.0
184 985 1.0
184 464 1.0
184 642 1.0
184 558 1.0
184 427 1.0
184 317 1.0
184 296 1.0
184 694 1.0
184 398 1.0
184 919 1.0
184 932 1.0
185 479 1.0
185 539 1.0
185 984 1.0
185 819 1.0
185 620 1.0
185 510 1.0
185 311 1.0
185 654 1.0
185 853 1.0
185 303 1.0
185 447 1.0
185 803 1.0
185 227 1.0
185 308 1.0
185 486 1.0
185 897 1.0
185 355 1.0
185 855 1.0
185 190 1.0
185 224 1.0
185 258 1.0
185 669 1.0
185 360 1.0
185 420 1.0
185 200 1.0
185 666 1.0
185 658 1.0
185 370 1.0
185 815 1.0
185 239 1.0
185 328 1.0
185 417 1.0
185 464 1.0
185 744 1.0
185 490 1.0
185 236 1.0
185 613 1.0
185 817 1.0
185 542 1.0
185 775 1.0
186 246 1.0
186 602 1.0
186 958 1.0
186 340 1.0
186 785 1.0
186 730 1.0
186 421 1.0
186 887 1.0
186 311 1.0
186 400 1.0
186 688 1.0
186 290 1.0
186 557 1.0
186 502 1.0
186 646 1.0
186 282 1.0
186 816 1.0
186 274 1.0
186 795 1.0
186 685 1.0
186 973 1.0
186 211 1.0
186 965 1.0
186 313 1.0
186 703 1.0
186 271 1.0
186 941 1.0
186 467 1.0
186 213 1.0
186 802 1.0
186 946 1.0
186 603 1.0
186 315 1.0
186 671 1.0
186 883 1.0
186 451 1.0
186 540 1.0
186 341 1.0
186 642 1.0
186 964 1.0
186 621 1.0
186 977 1.0
186 901 1.0
186 791 1.0
186 592 1.0
186 770 1.0
186 694 1.0
186 440 1.0
186 673 1.0
186 932 1.0
187 301 1.0
187 979 1.0
187 636 1.0
187 780 1.0
187 382 1.0
187 992 1.0
187 416 1.0
187 738 1.0
187 683 1.0
187 340 1.0
187 285 1.0
187 484 1.0
187 984 1.0
187 264 1.0
187 963 1.0
187 222 1.0
187 544 1.0
187 295 1.0
187 439 1.0
187 473 1.0
187 452 1.0
187 884 1.0
187 397 1.0
187 575 1.0
187 719 1.0
187 643 1.0
187 588 1.0
187 787 1.0
187 622 1.0
187 190 1.0
187 279 1.0
187 360 1.0
187 339 1.0
187 543 1.0
187 399 1.0
187 289 1.0
187 556 1.0
187 645 1.0
187 391 1.0
187 831 1.0
187 726 1.0
187 904 1.0
187 451 1.0
187 341 1.0
187 354 1.0
187 244 1.0
187 189 1.0
187 435 1.0
187 990 1.0
187 448 1.0
187 351 1.0
187 974 1.0
187 843 1.0
188 411 1.0
188 555 1.0
188 788 1.0
188 335 1.0
188 738 1.0
188 827 1.0
188 387 1.0
188 531 1.0
188 798 1.0
188 853 1.0
188 921 1.0
188 955 1.0
188 900 1.0
188 536 1.0
188 426 1.0
188 693 1.0
188 206 1.0
188 960 1.0
188 651 1.0
188 308 1.0
188 245 1.0
188 834 1.0
188 203 1.0
188 449 1.0
188 551 1.0
188 352 1.0
188 941 1.0
188 459 1.0
188 514 1.0
188 692 1.0
188 739 1.0
188 608 1.0
188 998 1.0
188 333 1.0
188 278 1.0
188 867 1.0
188 825 1.0
188 770 1.0
188 275 1.0
188 864 1.0
188 953 1.0
188 898 1.0
189 290 1.0
189 358 1.0
189 541 1.0
189 829 1.0
189 465 1.0
189 190 1.0
189 347 1.0
189 326 1.0
189 792 1.0
189 918 1.0
189 936 1.0
189 263 1.0
189 729 1.0
189 952 1.0
189 357 1.0
189 480 1.0
189 514 1.0
189 679 1.0
189 472 1.0
189 417 1.0
189 726 1.0
189 375 1.0
189 532 1.0
189 244 1.0
189 477 1.0
189 710 1.0
189 236 1.0
189 270 1.0
189 734 1.0
189 760 1.0
189 833 1.0
189 597 1.0
189 836 1.0
189 521 1.0
189 896 1.0
189 906 1.0
189 424 1.0
189 280 1.0
189 403 1.0
189 890 1.0
189 882 1.0
190 675 1.0
190 489 1.0
190 735 1.0
190 405 1.0
190 761 1.0
190 308 1.0
190 287 1.0
190 816 1.0
190 779 1.0
190 292 1.0
190 923 1.0
190 936 1.0
190 310 1.0
190 632 1.0
190 289 1.0
190 281 1.0
190 870 1.0
190 472 1.0
190 917 1.0
190 951 1.0
190 354 1.0
190 223 1.0
190 443 1.0
190 414 1.0
190 490 1.0
190 511 1.0
190 545 1.0
190 385 1.0
190 364 1.0
190 775 1.0
190 809 1.0
190 919 1.0
190 500 1.0
190 191 1.0
190 869 1.0
191 945 1.0
191 513 1.0
191 717 1.0
191 518 1.0
191 696 1.0
191 709 1.0
191 277 1.0
191 434 1.0
191 523 1.0
191 337 1.0
191 565 1.0
191 748 1.0
191 887 1.0
191 719 1.0
191 829 1.0
191 677 1.0
191 580 1.0
191 957 1.0
191 216 1.0
191 339 1.0
191 915 1.0
191 700 1.0
191 590 1.0
191 247 1.0
191 768 1.0
191 912 1.0
191 595 1.0
191 252 1.0
191 883 1.0
191 532 1.0
191 710 1.0
191 223 1.0
191 799 1.0
191 469 1.0
191 964 1.0
191 592 1.0
191 571 1.0
191 317 1.0
191 406 1.0
191 694 1.0
191 838 1.0
192 479 1.0
192 369 1.0
192 225 1.0
192 602 1.0
192 492 1.0
192 835 1.0
192 958 1.0
192 505 1.0
192 772 1.0
192 717 1.0
192 929 1.0
192 565 1.0
192 290 1.0
192 845 1.0
192 879 1.0
192 350 1.0
192 816 1.0
192 465 1.0
192 554 1.0
192 478 1.0
192 423 1.0
192 800 1.0
192 834 1.0
192 999 1.0
192 669 1.0
192 195 1.0
192 983 1.0
192 530 1.0
192 598 1.0
192 454 1.0
192 480 1.0
192 582 1.0
192 417 1.0
192 451 1.0
192 341 1.0
192 286 1.0
192 951 1.0
192 553 1.0
192 642 1.0
192 587 1.0
192 278 1.0
192 867 1.0
192 579 1.0
192 723 1.0
192 304 1.0
192 228 1.0
192 461 1.0
192 262 1.0
192 707 1.0
192 275 1.0
192 953 1.0
193 450 1.0
193 285 1.0
193 777 1.0
193 811 1.0
193 748 1.0
193 549 1.0
193 892 1.0
193 939 1.0
193 245 1.0
193 394 1.0
193 585 1.0
193 454 1.0
193 674 1.0
193 870 1.0
193 532 1.0
193 655 1.0
193 558 1.0
193 482 1.0
193 969 1.0
193 233 1.0
193 589 1.0
193 801 1.0
194 966 1.0
194 801 1.0
194 979 1.0
194 259 1.0
194 924 1.0
194 916 1.0
194 298 1.0
194 408 1.0
194 463 1.0
194 976 1.0
194 570 1.0
194 206 1.0
194 418 1.0
194 410 1.0
194 389 1.0
194 588 1.0
194 855 1.0
194 889 1.0
194 627 1.0
194 729 1.0
194 208 1.0
194 687 1.0
194 611 1.0
194 857 1.0
194 781 1.0
194 946 1.0
194 988 1.0
194 451 1.0
194 540 1.0
194 430 1.0
194 519 1.0
194 244 1.0
194 312 1.0
194 579 1.0
194 587 1.0
194 537 1.0
194 626 1.0
194 770 1.0
194 495 1.0
194 762 1.0
195 712 1.0
195 869 1.0
195 654 1.0
195 510 1.0
195 688 1.0
195 633 1.0
195 392 1.0
195 714 1.0
195 426 1.0
195 659 1.0
195 727 1.0
195 439 1.0
195 761 1.0
195 850 1.0
195 863 1.0
195 198 1.0
195 279 1.0
195 313 1.0
195 258 1.0
195 368 1.0
195 826 1.0
195 394 1.0
195 873 1.0
195 598 1.0
195 577 1.0
195 459 1.0
195 548 1.0
195 438 1.0
195 328 1.0
195 883 1.0
195 972 1.0
195 629 1.0
195 375 1.0
195 464 1.0
195 265 1.0
195 354 1.0
195 710 1.0
195 998 1.0
195 545 1.0
195 757 1.0
195 969 1.0
195 482 1.0
195 427 1.0
195 474 1.0
195 288 1.0
196 212 1.0
196 628 1.0
196 751 1.0
196 840 1.0
196 641 1.0
196 298 1.0
196 633 1.0
196 989 1.0
196 358 1.0
196 337 1.0
196 604 1.0
196 706 1.0
196 520 1.0
196 732 1.0
196 368 1.0
196 724 1.0
196 902 1.0
196 758 1.0
196 229 1.0
196 318 1.0
196 750 1.0
196 441 1.0
196 797 1.0
196 255 1.0
196 336 1.0
196 315 1.0
196 726 1.0
196 904 1.0
196 362 1.0
196 629 1.0
196 710 1.0
196 744 1.0
196 401 1.0
196 414 1.0
196 969 1.0
196 215 1.0
196 283 1.0
196 207 1.0
196 584 1.0
196 728 1.0
196 576 1.0
196 665 1.0
196 932 1.0
197 225 1.0
197 382 1.0
197 738 1.0
197 746 1.0
197 285 1.0
197 979 1.0
197 353 1.0
197 298 1.0
197 578 1.0
197 324 1.0
197 680 1.0
197 316 1.0
197 968 1.0
197 685 1.0
197 719 1.0
197 635 1.0
197 813 1.0
197 970 1.0
197 483 1.0
197 517 1.0
197 983 1.0
197 323 1.0
197 378 1.0
197 802 1.0
197 946 1.0
197 205 1.0
197 362 1.0
197 252 1.0
197 540 1.0
197 608 1.0
197 828 1.0
197 435 1.0
197 880 1.0
197 427 1.0
197 749 1.0
197 440 1.0
197 859 1.0
197 555 1.0
198 678 1.0
198 623 1.0
198 335 1.0
198 424 1.0
198 712 1.0
198 382 1.0
198 916 1.0
198 662 1.0
198 565 1.0
198 688 1.0
198 832 1.0
198 502 1.0
198 248 1.0
198 583 1.0
198 761 1.0
198 706 1.0
198 842 1.0
198 588 1.0
198 800 1.0
198 889 1.0
198 559 1.0
198 716 1.0
198 661 1.0
198 729 1.0
198 915 1.0
198 564 1.0
198 200 1.0
198 336 1.0
198 239 1.0
198 273 1.0
198 650 1.0
198 752 1.0
198 875 1.0
198 909 1.0
198 634 1.0
198 668 1.0
198 647 1.0
198 914 1.0
198 948 1.0
198 694 1.0
198 872 1.0
198 673 1.0
198 233 1.0
199 929 1.0
199 921 1.0
199 947 1.0
199 371 1.0
199 803 1.0
199 295 1.0
199 329 1.0
199 800 1.0
199 703 1.0
199 627 1.0
199 839 1.0
199 653 1.0
199 996 1.0
199 200 1.0
199 255 1.0
199 336 1.0
199 383 1.0
199 527 1.0
199 629 1.0
199 265 1.0
199 744 1.0
199 833 1.0
199 647 1.0
199 880 1.0
199 694 1.0
199 927 1.0
199 576 1.0
199 686 1.0
199 500 1.0
199 678 1.0
199 945 1.0
199 403 1.0
199 992 1.0
199 327 1.0
200 856 1.0
200 636 1.0
200 348 1.0
200 620 1.0
200 502 1.0
200 481 1.0
200 960 1.0
200 761 1.0
200 706 1.0
200 795 1.0
200 905 1.0
200 719 1.0
200 994 1.0
200 677 1.0
200 999 1.0
200 368 1.0
200 224 1.0
200 635 1.0
200 690 1.0
200 834 1.0
200 407 1.0
200 352 1.0
200 585 1.0
200 674 1.0
200 276 1.0
200 323 1.0
200 493 1.0
200 883 1.0
200 972 1.0
200 443 1.0
200 744 1.0
200 922 1.0
200 545 1.0
200 812 1.0
200 668 1.0
200 846 1.0
200 943 1.0
200 592 1.0
200 681 1.0
200 783 1.0
200 220 1.0
201 413 1.0
201 735 1.0
201 274 1.0
201 562 1.0
201 664 1.0
201 266 1.0
201 499 1.0
201 554 1.0
201 588 1.0
201 601 1.0
201 216 1.0
201 881 1.0
201 910 1.0
201 496 1.0
201 653 1.0
201 734 1.0
201 294 1.0
201 438 1.0
201 561 1.0
201 862 1.0
201 286 1.0
201 503 1.0
201 448 1.0
201 283 1.0
201 592 1.0
201 241 1.0
201 275 1.0
201 385 1.0
201 432 1.0
201 267 1.0
201 610 1.0
201 678 1.0
201 733 1.0
201 348 1.0
201 382 1.0
201 725 1.0
201 754 1.0
201 830 1.0
201 552 1.0
201 953 1.0
201 942 1.0
201 966 1.0
202 746 1.0
202 492 1.0
202 293 1.0
202 717 1.0
202 489 1.0
202 659 1.0
202 350 1.0
202 727 1.0
202 685 1.0
202 287 1.0
202 232 1.0
202 342 1.0
202 520 1.0
202 601 1.0
202 834 1.0
202 436 1.0
202 868 1.0
202 716 1.0
202 729 1.0
202 208 1.0
202 420 1.0
202 920 1.0
202 700 1.0
202 412 1.0
202 878 1.0
202 281 1.0
202 603 1.0
202 891 1.0
202 349 1.0
202 904 1.0
202 616 1.0
202 417 1.0
202 396 1.0
202 532 1.0
202 257 1.0
202 346 1.0
202 901 1.0
202 935 1.0
202 393 1.0
202 762 1.0
202 707 1.0
202 275 1.0
202 699 1.0
202 644 1.0
203 222 1.0
203 654 1.0
203 337 1.0
203 701 1.0
203 583 1.0
203 465 1.0
203 410 1.0
203 499 1.0
203 554 1.0
203 698 1.0
203 292 1.0
203 504 1.0
203 339 1.0
203 606 1.0
203 263 1.0
203 732 1.0
203 454 1.0
203 912 1.0
203 425 1.0
203 603 1.0
203 239 1.0
203 616 1.0
203 252 1.0
203 485 1.0
203 846 1.0
203 325 1.0
203 626 1.0
203 427 1.0
203 948 1.0
203 796 1.0
203 453 1.0
203 521 1.0
203 610 1.0
203 301 1.0
203 712 1.0
203 809 1.0
203 725 1.0
203 848 1.0
203 327 1.0
204 675 1.0
204 434 1.0
204 214 1.0
204 858 1.0
204 460 1.0
204 782 1.0
204 816 1.0
204 947 1.0
204 766 1.0
204 784 1.0
204 433 1.0
204 857 1.0
204 336 1.0
204 925 1.0
204 328 1.0
204 794 1.0
204 286 1.0
204 498 1.0
204 731 1.0
204 668 1.0
204 325 1.0
204 503 1.0
204 283 1.0
204 749 1.0
204 817 1.0
204 487 1.0
204 935 1.0
204 699 1.0
204 301 1.0
204 500 1.0
204 534 1.0
204 948 1.0
205 290 1.0
205 701 1.0
205 350 1.0
205 638 1.0
205 706 1.0
205 808 1.0
205 520 1.0
205 842 1.0
205 952 1.0
205 567 1.0
205 572 1.0
205 627 1.0
205 263 1.0
205 462 1.0
205 585 1.0
205 234 1.0
205 789 1.0
205 391 1.0
205 988 1.0
205 925 1.0
205 417 1.0
205 697 1.0
205 354 1.0
205 883 1.0
205 930 1.0
205 380 1.0
205 414 1.0
205 825 1.0
205 817 1.0
205 597 1.0
205 644 1.0
205 212 1.0
205 979 1.0
205 259 1.0
205 958 1.0
205 450 1.0
205 505 1.0
206 623 1.0
206 547 1.0
206 327 1.0
206 772 1.0
206 916 1.0
206 497 1.0
206 908 1.0
206 798 1.0
206 934 1.0
206 358 1.0
206 625 1.0
206 211 1.0
206 656 1.0
206 703 1.0
206 449 1.0
206 538 1.0
206 284 1.0
206 839 1.0
206 234 1.0
206 412 1.0
206 268 1.0
206 535 1.0
206 671 1.0
206 417 1.0
206 485 1.0
206 286 1.0
206 820 1.0
206 998 1.0
206 312 1.0
206 723 1.0
206 736 1.0
206 249 1.0
206 749 1.0
206 406 1.0
206 673 1.0
206 563 1.0
206 885 1.0
206 343 1.0
206 432 1.0
206 610 1.0
206 555 1.0
206 212 1.0
207 555 1.0
207 767 1.0
207 780 1.0
207 903 1.0
207 272 1.0
207 717 1.0
207 285 1.0
207 751 1.0
207 434 1.0
207 379 1.0
207 837 1.0
207 316 1.0
207 871 1.0
207 761 1.0
207 829 1.0
207 952 1.0
207 520 1.0
207 609 1.0
207 787 1.0
207 368 1.0
207 347 1.0
207 991 1.0
207 860 1.0
207 661 1.0
207 805 1.0
207 983 1.0
207 208 1.0
207 530 1.0
207 619 1.0
207 810 1.0
207 666 1.0
207 700 1.0
207 535 1.0
207 946 1.0
207 980 1.0
207 925 1.0
207 273 1.0
207 218 1.0
207 396 1.0
207 917 1.0
207 524 1.0
207 215 1.0
207 338 1.0
207 893 1.0
207 995 1.0
207 576 1.0
208 958 1.0
208 594 1.0
208 628 1.0
208 429 1.0
208 895 1.0
208 950 1.0
208 963 1.0
208 565 1.0
208 510 1.0
208 489 1.0
208 722 1.0
208 777 1.0
208 989 1.0
208 324 1.0
208 269 1.0
208 947 1.0
208 494 1.0
208 329 1.0
208 774 1.0
208 719 1.0
208 376 1.0
208 368 1.0
208 457 1.0
208 656 1.0
208 690 1.0
208 779 1.0
208 716 1.0
208 784 1.0
208 386 1.0
208 310 1.0
208 899 1.0
208 883 1.0
208 307 1.0
208 752 1.0
208 469 1.0
208 448 1.0
208 571 1.0
208 550 1.0
208 474 1.0
208 220 1.0
208 487 1.0
208 233 1.0
209 693 1.0
209 363 1.0
209 787 1.0
209 245 1.0
209 889 1.0
209 250 1.0
209 784 1.0
209 818 1.0
209 907 1.0
209 611 1.0
209 928 1.0
209 446 1.0
209 747 1.0
209 912 1.0
209 210 1.0
209 896 1.0
209 490 1.0
209 956 1.0
209 215 1.0
209 304 1.0
209 338 1.0
209 495 1.0
209 377 1.0
209 432 1.0
209 445 1.0
209 796 1.0
209 835 1.0
209 843 1.0
209 903 1.0
209 560 1.0
209 751 1.0
209 874 1.0
209 982 1.0
210 479 1.0
210 814 1.0
210 382 1.0
210 958 1.0
210 594 1.0
210 573 1.0
210 840 1.0
210 908 1.0
210 942 1.0
210 722 1.0
210 968 1.0
210 659 1.0
210 549 1.0
210 816 1.0
210 706 1.0
210 719 1.0
210 863 1.0
210 588 1.0
210 868 1.0
210 237 1.0
210 271 1.0
210 881 1.0
210 805 1.0
210 606 1.0
210 318 1.0
210 967 1.0
210 768 1.0
210 896 1.0
210 388 1.0
210 566 1.0
210 223 1.0
210 584 1.0
210 796 1.0
210 220 1.0
210 508 1.0
210 487 1.0
210 953 1.0
210 843 1.0
210 974 1.0
210 356 1.0
211 479 1.0
211 581 1.0
211 869 1.0
211 382 1.0
211 903 1.0
211 937 1.0
211 895 1.0
211 387 1.0
211 476 1.0
211 256 1.0
211 680 1.0
211 947 1.0
211 693 1.0
211 350 1.0
211 677 1.0
211 656 1.0
211 745 1.0
211 834 1.0
211 415 1.0
211 873 1.0
211 585 1.0
211 297 1.0
211 564 1.0
211 344 1.0
211 391 1.0
211 425 1.0
211 726 1.0
211 294 1.0
211 671 1.0
211 430 1.0
211 985 1.0
211 697 1.0
211 532 1.0
211 367 1.0
211 838 1.0
211 317 1.0
211 762 1.0
211 254 1.0
211 754 1.0
211 466 1.0
212 395 1.0
212 463 1.0
212 861 1.0
212 976 1.0
212 701 1.0
212 777 1.0
212 913 1.0
212 253 1.0
212 698 1.0
212 334 1.0
212 224 1.0
212 258 1.0
212 355 1.0
212 805 1.0
212 255 1.0
212 679 1.0
212 802 1.0
212 459 1.0
212 273 1.0
212 739 1.0
212 333 1.0
212 799 1.0
212 723 1.0
212 469 1.0
212 249 1.0
212 626 1.0
212 757 1.0
212 825 1.0
212 880 1.0
212 969 1.0
212 665 1.0
212 699 1.0
213 457 1.0
213 923 1.0
213 703 1.0
213 271 1.0
213 517 1.0
213 263 1.0
213 729 1.0
213 996 1.0
213 281 1.0
213 370 1.0
213 836 1.0
213 807 1.0
213 498 1.0
213 312 1.0
213 668 1.0
213 914 1.0
213 385 1.0
213 830 1.0
213 343 1.0
213 233 1.0
213 377 1.0
213 335 1.0
213 225 1.0
213 424 1.0
213 479 1.0
213 521 1.0
213 534 1.0
213 539 1.0
213 657 1.0
213 586 1.0
213 843 1.0
213 565 1.0
213 688 1.0
213 523 1.0
213 777 1.0
213 913 1.0
213 919 1.0
213 549 1.0
213 295 1.0
213 945 1.0
213 955 1.0
213 465 1.0
213 698 1.0
213 821 1.0
214 560 1.0
214 450 1.0
214 861 1.0
214 958 1.0
214 963 1.0
214 557 1.0
214 722 1.0
214 481 1.0
214 460 1.0
214 664 1.0
214 698 1.0
214 554 1.0
214 245 1.0
214 868 1.0
214 470 1.0
214 970 1.0
214 496 1.0
214 640 1.0
214 708 1.0
214 886 1.0
214 255 1.0
214 679 1.0
214 281 1.0
214 655 1.0
214 456 1.0
214 257 1.0
214 639 1.0
214 885 1.0
214 555 1.0
215 246 1.0
215 390 1.0
215 403 1.0
215 492 1.0
215 670 1.0
215 903 1.0
215 264 1.0
215 908 1.0
215 769 1.0
215 316 1.0
215 871 1.0
215 981 1.0
215 232 1.0
215 821 1.0
215 313 1.0
215 525 1.0
215 546 1.0
215 902 1.0
215 910 1.0
215 994 1.0
215 386 1.0
215 920 1.0
215 776 1.0
215 679 1.0
215 637 1.0
215 726 1.0
215 540 1.0
215 760 1.0
215 820 1.0
215 244 1.0
215 422 1.0
215 943 1.0
215 969 1.0
215 249 1.0
215 351 1.0
215 940 1.0
215 665 1.0
216 861 1.0
216 235 1.0
216 803 1.0
216 837 1.0
216 892 1.0
216 308 1.0
216 994 1.0
216 732 1.0
216 792 1.0
216 360 1.0
216 373 1.0
216 784 1.0
216 564 1.0
216 433 1.0
216 234 1.0
216 467 1.0
216 425 1.0
216 522 1.0
216 561 1.0
216 619 1.0
216 540 1.0
216 684 1.0
216 498 1.0
216 708 1.0
216 621 1.0
216 689 1.0
216 718 1.0
216 802 1.0
216 325 1.0
216 852 1.0
216 943 1.0
216 406 1.0
216 961 1.0
216 652 1.0
216 432 1.0
216 953 1.0
216 993 1.0
216 246 1.0
216 390 1.0
217 238 1.0
217 437 1.0
217 594 1.0
217 251 1.0
217 374 1.0
217 463 1.0
217 387 1.0
217 484 1.0
217 743 1.0
217 934 1.0
217 625 1.0
217 515 1.0
217 947 1.0
217 562 1.0
217 918 1.0
217 575 1.0
217 520 1.0
217 855 1.0
217 258 1.0
217 745 1.0
217 381 1.0
217 881 1.0
217 496 1.0
217 598 1.0
217 692 1.0
217 883 1.0
217 841 1.0
217 875 1.0
217 655 1.0
217 757 1.0
217 770 1.0
217 914 1.0
217 961 1.0
217 563 1.0
217 254 1.0
217 665 1.0
218 772 1.0
218 408 1.0
218 243 1.0
218 298 1.0
218 667 1.0
218 900 1.0
218 879 1.0
218 507 1.0
218 706 1.0
218 905 1.0
218 821 1.0
218 910 1.0
218 326 1.0
218 601 1.0
218 640 1.0
218 564 1.0
218 792 1.0
218 700 1.0
218 451 1.0
218 341 1.0
218 697 1.0
218 621 1.0
218 807 1.0
218 579 1.0
218 909 1.0
218 922 1.0
218 338 1.0
218 673 1.0
218 699 1.0
218 445 1.0
218 801 1.0
218 369 1.0
218 966 1.0
219 890 1.0
219 895 1.0
219 840 1.0
219 874 1.0
219 243 1.0
219 222 1.0
219 392 1.0
219 531 1.0
219 316 1.0
219 240 1.0
219 507 1.0
219 557 1.0
219 727 1.0
219 774 1.0
219 845 1.0
219 866 1.0
219 703 1.0
219 538 1.0
219 962 1.0
219 543 1.0
219 234 1.0
219 556 1.0
219 336 1.0
219 422 1.0
219 346 1.0
219 613 1.0
219 901 1.0
219 249 1.0
219 550 1.0
219 597 1.0
219 741 1.0
220 568 1.0
220 801 1.0
220 403 1.0
220 547 1.0
220 772 1.0
220 463 1.0
220 518 1.0
220 751 1.0
220 827 1.0
220 489 1.0
220 840 1.0
220 916 1.0
220 955 1.0
220 719 1.0
220 732 1.0
220 622 1.0
220 313 1.0
220 868 1.0
220 771 1.0
220 496 1.0
220 475 1.0
220 818 1.0
220 608 1.0
220 841 1.0
220 655 1.0
220 909 1.0
220 634 1.0
220 880 1.0
220 770 1.0
220 990 1.0
220 998 1.0
220 686 1.0
220 343 1.0
220 610 1.0
221 390 1.0
221 458 1.0
221 890 1.0
221 903 1.0
221 471 1.0
221 573 1.0
221 552 1.0
221 497 1.0
221 743 1.0
221 489 1.0
221 544 1.0
221 625 1.0
221 850 1.0
221 884 1.0
221 719 1.0
221 499 1.0
221 800 1.0
221 784 1.0
221 873 1.0
221 344 1.0
221 323 1.0
221 302 1.0
221 522 1.0
221 226 1.0
221 582 1.0
221 624 1.0
221 304 1.0
221 927 1.0
221 474 1.0
221 851 1.0
221 974 1.0
222 767 1.0
222 869 1.0
222 526 1.0
222 937 1.0
222 306 1.0
222 573 1.0
222 963 1.0
222 298 1.0
222 455 1.0
222 955 1.0
222 591 1.0
222 316 1.0
222 287 1.0
222 753 1.0
222 787 1.0
222 402 1.0
222 326 1.0
222 648 1.0
222 365 1.0
222 454 1.0
222 742 1.0
222 323 1.0
222 467 1.0
222 755 1.0
222 768 1.0
222 975 1.0
222 891 1.0
222 540 1.0
222 545 1.0
222 723 1.0
222 901 1.0
222 270 1.0
222 474 1.0
222 254 1.0
223 712 1.0
223 314 1.0
223 890 1.0
223 793 1.0
223 450 1.0
223 827 1.0
223 607 1.0
223 366 1.0
223 303 1.0
223 591 1.0
223 227 1.0
223 651 1.0
223 918 1.0
223 698 1.0
223 499 1.0
223 656 1.0
223 601 1.0
223 779 1.0
223 826 1.0
223 483 1.0
223 538 1.0
223 653 1.0
223 543 1.0
223 255 1.0
223 467 1.0
223 446 1.0
223 569 1.0
223 891 1.0
223 959 1.0
223 595 1.0
223 917 1.0
223 252 1.0
223 409 1.0
223 477 1.0
223 600 1.0
223 689 1.0
223 969 1.0
223 859 1.0
223 927 1.0
223 495 1.0
223 584 1.0
223 851 1.0
223 542 1.0
224 568 1.0
224 657 1.0
224 526 1.0
224 738 1.0
224 827 1.0
224 628 1.0
224 717 1.0
224 743 1.0
224 489 1.0
224 570 1.0
224 892 1.0
224 871 1.0
224 418 1.0
224 473 1.0
224 609 1.0
224 842 1.0
224 389 1.0
224 952 1.0
224 457 1.0
224 669 1.0
224 593 1.0
224 771 1.0
224 860 1.0
224 789 1.0
224 302 1.0
224 446 1.0
224 315 1.0
224 692 1.0
224 938 1.0
224 739 1.0
224 519 1.0
224 545 1.0
224 749 1.0
224 385 1.0
224 529 1.0
224 631 1.0
224 377 1.0
225 733 1.0
225 911 1.0
225 835 1.0
225 945 1.0
225 484 1.0
225 840 1.0
225 264 1.0
225 599 1.0
225 256 1.0
225 688 1.0
225 921 1.0
225 371 1.0
225 405 1.0
225 583 1.0
225 829 1.0
225 342 1.0
225 664 1.0
225 313 1.0
225 902 1.0
225 559 1.0
225 737 1.0
225 792 1.0
225 517 1.0
225 784 1.0
225 543 1.0
225 488 1.0
225 904 1.0
225 409 1.0
225 498 1.0
225 333 1.0
225 312 1.0
225 456 1.0
225 359 1.0
225 574 1.0
225 283 1.0
225 579 1.0
225 474 1.0
225 639 1.0
225 896 1.0
225 922 1.0
226 759 1.0
226 429 1.0
226 921 1.0
226 248 1.0
226 604 1.0
226 659 1.0
226 714 1.0
226 473 1.0
226 740 1.0
226 431 1.0
226 821 1.0
226 876 1.0
226 860 1.0
226 297 1.0
226 344 1.0
226 679 1.0
226 514 1.0
226 294 1.0
226 498 1.0
226 655 1.0
226 998 1.0
226 380 1.0
226 338 1.0
226 406 1.0
226 469 1.0
226 516 1.0
226 838 1.0
226 411 1.0
227 382 1.0
227 696 1.0
227 387 1.0
227 832 1.0
227 345 1.0
227 578 1.0
227 235 1.0
227 413 1.0
227 756 1.0
227 447 1.0
227 282 1.0
227 316 1.0
227 638 1.0
227 740 1.0
227 308 1.0
227 389 1.0
227 444 1.0
227 305 1.0
227 483 1.0
227 839 1.0
227 784 1.0
227 928 1.0
227 352 1.0
227 687 1.0
227 899 1.0
227 789 1.0
227 713 1.0
227 425 1.0
227 459 1.0
227 451 1.0
227 663 1.0
227 841 1.0
227 477 1.0
227 744 1.0
227 914 1.0
227 639 1.0
227 440 1.0
227 686 1.0
227 521 1.0
227 665 1.0
227 411 1.0
228 463 1.0
228 476 1.0
228 675 1.0
228 756 1.0
228 879 1.0
228 905 1.0
228 329 1.0
228 740 1.0
228 698 1.0
228 643 1.0
228 449 1.0
228 789 1.0
228 472 1.0
228 846 1.0
228 503 1.0
228 626 1.0
228 482 1.0
228 982 1.0
228 872 1.0
228 898 1.0
228 267 1.0
228 699 1.0
228 801 1.0
228 348 1.0
228 437 1.0
228 636 1.0
229 437 1.0
229 730 1.0
229 345 1.0
229 337 1.0
229 541 1.0
229 486 1.0
229 596 1.0
229 588 1.0
229 491 1.0
229 669 1.0
229 538 1.0
229 551 1.0
229 365 1.0
229 941 1.0
229 878 1.0
229 569 1.0
229 747 1.0
229 561 1.0
229 417 1.0
229 430 1.0
229 697 1.0
229 511 1.0
229 744 1.0
229 537 1.0
229 770 1.0
229 977 1.0
229 817 1.0
229 872 1.0
229 597 1.0
229 377 1.0
229 521 1.0
229 911 1.0
229 856 1.0
230 704 1.0
230 539 1.0
230 573 1.0
230 709 1.0
230 989 1.0
230 447 1.0
230 926 1.0
230 439 1.0
230 562 1.0
230 918 1.0
230 622 1.0
230 737 1.0
230 462 1.0
230 234 1.0
230 391 1.0
230 959 1.0
230 383 1.0
230 595 1.0
230 608 1.0
230 752 1.0
230 799 1.0
230 985 1.0
230 812 1.0
230 236 1.0
230 524 1.0
230 626 1.0
230 702 1.0
230 770 1.0
230 872 1.0
230 563 1.0
230 901 1.0
230 576 1.0
230 610 1.0
230 990 1.0
230 998 1.0
230 513 1.0
231 500 1.0
231 877 1.0
231 945 1.0
231 327 1.0
231 272 1.0
231 552 1.0
231 840 1.0
231 442 1.0
231 400 1.0
231 722 1.0
231 591 1.0
231 680 1.0
231 473 1.0
231 939 1.0
231 308 1.0
231 808 1.0
231 232 1.0
231 876 1.0
231 732 1.0
231 944 1.0
231 546 1.0
231 614 1.0
231 551 1.0
231 352 1.0
231 268 1.0
231 658 1.0
231 260 1.0
231 904 1.0
231 760 1.0
231 841 1.0
231 833 1.0
231 257 1.0
231 846 1.0
231 393 1.0
231 804 1.0
231 584 1.0
231 385 1.0
231 364 1.0
231 830 1.0
231 919 1.0
231 720 1.0
231 974 1.0
232 335 1.0
232 280 1.0
232 479 1.0
232 395 1.0
232 963 1.0
232 455 1.0
232 434 1.0
232 324 1.0
232 591 1.0
232 460 1.0
232 871 1.0
232 240 1.0
232 418 1.0
232 918 1.0
232 766 1.0
232 682 1.0
232 826 1.0
232 606 1.0
232 386 1.0
232 268 1.0
232 967 1.0
232 493 1.0
232 383 1.0
232 451 1.0
232 286 1.0
232 760 1.0
232 422 1.0
232 710 1.0
232 875 1.0
232 888 1.0
232 990 1.0
232 762 1.0
232 377 1.0
232 932 1.0
233 361 1.0
233 586 1.0
233 531 1.0
233 751 1.0
233 937 1.0
233 261 1.0
233 405 1.0
233 727 1.0
233 795 1.0
233 342 1.0
233 355 1.0
233 719 1.0
233 690 1.0
233 944 1.0
233 538 1.0
233 407 1.0
233 297 1.0
233 399 1.0
233 509 1.0
233 771 1.0
233 831 1.0
233 836 1.0
233 273 1.0
233 938 1.0
233 430 1.0
233 422 1.0
233 723 1.0
233 338 1.0
233 838 1.0
233 707 1.0
233 563 1.0
233 322 1.0
233 445 1.0
233 720 1.0
233 835 1.0
234 259 1.0
234 738 1.0
234 463 1.0
234 442 1.0
234 803 1.0
234 672 1.0
234 355 1.0
234 622 1.0
234 423 1.0
234 567 1.0
234 902 1.0
234 708 1.0
234 797 1.0
234 975 1.0
234 522 1.0
234 802 1.0
234 370 1.0
234 396 1.0
234 697 1.0
234 354 1.0
234 532 1.0
234 388 1.0
234 422 1.0
234 655 1.0
234 778 1.0
234 435 1.0
234 626 1.0
234 809 1.0
234 644 1.0
234 843 1.0
235 311 1.0
235 680 1.0
235 714 1.0
235 727 1.0
235 384 1.0
235 795 1.0
235 308 1.0
235 342 1.0
235 287 1.0
235 588 1.0
235 478 1.0
235 368 1.0
235 258 1.0
235 436 1.0
235 512 1.0
235 538 1.0
235 596 1.0
235 685 1.0
235 868 1.0
235 876 1.0
235 892 1.0
235 941 1.0
235 323 1.0
235 679 1.0
235 459 1.0
235 527 1.0
235 676 1.0
235 312 1.0
235 367 1.0
235 469 1.0
235 668 1.0
235 796 1.0
235 343 1.0
235 411 1.0
235 432 1.0
235 712 1.0
235 835 1.0
235 864 1.0
235 560 1.0
235 950 1.0
236 267 1.0
236 356 1.0
236 555 1.0
236 856 1.0
236 882 1.0
236 861 1.0
236 696 1.0
236 730 1.0
236 654 1.0
236 832 1.0
236 248 1.0
236 947 1.0
236 528 1.0
236 905 1.0
236 452 1.0
236 541 1.0
236 486 1.0
236 808 1.0
236 918 1.0
236 842 1.0
236 300 1.0
236 258 1.0
236 271 1.0
236 394 1.0
236 504 1.0
236 407 1.0
236 564 1.0
236 598 1.0
236 920 1.0
236 344 1.0
236 577 1.0
236 624 1.0
236 569 1.0
236 603 1.0
236 404 1.0
236 959 1.0
236 472 1.0
236 273 1.0
236 650 1.0
236 629 1.0
236 464 1.0
236 346 1.0
236 668 1.0
236 330 1.0
236 563 1.0
236 508 1.0
236 398 1.0
236 487 1.0
237 822 1.0
237 513 1.0
237 759 1.0
237 272 1.0
237 251 1.0
237 319 1.0
237 675 1.0
237 976 1.0
237 947 1.0
237 282 1.0
237 651 1.0
237 795 1.0
237 588 1.0
237 300 1.0
237 423 1.0
237 457 1.0
237 402 1.0
237 601 1.0
237 436 1.0
237 923 1.0
237 627 1.0
237 915 1.0
237 284 1.0
237 962 1.0
237 653 1.0
237 797 1.0
237 522 1.0
237 268 1.0
237 802 1.0
237 891 1.0
237 870 1.0
237 671 1.0
237 650 1.0
237 485 1.0
237 286 1.0
237 786 1.0
237 587 1.0
237 422 1.0
237 833 1.0
237 901 1.0
237 414 1.0
237 270 1.0
237 817 1.0
237 241 1.0
237 995 1.0
237 487 1.0
237 720 1.0
238 471 1.0
238 785 1.0
238 874 1.0
238 887 1.0
238 290 1.0
238 379 1.0
238 269 1.0
238 248 1.0
2
gitextract_5m1t25tj/
├── .gitignore
├── .gitmodules
├── Algorithms/
│ ├── 2008-CliquePercolation/
│ │ ├── ReadMe.md
│ │ ├── algorithm_example.py
│ │ ├── conradlee_clique_percolation.py
│ │ ├── example_edge_list.txt
│ │ ├── src_cpp/
│ │ │ ├── CMakeLists.txt
│ │ │ ├── ReadMe.md
│ │ │ ├── cliqueHash.cpp
│ │ │ ├── cliqueHash.h
│ │ │ ├── communityTracker.cpp
│ │ │ ├── communityTracker.h
│ │ │ ├── dendrogram.cpp
│ │ │ ├── dendrogram.h
│ │ │ ├── doc/
│ │ │ │ ├── License.txt
│ │ │ │ └── makefile
│ │ │ ├── k_clique.cpp
│ │ │ ├── k_clique.h
│ │ │ ├── kruskal.cpp
│ │ │ ├── kruskal.h
│ │ │ ├── nodeCommunities.cpp
│ │ │ ├── nodeCommunities.h
│ │ │ ├── script/
│ │ │ │ └── testScp.py
│ │ │ ├── testData/
│ │ │ │ ├── random_1000_005.edg
│ │ │ │ └── random_1000_005.edg_files/
│ │ │ │ ├── k=3/
│ │ │ │ │ └── communities
│ │ │ │ ├── k=4/
│ │ │ │ │ └── communities
│ │ │ │ └── k=5/
│ │ │ │ └── communities
│ │ │ ├── weighedClique.cpp
│ │ │ └── weighedClique.h
│ │ └── src_python/
│ │ └── seq_clique_percolation.py
│ ├── 2009-Connected-Iterative-Scan/
│ │ ├── .gitignore
│ │ ├── ReadMe.md
│ │ ├── src-orginal/
│ │ │ ├── Libraries/
│ │ │ │ ├── Files/
│ │ │ │ │ ├── IOX.cc
│ │ │ │ │ ├── IOX.h
│ │ │ │ │ ├── StringEx.cc
│ │ │ │ │ ├── StringEx.h
│ │ │ │ │ ├── files.cc
│ │ │ │ │ └── makefile
│ │ │ │ ├── Network/
│ │ │ │ │ ├── Format.cc
│ │ │ │ │ ├── Format.h
│ │ │ │ │ ├── LibNetwork.cc
│ │ │ │ │ ├── Network.cc
│ │ │ │ │ ├── Network.h
│ │ │ │ │ ├── RandomNetwork.h
│ │ │ │ │ ├── TemporalNetwork.cc
│ │ │ │ │ ├── TemporalNetwork.h
│ │ │ │ │ └── makefile
│ │ │ │ └── Params/
│ │ │ │ ├── Parameters.cc
│ │ │ │ ├── Parameters.h
│ │ │ │ └── makefile
│ │ │ ├── ReadMe.md
│ │ │ ├── demo/
│ │ │ │ ├── karate_edges_input_modified.csv
│ │ │ │ ├── karate_output.csv
│ │ │ │ ├── network.cl
│ │ │ │ └── network_seeded.cl
│ │ │ ├── main.cc
│ │ │ └── makefile
│ │ └── src-refactor/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── dataset/
│ │ │ ├── karate_edges_input_modified.csv
│ │ │ ├── karate_output.csv
│ │ │ ├── network.cl
│ │ │ └── network_seeded.cl
│ │ ├── graph/
│ │ │ ├── network.cc
│ │ │ ├── network.h
│ │ │ ├── temporal_network.cc
│ │ │ └── temporal_network.h
│ │ ├── main.cc
│ │ ├── useless/
│ │ │ └── RandomNetwork.h
│ │ └── util/
│ │ ├── graph_io_helper.cc
│ │ ├── graph_io_helper.h
│ │ ├── io_helper.cc
│ │ ├── io_helper.h
│ │ ├── parameters_helper.cc
│ │ ├── parameters_helper.h
│ │ ├── string_helper.cc
│ │ └── string_helper.h
│ ├── 2009-EAGLE/
│ │ ├── .gitignore
│ │ ├── ReadMe.md
│ │ ├── graphs/
│ │ │ ├── eagle.edl
│ │ │ ├── eagle.graphml
│ │ │ ├── generate.sh
│ │ │ ├── originals/
│ │ │ │ └── eagle
│ │ │ └── tools/
│ │ │ ├── converter.py
│ │ │ ├── examples.py
│ │ │ ├── progressbar.py
│ │ │ └── utils.pyx
│ │ ├── relazione/
│ │ │ ├── Makefile
│ │ │ └── relazione.lyx
│ │ └── src/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── communities.cpp
│ │ ├── communities.h
│ │ ├── eagle.cpp
│ │ ├── eagle.h
│ │ ├── main.cpp
│ │ ├── max_cache.cpp
│ │ └── max_cache.h
│ ├── 2009-LineGraph/
│ │ ├── altix/
│ │ │ ├── axlgc.sh
│ │ │ └── axmakelgc.sh
│ │ ├── deprecated/
│ │ │ ├── LineGraphCreator.html
│ │ │ ├── lgc.bat
│ │ │ ├── makefileClever
│ │ │ ├── makefileTSE
│ │ │ └── makelgc.bat
│ │ ├── readme.txt
│ │ └── src/
│ │ ├── TseGraph.cpp
│ │ ├── TseGraph.h
│ │ └── main.cpp
│ ├── 2010-CONGA/
│ │ ├── ReadMe.md
│ │ └── conga_src/
│ │ ├── ReadMe.md
│ │ ├── dataset/
│ │ │ ├── dolphins_edges.txt
│ │ │ └── karate.txt
│ │ ├── pom.xml
│ │ └── src/
│ │ └── main/
│ │ ├── java/
│ │ │ ├── clique_modularity/
│ │ │ │ ├── CM.java
│ │ │ │ ├── algorithm/
│ │ │ │ │ ├── BK/
│ │ │ │ │ │ ├── BK.java
│ │ │ │ │ │ └── BronKerboschCFFast.java
│ │ │ │ │ ├── KJ/
│ │ │ │ │ │ └── KJ.java
│ │ │ │ │ └── MaxClique.java
│ │ │ │ ├── input_output/
│ │ │ │ │ ├── ReadEdges.java
│ │ │ │ │ └── WriteCliques.java
│ │ │ │ └── util/
│ │ │ │ ├── ARRAY2.java
│ │ │ │ ├── ARRAY_FIX.java
│ │ │ │ ├── Pair.java
│ │ │ │ ├── Tree.java
│ │ │ │ ├── benchmark/
│ │ │ │ │ ├── GG.java
│ │ │ │ │ └── GGResult.java
│ │ │ │ ├── community/
│ │ │ │ │ ├── CPP.java
│ │ │ │ │ ├── CommPair.java
│ │ │ │ │ ├── CommPairSet.java
│ │ │ │ │ ├── CompleteCliques.java
│ │ │ │ │ ├── CompleteCliques1.java
│ │ │ │ │ ├── RebuildCommunities.java
│ │ │ │ │ └── RemoveCliques.java
│ │ │ │ ├── graph/
│ │ │ │ │ └── ELEMENT.java
│ │ │ │ └── metric/
│ │ │ │ ├── Modularity.java
│ │ │ │ └── Omega.java
│ │ │ ├── conga/
│ │ │ │ ├── CONGA.java
│ │ │ │ ├── algorithm/
│ │ │ │ │ ├── Between.java
│ │ │ │ │ ├── CPP.java
│ │ │ │ │ └── PB.java
│ │ │ │ └── util/
│ │ │ │ ├── Pair.java
│ │ │ │ ├── StrPair.java
│ │ │ │ ├── Tree.java
│ │ │ │ ├── benchmark/
│ │ │ │ │ └── GResult.java
│ │ │ │ ├── community/
│ │ │ │ │ ├── BP.java
│ │ │ │ │ ├── ClusterInfo.java
│ │ │ │ │ └── Stats.java
│ │ │ │ ├── graph/
│ │ │ │ │ ├── Edge.java
│ │ │ │ │ ├── LabelledEdge.java
│ │ │ │ │ ├── Split.java
│ │ │ │ │ └── Vertex.java
│ │ │ │ └── metric/
│ │ │ │ └── ModOverlap.java
│ │ │ └── copra/
│ │ │ ├── Project.java
│ │ │ ├── algorithm/
│ │ │ │ └── COPRA.java
│ │ │ └── util/
│ │ │ ├── LabelPair.java
│ │ │ ├── SetPair.java
│ │ │ ├── VecPair.java
│ │ │ ├── Vert.java
│ │ │ ├── community/
│ │ │ │ └── ClusterLabel.java
│ │ │ └── metric/
│ │ │ └── ModOverlap.java
│ │ └── resources/
│ │ ├── CM.jar
│ │ ├── conga.jar
│ │ └── copra.jar
│ ├── 2010-LinkCommunity/
│ │ ├── README.markdown
│ │ ├── cpp/
│ │ │ ├── COPYING
│ │ │ ├── README
│ │ │ ├── calcAndWrite_Jaccards.cpp
│ │ │ ├── clusterJaccsFile.cpp
│ │ │ ├── edgelist2pairs.py
│ │ │ ├── karate.pairs
│ │ │ ├── lesmis.pairs
│ │ │ ├── link_clustering.sh
│ │ │ ├── loop_thresholds.sh
│ │ │ └── partition_density.py
│ │ ├── python/
│ │ │ ├── karate.pairs
│ │ │ └── link_clustering.py
│ │ └── python_yche_refactor/
│ │ ├── ReadMe.md
│ │ ├── example_edge_list.txt
│ │ ├── graph_io_helper.py
│ │ ├── link_clustering.py
│ │ ├── link_clustering_algo.py
│ │ ├── play_ground.py
│ │ └── results_sample/
│ │ ├── example_edge_list_maxS0.166667_maxD0.703704.comm2edges.txt
│ │ ├── example_edge_list_maxS0.166667_maxD0.703704.comm2nodes.txt
│ │ ├── example_edge_list_maxS0.166667_maxD0.703704.edge2comm.txt
│ │ └── example_edge_list_thr_D.txt
│ ├── 2010-TopGC/
│ │ ├── ReadMe.md
│ │ ├── src_original/
│ │ │ ├── Graphs/
│ │ │ │ ├── graph.sample
│ │ │ │ ├── graph.sample.clusters_directed
│ │ │ │ └── original/
│ │ │ │ ├── graph.raw
│ │ │ │ ├── graph1.idx
│ │ │ │ ├── graph1.raw
│ │ │ │ ├── graph_temp.idx
│ │ │ │ ├── graph_temp.raw
│ │ │ │ ├── graph_temp2.raw
│ │ │ │ ├── mkidx
│ │ │ │ └── mkidx.c
│ │ │ ├── README
│ │ │ ├── TopGC.jar
│ │ │ ├── edgew.txt
│ │ │ ├── idxdFile
│ │ │ └── mkidx.c
│ │ └── src_refactor/
│ │ ├── pom.xml
│ │ └── src/
│ │ └── main/
│ │ ├── java/
│ │ │ ├── FindMostProm.java
│ │ │ ├── HoldBucket.java
│ │ │ ├── HoldInt.java
│ │ │ ├── IntAndDouble.java
│ │ │ ├── LSH.java
│ │ │ ├── LSHThread.java
│ │ │ ├── LSH_Cluster.java
│ │ │ ├── Look3.java
│ │ │ ├── MaxHeap.java
│ │ │ ├── MinHeap.java
│ │ │ ├── Prime.java
│ │ │ ├── TempDouble2.java
│ │ │ └── TopGC.java
│ │ └── resources/
│ │ └── TopGC.jar
│ ├── 2010-iLCD/
│ │ ├── .gitignore
│ │ ├── ReadMe.md
│ │ ├── dataset/
│ │ │ └── exempleGraph.lnd
│ │ ├── doc/
│ │ │ └── ReadMe.rtf
│ │ ├── jars/
│ │ │ ├── iLCD-2013.jar
│ │ │ └── temporalGraphVisu.jar
│ │ └── src/
│ │ ├── pom.xml
│ │ └── src/
│ │ └── main/
│ │ └── java/
│ │ ├── CorePackage/
│ │ │ └── Main.java
│ │ ├── Inputs/
│ │ │ ├── InputCTNFhandler.java
│ │ │ ├── InputHandlerInterface.java
│ │ │ ├── InputNCOLhandler.java
│ │ │ └── InputOLDLNDhandler.java
│ │ ├── Outputs/
│ │ │ ├── OutputCTNF.java
│ │ │ ├── OutputHandlerInterface.java
│ │ │ ├── OutputMultipleHandler.java
│ │ │ ├── OutputStatic.java
│ │ │ └── OutputSummary.java
│ │ ├── TemporalNetworkManipulation/
│ │ │ ├── Community.java
│ │ │ ├── CoreProcessor.java
│ │ │ ├── Interface.java
│ │ │ ├── MyDate.java
│ │ │ ├── MyDateManager.java
│ │ │ ├── Network.java
│ │ │ ├── Node.java
│ │ │ ├── Operations/
│ │ │ │ ├── AddEdgeOperation.java
│ │ │ │ ├── BirthCommunityOperation.java
│ │ │ │ ├── ContractCommunityOperation.java
│ │ │ │ ├── DeathCommunityOperation.java
│ │ │ │ ├── FusionCommunityOperation.java
│ │ │ │ ├── GrowthCommunityOperation.java
│ │ │ │ ├── Operation.java
│ │ │ │ └── RemoveEdgeOperation.java
│ │ │ └── OperationsHandler.java
│ │ ├── communityDetectionPackage/
│ │ │ └── ILCDMetaAlgorithm.java
│ │ ├── implementable/
│ │ │ ├── Implementation.java
│ │ │ └── ImplementationRNHM.java
│ │ └── tools/
│ │ ├── DebugMode.java
│ │ ├── SortEdges.java
│ │ ├── Sorter.java
│ │ ├── TextFileHandler.java
│ │ └── ToolDate.java
│ ├── 2011-GCE/
│ │ ├── ReadMe.md
│ │ ├── src-original/
│ │ │ ├── Community_Finder.cpp
│ │ │ ├── Community_Finder.h
│ │ │ ├── Range.hpp
│ │ │ ├── Seed.cpp
│ │ │ ├── Seed.h
│ │ │ ├── aaron_utils.cpp
│ │ │ ├── aaron_utils.hpp
│ │ │ ├── build/
│ │ │ │ ├── .gitignore
│ │ │ │ ├── karate_edges_input.csv
│ │ │ │ ├── karate_gce_output.csv
│ │ │ │ └── makefile
│ │ │ ├── clique_percolation.hpp
│ │ │ ├── cliques.cpp
│ │ │ ├── cliques.hpp
│ │ │ ├── find_communities.cpp
│ │ │ ├── graph_analysis.hpp
│ │ │ ├── graph_loading.cpp
│ │ │ ├── graph_loading.hpp
│ │ │ ├── graph_representation.cpp
│ │ │ ├── graph_representation.hpp
│ │ │ ├── iterative.hpp
│ │ │ ├── modularity.hpp
│ │ │ └── options.hpp
│ │ └── src-refactor/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── algorithm/
│ │ │ ├── cliques.cpp
│ │ │ ├── cliques.hpp
│ │ │ ├── community_finder.cpp
│ │ │ ├── community_finder.h
│ │ │ ├── find_communities.cpp
│ │ │ ├── seed.cpp
│ │ │ └── seed.h
│ │ ├── useless/
│ │ │ ├── clique_percolation.hpp
│ │ │ ├── graph_analysis.hpp
│ │ │ ├── iterative.hpp
│ │ │ ├── modularity.hpp
│ │ │ └── options.hpp
│ │ └── util/
│ │ ├── aaron_utils.cpp
│ │ ├── aaron_utils.hpp
│ │ ├── graph/
│ │ │ ├── graph_loading.cpp
│ │ │ ├── graph_loading.hpp
│ │ │ ├── graph_representation.cpp
│ │ │ └── graph_representation.hpp
│ │ └── range.hpp
│ ├── 2011-MOSES/
│ │ ├── LICENSE-2.0.txt
│ │ ├── NOTICE
│ │ ├── ReadMe.md
│ │ ├── comment.txt
│ │ ├── src-original/
│ │ │ ├── Makefile
│ │ │ ├── Range.cpp
│ │ │ ├── Range.hpp
│ │ │ ├── aaron_utils.cpp
│ │ │ ├── aaron_utils.hpp
│ │ │ ├── gitstatus.cpp
│ │ │ ├── gitstatus.hpp
│ │ │ ├── graph_loading.cpp
│ │ │ ├── graph_loading.hpp
│ │ │ ├── graph_representation.cpp
│ │ │ ├── graph_representation.hpp
│ │ │ ├── groupStats.cpp
│ │ │ ├── grouping.cpp
│ │ │ ├── grouping.hpp
│ │ │ ├── iterative.hpp
│ │ │ ├── moses.cpp
│ │ │ ├── options.hpp
│ │ │ ├── overlapping.cpp
│ │ │ └── overlapping.hpp
│ │ └── src-refactor/
│ │ ├── CMakeLists.txt
│ │ ├── algorithm/
│ │ │ ├── ReadMe.md
│ │ │ ├── group_status_exec.cpp
│ │ │ ├── grouping.cpp
│ │ │ ├── grouping.hpp
│ │ │ ├── moses.cpp
│ │ │ ├── overlapping.cpp
│ │ │ └── overlapping.hpp
│ │ ├── doc/
│ │ │ ├── Makefile
│ │ │ └── comment.txt
│ │ └── util/
│ │ ├── aaron_utils.cpp
│ │ ├── aaron_utils.hpp
│ │ ├── graph/
│ │ │ ├── graph_loading.cpp
│ │ │ ├── graph_loading.hpp
│ │ │ ├── graph_representation.cpp
│ │ │ ├── graph_representation.hpp
│ │ │ └── iterative.hpp
│ │ ├── program_options/
│ │ │ └── options.hpp
│ │ ├── range.cpp
│ │ └── range.hpp
│ ├── 2011-OSLOM-v2/
│ │ ├── Sources_2_5/
│ │ │ ├── OSLOM_files/
│ │ │ │ ├── dir_weighted_tabdeg.h
│ │ │ │ ├── directed_network.h
│ │ │ │ ├── directed_oslomnet_evaluate.h
│ │ │ │ ├── egocentric_undir.h
│ │ │ │ ├── hierarchies.h
│ │ │ │ ├── log_table.h
│ │ │ │ ├── louvain_oslomnet.h
│ │ │ │ ├── louvain_oslomnet_dir.h
│ │ │ │ ├── main_body.cpp
│ │ │ │ ├── main_directed.cpp
│ │ │ │ ├── main_undirected.cpp
│ │ │ │ ├── module_collection.h
│ │ │ │ ├── oslom_net_check_overlap.cpp
│ │ │ │ ├── oslom_net_global.h
│ │ │ │ ├── oslom_net_unions.cpp
│ │ │ │ ├── set_parameters.h
│ │ │ │ ├── standard_package/
│ │ │ │ │ ├── cast.cpp
│ │ │ │ │ ├── combinatorics.cpp
│ │ │ │ │ ├── deque_numeric.cpp
│ │ │ │ │ ├── histograms.cpp
│ │ │ │ │ ├── mutual.cpp
│ │ │ │ │ ├── pajek.cpp
│ │ │ │ │ ├── partition.cpp
│ │ │ │ │ ├── print.cpp
│ │ │ │ │ ├── random.cpp
│ │ │ │ │ ├── standard_include.cpp
│ │ │ │ │ └── tabdeg.cpp
│ │ │ │ ├── try_homeless_dir.cpp
│ │ │ │ ├── try_homeless_undir.cpp
│ │ │ │ ├── undir_weighted_tabdeg.h
│ │ │ │ ├── undirected_network.h
│ │ │ │ ├── undirected_oslomnet_evaluate.h
│ │ │ │ └── wsarray.h
│ │ │ ├── ReadMe.tex
│ │ │ ├── infomap_dir/
│ │ │ │ ├── Greedy.cc
│ │ │ │ ├── Greedy.h
│ │ │ │ ├── GreedyBase.cc
│ │ │ │ ├── GreedyBase.h
│ │ │ │ ├── Makefile
│ │ │ │ ├── MersenneTwister.h
│ │ │ │ ├── Node.cc
│ │ │ │ ├── Node.h
│ │ │ │ ├── flow.net
│ │ │ │ ├── infomap.cc
│ │ │ │ ├── infomap.h
│ │ │ │ ├── infomap_scr.cpp
│ │ │ │ ├── source-sink.net
│ │ │ │ └── standard_package/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── mutual.cpp
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── standard_include.cpp
│ │ │ │ └── tabdeg.cpp
│ │ │ ├── infomap_undir/
│ │ │ │ ├── Greedy.cc
│ │ │ │ ├── Greedy.h
│ │ │ │ ├── GreedyBase.cc
│ │ │ │ ├── GreedyBase.h
│ │ │ │ ├── Makefile
│ │ │ │ ├── MersenneTwister.h
│ │ │ │ ├── Node.cc
│ │ │ │ ├── Node.h
│ │ │ │ ├── infomap.cc
│ │ │ │ ├── infomap.h
│ │ │ │ ├── infomap_scr.cpp
│ │ │ │ ├── karate.net
│ │ │ │ └── standard_package/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── mutual.cpp
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── standard_include.cpp
│ │ │ │ └── tabdeg.cpp
│ │ │ ├── louvain/
│ │ │ │ ├── Makefile
│ │ │ │ ├── a.out
│ │ │ │ ├── community.cpp
│ │ │ │ ├── community.h
│ │ │ │ ├── graph.cpp
│ │ │ │ ├── graph.h
│ │ │ │ ├── graph_binary.cpp
│ │ │ │ ├── graph_binary.h
│ │ │ │ ├── graph_binary_linux.h
│ │ │ │ ├── graph_binary_mac.h
│ │ │ │ ├── list_out
│ │ │ │ ├── main_community.cpp
│ │ │ │ ├── main_convert.cpp
│ │ │ │ ├── main_hierarchy.cpp
│ │ │ │ ├── order.cpp
│ │ │ │ ├── script_to_compile.cpp
│ │ │ │ ├── standard_package/
│ │ │ │ │ ├── cast.cpp
│ │ │ │ │ ├── combinatorics.cpp
│ │ │ │ │ ├── deque_numeric.cpp
│ │ │ │ │ ├── histograms.cpp
│ │ │ │ │ ├── mutual.cpp
│ │ │ │ │ ├── pajek.cpp
│ │ │ │ │ ├── partition.cpp
│ │ │ │ │ ├── print.cpp
│ │ │ │ │ ├── random.cpp
│ │ │ │ │ ├── standard_include.cpp
│ │ │ │ │ └── tabdeg.cpp
│ │ │ │ ├── static_network.h
│ │ │ │ └── wsarray.h
│ │ │ └── visualSources/
│ │ │ ├── hier.h
│ │ │ ├── main.cpp
│ │ │ ├── main_pajek.cpp
│ │ │ ├── main_pajek_directed.cpp
│ │ │ ├── netvi.h
│ │ │ ├── position.h
│ │ │ ├── standard_package/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── mutual.cpp
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── standard_include.cpp
│ │ │ │ └── tabdeg.cpp
│ │ │ ├── static_network.h
│ │ │ ├── visual_net.h
│ │ │ └── wsarray.h
│ │ ├── compile_all.sh
│ │ ├── copra.jar
│ │ └── src-refactor/
│ │ ├── CMakeLists.txt
│ │ ├── algorithm/
│ │ │ ├── infomap/
│ │ │ │ ├── dir/
│ │ │ │ │ ├── Greedy.cc
│ │ │ │ │ ├── Greedy.h
│ │ │ │ │ ├── GreedyBase.cc
│ │ │ │ │ ├── GreedyBase.h
│ │ │ │ │ ├── MersenneTwister.h
│ │ │ │ │ ├── Node.cc
│ │ │ │ │ ├── Node.h
│ │ │ │ │ ├── doc/
│ │ │ │ │ │ ├── Makefile
│ │ │ │ │ │ ├── ReadMe.md
│ │ │ │ │ │ ├── flow.net
│ │ │ │ │ │ ├── infomap_scr.cpp
│ │ │ │ │ │ └── source-sink.net
│ │ │ │ │ ├── infomap.cc
│ │ │ │ │ └── infomap.h
│ │ │ │ └── undir/
│ │ │ │ ├── Greedy.cc
│ │ │ │ ├── Greedy.h
│ │ │ │ ├── GreedyBase.cc
│ │ │ │ ├── GreedyBase.h
│ │ │ │ ├── MersenneTwister.h
│ │ │ │ ├── Node.cc
│ │ │ │ ├── Node.h
│ │ │ │ ├── doc/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── ReadMe.md
│ │ │ │ │ ├── infomap_scr.cpp
│ │ │ │ │ └── karate.net
│ │ │ │ ├── infomap.cc
│ │ │ │ └── infomap.h
│ │ │ ├── louvain/
│ │ │ │ ├── community.cpp
│ │ │ │ ├── community.h
│ │ │ │ ├── doc/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── ReadMe.md
│ │ │ │ │ ├── list_out
│ │ │ │ │ ├── order.cpp
│ │ │ │ │ ├── script_to_compile.cpp
│ │ │ │ │ └── static_network.h
│ │ │ │ ├── graph.cpp
│ │ │ │ ├── graph.h
│ │ │ │ ├── graph_binary.cpp
│ │ │ │ ├── graph_binary.h
│ │ │ │ ├── graph_binary_linux.h
│ │ │ │ ├── graph_binary_mac.h
│ │ │ │ ├── main_community.cpp
│ │ │ │ ├── main_convert.cpp
│ │ │ │ └── main_hierarchy.cpp
│ │ │ └── oslom/
│ │ │ ├── hierarchies.cpp
│ │ │ ├── hierarchies.h
│ │ │ ├── main_directed.cpp
│ │ │ └── main_undirected.cpp
│ │ ├── graph/
│ │ │ ├── directed/
│ │ │ │ ├── dir_weighted_tabdeg.cpp
│ │ │ │ ├── dir_weighted_tabdeg.h
│ │ │ │ ├── directed_network.cpp
│ │ │ │ ├── directed_network.h
│ │ │ │ ├── directed_oslomnet_evaluate.cpp
│ │ │ │ ├── directed_oslomnet_evaluate.h
│ │ │ │ ├── louvain_oslomnet_dir.cpp
│ │ │ │ ├── louvain_oslomnet_dir.h
│ │ │ │ └── try_homeless_dir.cpp
│ │ │ ├── louvain_oslomnet.cpp
│ │ │ ├── louvain_oslomnet.h
│ │ │ ├── oslom_net_global.cpp
│ │ │ ├── oslom_net_global.h
│ │ │ └── undirected/
│ │ │ ├── egocentric_undir.cpp
│ │ │ ├── egocentric_undir.h
│ │ │ ├── try_homeless_undir.cpp
│ │ │ ├── undir_weighted_tabdeg.cpp
│ │ │ ├── undir_weighted_tabdeg.h
│ │ │ ├── undirected_network.cpp
│ │ │ ├── undirected_network.h
│ │ │ ├── undirected_oslomnet_evaluate.cpp
│ │ │ └── undirected_oslomnet_evaluate.h
│ │ ├── util/
│ │ │ ├── collection/
│ │ │ │ ├── module_collection.cpp
│ │ │ │ ├── module_collection.h
│ │ │ │ ├── wsarray.cpp
│ │ │ │ └── wsarray.h
│ │ │ ├── common/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── cast.h
│ │ │ │ ├── cc.cpp
│ │ │ │ ├── cc.h
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── combinatorics.h
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── deque_numeric.h
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── histograms.h
│ │ │ │ ├── log_table.cpp
│ │ │ │ ├── log_table.h
│ │ │ │ ├── random.cpp
│ │ │ │ └── random.h
│ │ │ ├── input_output/
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── pajek.h
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── partition.h
│ │ │ │ ├── pretty_print.h
│ │ │ │ ├── tab_degree.cpp
│ │ │ │ └── tab_degree.h
│ │ │ ├── metric/
│ │ │ │ ├── mutual.cpp
│ │ │ │ └── mutual.h
│ │ │ └── program_options/
│ │ │ ├── set_parameters.cpp
│ │ │ └── set_parameters.h
│ │ └── visualization/
│ │ ├── main.cpp
│ │ ├── main_pajek.cpp
│ │ ├── main_pajek_directed.cpp
│ │ ├── unused/
│ │ │ ├── netvi.cpp
│ │ │ └── netvi.h
│ │ └── util/
│ │ ├── hier.cpp
│ │ ├── hier.h
│ │ ├── position.cpp
│ │ ├── position.h
│ │ ├── static_network.cpp
│ │ ├── static_network.h
│ │ ├── visual_net.cpp
│ │ ├── visual_net.h
│ │ ├── wsarray.cpp
│ │ └── wsarray.h
│ ├── 2011-SLPA/
│ │ ├── ReadMe.md
│ │ ├── src_original/
│ │ │ ├── GANXiS-S_v1.0/
│ │ │ │ ├── CommonFuns.cpp
│ │ │ │ ├── CommonFuns.h
│ │ │ │ ├── CommonFuns_Measure.cpp
│ │ │ │ ├── CommonFuns_Measure.h
│ │ │ │ ├── CommonFuns_TMP.h
│ │ │ │ ├── CommonFuns_TMP_Measure.h
│ │ │ │ ├── ComputeSnapshotChange.cpp
│ │ │ │ ├── ComputeSnapshotChange.h
│ │ │ │ ├── DisjointM.cpp
│ │ │ │ ├── DisjointM.h
│ │ │ │ ├── LPA.cpp
│ │ │ │ ├── LPA.h
│ │ │ │ ├── LRTPrama.cpp
│ │ │ │ ├── LRTPrama.h
│ │ │ │ ├── LabelRank.cpp
│ │ │ │ ├── LabelRank.h
│ │ │ │ ├── MersenneTwister.h
│ │ │ │ ├── NODE.cpp
│ │ │ │ ├── NODE.h
│ │ │ │ ├── Net.cpp
│ │ │ │ ├── Net.h
│ │ │ │ ├── TieLabel.cpp
│ │ │ │ ├── TieLabel.h
│ │ │ │ ├── fileOpts.cpp
│ │ │ │ ├── fileOpts.h
│ │ │ │ ├── main_LabelRank_release.cpp
│ │ │ │ ├── rndNumbers.cpp
│ │ │ │ ├── rndNumbers.h
│ │ │ │ └── test.ipairs
│ │ │ └── GANXiS_v3.0.2/
│ │ │ ├── GANXiSw.jar
│ │ │ ├── commons-collections-3.2.1.jar
│ │ │ ├── output/
│ │ │ │ ├── SLPAw_test_run1_r0.01_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.05_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.15_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.1_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.25_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.2_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.35_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.3_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.45_v3_T100.icpm
│ │ │ │ ├── SLPAw_test_run1_r0.4_v3_T100.icpm
│ │ │ │ └── SLPAw_test_run1_r0.5_v3_T100.icpm
│ │ │ ├── test.ipairs
│ │ │ ├── testLong.ipairs
│ │ │ ├── test_str.ipairs
│ │ │ └── test_w01.ipairs
│ │ ├── src_python/
│ │ │ ├── romain-fontugne/
│ │ │ │ └── slpa.py
│ │ │ └── ying_nus/
│ │ │ ├── README.md
│ │ │ ├── karate.txt
│ │ │ ├── nmi.py
│ │ │ ├── slpa.py
│ │ │ └── test_slpa.py
│ │ └── src_refactor/
│ │ ├── pom.xml
│ │ └── src/
│ │ └── main/
│ │ ├── java/
│ │ │ ├── CollectionFuns.java
│ │ │ ├── NODE.java
│ │ │ ├── Net.java
│ │ │ ├── SLPAw.java
│ │ │ └── fileOpts.java
│ │ └── resources/
│ │ └── GANXiSw.jar
│ ├── 2012-CPMOnSteroids/
│ │ ├── ReadMe.md
│ │ ├── src_original/
│ │ │ ├── COPYING
│ │ │ ├── Makefile.in
│ │ │ ├── README
│ │ │ ├── cliques.c
│ │ │ ├── configure
│ │ │ ├── configure.in
│ │ │ ├── cos.c
│ │ │ ├── cospoc.c
│ │ │ ├── dsforest.c
│ │ │ ├── extras/
│ │ │ │ ├── Makefile.in
│ │ │ │ └── maximal_cliques.c
│ │ │ ├── include/
│ │ │ │ ├── cliques.h
│ │ │ │ ├── common.h
│ │ │ │ ├── cos.h
│ │ │ │ ├── cospoc.h
│ │ │ │ ├── debug.h
│ │ │ │ ├── dsforest.h
│ │ │ │ ├── matrix.h
│ │ │ │ └── output_communities.h
│ │ │ ├── main.c
│ │ │ ├── matrix.c
│ │ │ └── output_communities.c
│ │ └── src_refactor/
│ │ ├── doc/
│ │ │ ├── COPYING
│ │ │ └── README
│ │ └── src/
│ │ ├── CMakeLists.txt
│ │ ├── cliques.c
│ │ ├── cliques.h
│ │ ├── common.h
│ │ ├── cos.c
│ │ ├── cos.h
│ │ ├── cospoc.c
│ │ ├── cospoc.h
│ │ ├── debug.h
│ │ ├── dsforest.c
│ │ ├── dsforest.h
│ │ ├── extras/
│ │ │ └── maximal_cliques.c
│ │ ├── main.c
│ │ ├── matrix.c
│ │ ├── matrix.h
│ │ ├── output_communities.c
│ │ └── output_communities.h
│ ├── 2012-DEMON/
│ │ ├── .gitignore
│ │ ├── Demon.py
│ │ ├── HDemon.py
│ │ ├── change_input_format.py
│ │ └── test_networkx.py
│ ├── 2012-Fast-Clique-Percolation/
│ │ ├── ReadMe.md
│ │ ├── src_original/
│ │ │ ├── Makefile
│ │ │ ├── README
│ │ │ ├── cliques.cpp
│ │ │ ├── cliques.hpp
│ │ │ ├── cmdline.c
│ │ │ ├── cmdline.ggo
│ │ │ ├── cmdline.h
│ │ │ ├── gpl.txt
│ │ │ ├── graph/
│ │ │ │ ├── bloom.cpp
│ │ │ │ ├── bloom.hpp
│ │ │ │ ├── graph.cpp
│ │ │ │ ├── graph.hpp
│ │ │ │ ├── loading.cpp
│ │ │ │ ├── loading.hpp
│ │ │ │ ├── network.cpp
│ │ │ │ ├── network.hpp
│ │ │ │ ├── saving.cpp
│ │ │ │ ├── saving.hpp
│ │ │ │ ├── strings.cpp
│ │ │ │ ├── strings.hpp
│ │ │ │ ├── weights.cpp
│ │ │ │ └── weights.hpp
│ │ │ ├── percolateCliques.cpp
│ │ │ └── pp.hpp
│ │ ├── src_python/
│ │ │ ├── clique_percoaltion_naive.py
│ │ │ └── clique_percolation_fast.py
│ │ └── src_refactor/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── cliques.cpp
│ │ ├── cliques.hpp
│ │ ├── cmdline.c
│ │ ├── cmdline.ggo
│ │ ├── cmdline.h
│ │ ├── graph/
│ │ │ ├── bloom.cpp
│ │ │ ├── bloom.hpp
│ │ │ ├── graph.cpp
│ │ │ ├── graph.hpp
│ │ │ ├── loading.cpp
│ │ │ ├── loading.hpp
│ │ │ ├── network.cpp
│ │ │ ├── network.hpp
│ │ │ ├── saving.cpp
│ │ │ ├── saving.hpp
│ │ │ ├── strings.cpp
│ │ │ ├── strings.hpp
│ │ │ ├── weights.cpp
│ │ │ └── weights.hpp
│ │ ├── original_doc/
│ │ │ ├── Makefile
│ │ │ ├── README
│ │ │ └── gpl.txt
│ │ ├── percolateCliques.cpp
│ │ └── pp.hpp
│ ├── 2013-MSCD/
│ │ ├── MSCD.xcodeproj/
│ │ │ ├── elemarte.mode1v3
│ │ │ ├── elemarte.pbxuser
│ │ │ ├── project.pbxproj
│ │ │ ├── project.xcworkspace/
│ │ │ │ ├── contents.xcworkspacedata
│ │ │ │ └── xcuserdata/
│ │ │ │ └── elemarte.xcuserdatad/
│ │ │ │ ├── UserInterfaceState.xcuserstate
│ │ │ │ └── WorkspaceSettings.xcsettings
│ │ │ └── xcuserdata/
│ │ │ └── elemarte.xcuserdatad/
│ │ │ ├── xcdebugger/
│ │ │ │ └── Breakpoints.xcbkptlist
│ │ │ └── xcschemes/
│ │ │ ├── MSCD.xcscheme
│ │ │ └── xcschememanagement.plist
│ │ ├── Makefile
│ │ ├── ReadMe.md
│ │ ├── Readme.txt
│ │ ├── analyse.xcodeproj/
│ │ │ ├── elemarte.mode1v3
│ │ │ ├── elemarte.pbxuser
│ │ │ ├── project.pbxproj
│ │ │ ├── project.xcworkspace/
│ │ │ │ ├── contents.xcworkspacedata
│ │ │ │ └── xcuserdata/
│ │ │ │ └── elemarte.xcuserdatad/
│ │ │ │ └── UserInterfaceState.xcuserstate
│ │ │ └── xcuserdata/
│ │ │ └── elemarte.xcuserdatad/
│ │ │ └── xcschemes/
│ │ │ ├── analyse.xcscheme
│ │ │ └── xcschememanagement.plist
│ │ ├── conv.xcodeproj/
│ │ │ ├── elemarte.mode1v3
│ │ │ ├── elemarte.pbxuser
│ │ │ ├── project.pbxproj
│ │ │ ├── project.xcworkspace/
│ │ │ │ ├── contents.xcworkspacedata
│ │ │ │ └── xcuserdata/
│ │ │ │ └── elemarte.xcuserdatad/
│ │ │ │ └── UserInterfaceState.xcuserstate
│ │ │ └── xcuserdata/
│ │ │ └── elemarte.xcuserdatad/
│ │ │ └── xcschemes/
│ │ │ ├── conv.xcscheme
│ │ │ └── xcschememanagement.plist
│ │ ├── examples/
│ │ │ ├── dolphins.edges
│ │ │ ├── dolphins.qs
│ │ │ ├── dolphins_0.1.coms
│ │ │ ├── dolphins_0.2.coms
│ │ │ ├── dolphins_0.3.coms
│ │ │ ├── dolphins_0.4.coms
│ │ │ ├── dolphins_0.5.coms
│ │ │ ├── dolphins_0.6.coms
│ │ │ ├── dolphins_0.7.coms
│ │ │ ├── dolphins_0.8.coms
│ │ │ ├── dolphins_0.9.coms
│ │ │ ├── dolphins_0.coms
│ │ │ ├── dolphins_1.1.coms
│ │ │ ├── dolphins_1.2.coms
│ │ │ ├── dolphins_1.3.coms
│ │ │ ├── dolphins_1.4.coms
│ │ │ ├── dolphins_1.5.coms
│ │ │ ├── dolphins_1.6.coms
│ │ │ ├── dolphins_1.7.coms
│ │ │ ├── dolphins_1.8.coms
│ │ │ ├── dolphins_1.87905e-14.coms
│ │ │ ├── dolphins_1.9.coms
│ │ │ ├── dolphins_1.coms
│ │ │ ├── dolphins_10.coms
│ │ │ ├── dolphins_2.1.coms
│ │ │ ├── dolphins_2.2.coms
│ │ │ ├── dolphins_2.3.coms
│ │ │ ├── dolphins_2.4.coms
│ │ │ ├── dolphins_2.5.coms
│ │ │ ├── dolphins_2.6.coms
│ │ │ ├── dolphins_2.7.coms
│ │ │ ├── dolphins_2.8.coms
│ │ │ ├── dolphins_2.9.coms
│ │ │ ├── dolphins_2.coms
│ │ │ ├── dolphins_3.1.coms
│ │ │ ├── dolphins_3.2.coms
│ │ │ ├── dolphins_3.3.coms
│ │ │ ├── dolphins_3.4.coms
│ │ │ ├── dolphins_3.5.coms
│ │ │ ├── dolphins_3.6.coms
│ │ │ ├── dolphins_3.7.coms
│ │ │ ├── dolphins_3.8.coms
│ │ │ ├── dolphins_3.9.coms
│ │ │ ├── dolphins_3.coms
│ │ │ ├── dolphins_4.1.coms
│ │ │ ├── dolphins_4.2.coms
│ │ │ ├── dolphins_4.3.coms
│ │ │ ├── dolphins_4.4.coms
│ │ │ ├── dolphins_4.5.coms
│ │ │ ├── dolphins_4.6.coms
│ │ │ ├── dolphins_4.7.coms
│ │ │ ├── dolphins_4.8.coms
│ │ │ ├── dolphins_4.9.coms
│ │ │ ├── dolphins_4.coms
│ │ │ ├── dolphins_5.1.coms
│ │ │ ├── dolphins_5.2.coms
│ │ │ ├── dolphins_5.3.coms
│ │ │ ├── dolphins_5.4.coms
│ │ │ ├── dolphins_5.5.coms
│ │ │ ├── dolphins_5.6.coms
│ │ │ ├── dolphins_5.7.coms
│ │ │ ├── dolphins_5.8.coms
│ │ │ ├── dolphins_5.9.coms
│ │ │ ├── dolphins_5.coms
│ │ │ ├── dolphins_6.1.coms
│ │ │ ├── dolphins_6.2.coms
│ │ │ ├── dolphins_6.3.coms
│ │ │ ├── dolphins_6.4.coms
│ │ │ ├── dolphins_6.5.coms
│ │ │ ├── dolphins_6.6.coms
│ │ │ ├── dolphins_6.7.coms
│ │ │ ├── dolphins_6.8.coms
│ │ │ ├── dolphins_6.9.coms
│ │ │ ├── dolphins_6.coms
│ │ │ ├── dolphins_7.1.coms
│ │ │ ├── dolphins_7.2.coms
│ │ │ ├── dolphins_7.3.coms
│ │ │ ├── dolphins_7.4.coms
│ │ │ ├── dolphins_7.5.coms
│ │ │ ├── dolphins_7.6.coms
│ │ │ ├── dolphins_7.7.coms
│ │ │ ├── dolphins_7.8.coms
│ │ │ ├── dolphins_7.9.coms
│ │ │ ├── dolphins_7.coms
│ │ │ ├── dolphins_8.1.coms
│ │ │ ├── dolphins_8.2.coms
│ │ │ ├── dolphins_8.3.coms
│ │ │ ├── dolphins_8.4.coms
│ │ │ ├── dolphins_8.5.coms
│ │ │ ├── dolphins_8.6.coms
│ │ │ ├── dolphins_8.7.coms
│ │ │ ├── dolphins_8.8.coms
│ │ │ ├── dolphins_8.9.coms
│ │ │ ├── dolphins_8.coms
│ │ │ ├── dolphins_9.1.coms
│ │ │ ├── dolphins_9.2.coms
│ │ │ ├── dolphins_9.3.coms
│ │ │ ├── dolphins_9.4.coms
│ │ │ ├── dolphins_9.5.coms
│ │ │ ├── dolphins_9.6.coms
│ │ │ ├── dolphins_9.7.coms
│ │ │ ├── dolphins_9.8.coms
│ │ │ ├── dolphins_9.9.coms
│ │ │ ├── dolphins_9.coms
│ │ │ ├── football.edges
│ │ │ ├── karate.edges
│ │ │ └── miserables.edges
│ │ ├── speedtest.xcodeproj/
│ │ │ ├── project.pbxproj
│ │ │ ├── project.xcworkspace/
│ │ │ │ ├── contents.xcworkspacedata
│ │ │ │ └── xcuserdata/
│ │ │ │ └── elemarte.xcuserdatad/
│ │ │ │ └── UserInterfaceState.xcuserstate
│ │ │ └── xcuserdata/
│ │ │ └── elemarte.xcuserdatad/
│ │ │ ├── xcdebugger/
│ │ │ │ └── Breakpoints.xcbkptlist
│ │ │ └── xcschemes/
│ │ │ ├── speedtest.xcscheme
│ │ │ └── xcschememanagement.plist
│ │ └── src/
│ │ ├── analyse_main.cpp
│ │ ├── config.h
│ │ ├── conv_main.cpp
│ │ ├── mscd/
│ │ │ ├── alg/
│ │ │ │ ├── mscd_afg.cpp
│ │ │ │ ├── mscd_afg.h
│ │ │ │ ├── mscd_algorithm.h
│ │ │ │ ├── mscd_hslsw.cpp
│ │ │ │ ├── mscd_hslsw.h
│ │ │ │ ├── mscd_lfk.cpp
│ │ │ │ ├── mscd_lfk.h
│ │ │ │ ├── mscd_lfk2.cpp
│ │ │ │ ├── mscd_lfk2.h
│ │ │ │ ├── mscd_rb.cpp
│ │ │ │ ├── mscd_rb.h
│ │ │ │ ├── mscd_rn.cpp
│ │ │ │ ├── mscd_rn.h
│ │ │ │ ├── mscd_so.cpp
│ │ │ │ ├── mscd_so.h
│ │ │ │ ├── mscd_som.cpp
│ │ │ │ └── mscd_som.h
│ │ │ ├── ds/
│ │ │ │ ├── communities.h
│ │ │ │ └── graph.h
│ │ │ └── io/
│ │ │ ├── in/
│ │ │ │ ├── community_list_reader.cpp
│ │ │ │ ├── community_list_reader.h
│ │ │ │ ├── community_reader.h
│ │ │ │ ├── edge_list_graph_reader.cpp
│ │ │ │ ├── edge_list_graph_reader.h
│ │ │ │ ├── graph_reader copy.h
│ │ │ │ ├── graph_reader.h
│ │ │ │ ├── lf_community_reader.cpp
│ │ │ │ ├── lf_community_reader.h
│ │ │ │ ├── pajek_community_reader.cpp
│ │ │ │ ├── pajek_community_reader.h
│ │ │ │ ├── pajek_graph_reader.cpp
│ │ │ │ └── pajek_graph_reader.h
│ │ │ └── out/
│ │ │ ├── community_list_writer.cpp
│ │ │ ├── community_list_writer.h
│ │ │ ├── community_writer.h
│ │ │ ├── edge_list_graph_writer.cpp
│ │ │ ├── edge_list_graph_writer.h
│ │ │ ├── graph_writer.h
│ │ │ ├── lf_community_writer.cpp
│ │ │ ├── lf_community_writer.h
│ │ │ ├── pajek_community_writer.cpp
│ │ │ ├── pajek_community_writer.h
│ │ │ ├── pajek_graph_writer.cpp
│ │ │ └── pajek_graph_writer.h
│ │ ├── mscd_main.cpp
│ │ ├── speedtest_main.cpp
│ │ └── toolkit/
│ │ ├── atomic_set.h
│ │ ├── nmi.h
│ │ ├── registry.h
│ │ ├── tokeniser.cpp
│ │ ├── tokeniser.h
│ │ └── tools.h
│ ├── 2013-SVINET/
│ │ ├── ReadMe.md
│ │ ├── src-cmake/
│ │ │ ├── authors_doc/
│ │ │ │ ├── AUTHORS
│ │ │ │ ├── COPYING
│ │ │ │ ├── ChangeLog
│ │ │ │ ├── NEWS
│ │ │ │ ├── README
│ │ │ │ ├── README.md
│ │ │ │ ├── aclocal.m4
│ │ │ │ ├── detailed_readme.txt
│ │ │ │ └── validation-test-file-options-patch.txt
│ │ │ ├── example/
│ │ │ │ ├── LFR-ground-truth-n1000-k28.txt
│ │ │ │ ├── LFR-network-n1000-k28.txt
│ │ │ │ ├── assort-75-4.txt
│ │ │ │ ├── ca-AstroPh.csv
│ │ │ │ ├── n1000-k28-LFR-linksampling.tgz
│ │ │ │ ├── n17903-k20-mmsb-linksampling.tgz
│ │ │ │ └── n75-k4-mmsb-batch.tgz
│ │ │ ├── patches/
│ │ │ │ └── ammsb1.patch
│ │ │ └── src/
│ │ │ ├── CMakeLists.txt
│ │ │ ├── collection/
│ │ │ │ ├── fastqueue.hh
│ │ │ │ ├── matrix.hh
│ │ │ │ └── tsqueue.hh
│ │ │ ├── community.hh
│ │ │ ├── env.hh
│ │ │ ├── fastamm.cc
│ │ │ ├── fastamm.hh
│ │ │ ├── fastamm2.cc
│ │ │ ├── fastamm2.hh
│ │ │ ├── fastinit.cc
│ │ │ ├── fastinit.hh
│ │ │ ├── linksampling.cc
│ │ │ ├── linksampling.hh
│ │ │ ├── log.cc
│ │ │ ├── log.hh
│ │ │ ├── main.cc
│ │ │ ├── mmsbgen.cc
│ │ │ ├── mmsbgen.hh
│ │ │ ├── mmsbinfer.cc
│ │ │ ├── mmsbinfer.hh
│ │ │ ├── mmsbinferorig.cc
│ │ │ ├── mmsbinferorig.hh
│ │ │ ├── mmsborig.cc
│ │ │ ├── mmsborig.hh
│ │ │ ├── network.cc
│ │ │ ├── network.hh
│ │ │ ├── sbm.cc
│ │ │ ├── sbm.hh
│ │ │ ├── thread.cc
│ │ │ └── thread.hh
│ │ └── svinet-master/
│ │ ├── AUTHORS
│ │ ├── COPYING
│ │ ├── ChangeLog
│ │ ├── INSTALL
│ │ ├── Makefile.am
│ │ ├── Makefile.in
│ │ ├── NEWS
│ │ ├── README
│ │ ├── README.md
│ │ ├── aclocal.m4
│ │ ├── config.guess
│ │ ├── config.h.in
│ │ ├── config.sub
│ │ ├── configure
│ │ ├── configure.ac
│ │ ├── depcomp
│ │ ├── detailed_readme.txt
│ │ ├── example/
│ │ │ ├── LFR-ground-truth-n1000-k28.txt
│ │ │ ├── LFR-network-n1000-k28.txt
│ │ │ ├── assort-75-4.txt
│ │ │ ├── ca-AstroPh.csv
│ │ │ ├── n1000-k28-LFR-linksampling.tgz
│ │ │ ├── n17903-k20-mmsb-linksampling.tgz
│ │ │ └── n75-k4-mmsb-batch.tgz
│ │ ├── install-sh
│ │ ├── missing
│ │ ├── mkinstalldirs
│ │ ├── patches/
│ │ │ └── ammsb1.patch
│ │ ├── src/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── community.hh
│ │ │ ├── env.hh
│ │ │ ├── fastamm.cc
│ │ │ ├── fastamm.hh
│ │ │ ├── fastamm2.cc
│ │ │ ├── fastamm2.hh
│ │ │ ├── fastinit.cc
│ │ │ ├── fastinit.hh
│ │ │ ├── fastqueue.hh
│ │ │ ├── linksampling.cc
│ │ │ ├── linksampling.hh
│ │ │ ├── log.cc
│ │ │ ├── log.hh
│ │ │ ├── main.cc
│ │ │ ├── matrix.hh
│ │ │ ├── mmsbgen.cc
│ │ │ ├── mmsbgen.hh
│ │ │ ├── mmsbinfer.cc
│ │ │ ├── mmsbinfer.hh
│ │ │ ├── mmsbinferorig.cc
│ │ │ ├── mmsbinferorig.hh
│ │ │ ├── mmsborig.cc
│ │ │ ├── mmsborig.hh
│ │ │ ├── network.cc
│ │ │ ├── network.hh
│ │ │ ├── sbm.cc
│ │ │ ├── sbm.hh
│ │ │ ├── thread.cc
│ │ │ ├── thread.hh
│ │ │ └── tsqueue.hh
│ │ └── validation-test-file-options-patch.txt
│ ├── 2013-Seed-Set-Expansion/
│ │ ├── ReadMe.md
│ │ ├── dependencies/
│ │ │ ├── GraclusSeeds/
│ │ │ │ └── graclus1.2/
│ │ │ │ ├── Makefile
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── README_Graclus
│ │ │ │ ├── graclus
│ │ │ │ ├── libmetis.a
│ │ │ │ ├── libmultilevel.a
│ │ │ │ ├── matlab/
│ │ │ │ │ ├── ComputeCenterNodes.m
│ │ │ │ │ ├── ComputeDistances.m
│ │ │ │ │ ├── GraclusImageSegmentation.m
│ │ │ │ │ ├── discretisation.m
│ │ │ │ │ ├── discretisationEigenVectorData.asv
│ │ │ │ │ ├── discretisationEigenVectorData.m
│ │ │ │ │ ├── displayLatex.m
│ │ │ │ │ ├── eigs2.m
│ │ │ │ │ ├── get_hrc_graclus_seeds.m
│ │ │ │ │ ├── graclus.m
│ │ │ │ │ ├── graclus_compile_script.m
│ │ │ │ │ ├── graclus_mex.cpp
│ │ │ │ │ ├── graclus_mex.o
│ │ │ │ │ ├── hrcGraclus.m
│ │ │ │ │ ├── io.cpp
│ │ │ │ │ ├── io.o
│ │ │ │ │ ├── mlkkm.cpp
│ │ │ │ │ ├── mlkkm.o
│ │ │ │ │ ├── ncut.asv
│ │ │ │ │ ├── ncut.m
│ │ │ │ │ ├── ncutW.asv
│ │ │ │ │ ├── ncutW.m
│ │ │ │ │ ├── readMetis.m
│ │ │ │ │ ├── wkkm.cpp
│ │ │ │ │ └── wkkm.o
│ │ │ │ ├── metisLib/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── balance.c
│ │ │ │ │ ├── balance.o
│ │ │ │ │ ├── bucketsort.c
│ │ │ │ │ ├── bucketsort.o
│ │ │ │ │ ├── ccgraph.c
│ │ │ │ │ ├── ccgraph.o
│ │ │ │ │ ├── coarsen.c
│ │ │ │ │ ├── coarsen.o
│ │ │ │ │ ├── compress.c
│ │ │ │ │ ├── compress.o
│ │ │ │ │ ├── debug.c
│ │ │ │ │ ├── debug.o
│ │ │ │ │ ├── defs.h
│ │ │ │ │ ├── estmem.c
│ │ │ │ │ ├── estmem.o
│ │ │ │ │ ├── fm.c
│ │ │ │ │ ├── fm.o
│ │ │ │ │ ├── fortran.c
│ │ │ │ │ ├── fortran.o
│ │ │ │ │ ├── frename.c
│ │ │ │ │ ├── frename.o
│ │ │ │ │ ├── graph.c
│ │ │ │ │ ├── graph.o
│ │ │ │ │ ├── initpart.c
│ │ │ │ │ ├── initpart.o
│ │ │ │ │ ├── kmetis.c
│ │ │ │ │ ├── kmetis.o
│ │ │ │ │ ├── kvmetis.c
│ │ │ │ │ ├── kvmetis.o
│ │ │ │ │ ├── kwayfm.c
│ │ │ │ │ ├── kwayfm.o
│ │ │ │ │ ├── kwayrefine.c
│ │ │ │ │ ├── kwayrefine.o
│ │ │ │ │ ├── kwayvolfm.c
│ │ │ │ │ ├── kwayvolfm.o
│ │ │ │ │ ├── kwayvolrefine.c
│ │ │ │ │ ├── kwayvolrefine.o
│ │ │ │ │ ├── macros.h
│ │ │ │ │ ├── match.c
│ │ │ │ │ ├── match.o
│ │ │ │ │ ├── mbalance.c
│ │ │ │ │ ├── mbalance.o
│ │ │ │ │ ├── mbalance2.c
│ │ │ │ │ ├── mbalance2.o
│ │ │ │ │ ├── mcoarsen.c
│ │ │ │ │ ├── mcoarsen.o
│ │ │ │ │ ├── memory.c
│ │ │ │ │ ├── memory.o
│ │ │ │ │ ├── mesh.c
│ │ │ │ │ ├── mesh.o
│ │ │ │ │ ├── meshpart.c
│ │ │ │ │ ├── meshpart.o
│ │ │ │ │ ├── metis.h
│ │ │ │ │ ├── mfm.c
│ │ │ │ │ ├── mfm.o
│ │ │ │ │ ├── mfm2.c
│ │ │ │ │ ├── mfm2.o
│ │ │ │ │ ├── mincover.c
│ │ │ │ │ ├── mincover.o
│ │ │ │ │ ├── minitpart.c
│ │ │ │ │ ├── minitpart.o
│ │ │ │ │ ├── minitpart2.c
│ │ │ │ │ ├── minitpart2.o
│ │ │ │ │ ├── mkmetis.c
│ │ │ │ │ ├── mkmetis.o
│ │ │ │ │ ├── mkwayfmh.c
│ │ │ │ │ ├── mkwayfmh.o
│ │ │ │ │ ├── mkwayrefine.c
│ │ │ │ │ ├── mkwayrefine.o
│ │ │ │ │ ├── mmatch.c
│ │ │ │ │ ├── mmatch.o
│ │ │ │ │ ├── mmd.c
│ │ │ │ │ ├── mmd.o
│ │ │ │ │ ├── mpmetis.c
│ │ │ │ │ ├── mpmetis.o
│ │ │ │ │ ├── mrefine.c
│ │ │ │ │ ├── mrefine.o
│ │ │ │ │ ├── mrefine2.c
│ │ │ │ │ ├── mrefine2.o
│ │ │ │ │ ├── mutil.c
│ │ │ │ │ ├── mutil.o
│ │ │ │ │ ├── myqsort.c
│ │ │ │ │ ├── myqsort.o
│ │ │ │ │ ├── ometis.c
│ │ │ │ │ ├── ometis.o
│ │ │ │ │ ├── parmetis.c
│ │ │ │ │ ├── parmetis.o
│ │ │ │ │ ├── pmetis.c
│ │ │ │ │ ├── pmetis.o
│ │ │ │ │ ├── pqueue.c
│ │ │ │ │ ├── pqueue.o
│ │ │ │ │ ├── proto.h
│ │ │ │ │ ├── refine.c
│ │ │ │ │ ├── refine.o
│ │ │ │ │ ├── rename.h
│ │ │ │ │ ├── separator.c
│ │ │ │ │ ├── separator.o
│ │ │ │ │ ├── sfm.c
│ │ │ │ │ ├── sfm.o
│ │ │ │ │ ├── srefine.c
│ │ │ │ │ ├── srefine.o
│ │ │ │ │ ├── stat.c
│ │ │ │ │ ├── stat.o
│ │ │ │ │ ├── struct.h
│ │ │ │ │ ├── subdomains.c
│ │ │ │ │ ├── subdomains.o
│ │ │ │ │ ├── timing.c
│ │ │ │ │ ├── timing.o
│ │ │ │ │ ├── util.c
│ │ │ │ │ └── util.o
│ │ │ │ ├── multilevelLib/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── mlkkm.c
│ │ │ │ │ ├── mlkkm.o
│ │ │ │ │ ├── wkkm.c
│ │ │ │ │ ├── wkkm.o
│ │ │ │ │ ├── wkkm_boundary_only.c
│ │ │ │ │ ├── wkkm_experiment.c
│ │ │ │ │ └── wkkm_old.c
│ │ │ │ └── programs/
│ │ │ │ ├── Makefile
│ │ │ │ ├── graclus.c
│ │ │ │ ├── graclus.o
│ │ │ │ ├── io.c
│ │ │ │ ├── io.h
│ │ │ │ └── io.o
│ │ │ └── matlab_bgl/
│ │ │ ├── .project
│ │ │ ├── @inplace/
│ │ │ │ ├── assign.m
│ │ │ │ ├── display.m
│ │ │ │ ├── double.m
│ │ │ │ ├── end.m
│ │ │ │ ├── inplace.m
│ │ │ │ ├── size.m
│ │ │ │ ├── subsasgn.m
│ │ │ │ └── subsref.m
│ │ │ ├── @ipdouble/
│ │ │ │ └── ipdouble.m
│ │ │ ├── @ipint32/
│ │ │ │ └── ipint32.m
│ │ │ ├── Contents.m
│ │ │ ├── all_shortest_paths.m
│ │ │ ├── astar_search.m
│ │ │ ├── bellman_ford_sp.m
│ │ │ ├── betweenness_centrality.m
│ │ │ ├── bfs.m
│ │ │ ├── biconnected_components.m
│ │ │ ├── boyer_myrvold_planarity_test.m
│ │ │ ├── breadth_first_search.m
│ │ │ ├── chrobak_payne_straight_line_drawing.m
│ │ │ ├── circle_graph_layout.m
│ │ │ ├── clique_graph.m
│ │ │ ├── clustering_coefficients.m
│ │ │ ├── combine_visitors.m
│ │ │ ├── components.m
│ │ │ ├── core_numbers.m
│ │ │ ├── custom/
│ │ │ │ ├── dijkstra_all_sp.m
│ │ │ │ └── path_histogram.m
│ │ │ ├── cycle_graph.m
│ │ │ ├── dag_sp.m
│ │ │ ├── depth_first_search.m
│ │ │ ├── dfs.m
│ │ │ ├── dijkstra_sp.m
│ │ │ ├── doc/
│ │ │ │ ├── changed.txt
│ │ │ │ ├── html/
│ │ │ │ │ ├── changes.html
│ │ │ │ │ ├── core_numbers_example/
│ │ │ │ │ │ └── core_numbers_example.html
│ │ │ │ │ ├── faq.html
│ │ │ │ │ ├── index.html
│ │ │ │ │ ├── new_in_3/
│ │ │ │ │ │ └── new_in_3_0.html
│ │ │ │ │ ├── new_in_4/
│ │ │ │ │ │ └── new_in_4_0.html
│ │ │ │ │ ├── old.html
│ │ │ │ │ ├── planar_graphs/
│ │ │ │ │ │ └── planar_graphs.html
│ │ │ │ │ ├── record_alg/
│ │ │ │ │ │ └── record_alg.html
│ │ │ │ │ ├── red_black/
│ │ │ │ │ │ └── red_black.html
│ │ │ │ │ ├── reweighted_graphs/
│ │ │ │ │ │ └── reweighted_graphs.html
│ │ │ │ │ ├── site.css
│ │ │ │ │ └── style.css
│ │ │ │ ├── mxdom2mbgl-html.xsl
│ │ │ │ └── write_examples_html.m
│ │ │ ├── edge_weight_index.m
│ │ │ ├── edge_weight_vector.m
│ │ │ ├── edmonds_maximum_cardinality_matching.m
│ │ │ ├── edmunds_karp_max_flow.m
│ │ │ ├── erdos_reyni.m
│ │ │ ├── examples/
│ │ │ │ ├── approx_multiway_cut.m
│ │ │ │ ├── bacon_numbers.m
│ │ │ │ ├── bfs_example.m
│ │ │ │ ├── bfs_in_mbgl.m
│ │ │ │ ├── bfs_in_mbgl_efficient.m
│ │ │ │ ├── core_numbers_example.m
│ │ │ │ ├── dfs_example.m
│ │ │ │ ├── edge_index_example.m
│ │ │ │ ├── max_flow_example.m
│ │ │ │ ├── multiway_example.m
│ │ │ │ ├── new_in_3_0.m
│ │ │ │ ├── new_in_4_0.m
│ │ │ │ ├── planar_graphs.m
│ │ │ │ ├── record_alg.m
│ │ │ │ ├── red_black.m
│ │ │ │ └── reweighted_graphs.m
│ │ │ ├── floyd_warshall_all_sp.m
│ │ │ ├── fruchterman_reingold_force_directed_layout.m
│ │ │ ├── graphs/
│ │ │ │ ├── all_shortest_paths_example.mat
│ │ │ │ ├── bfs_example.mat
│ │ │ │ ├── bgl_cities.mat
│ │ │ │ ├── clique-10.mat
│ │ │ │ ├── clr-24-1.mat
│ │ │ │ ├── clr-25-2.mat
│ │ │ │ ├── clr-26-1.mat
│ │ │ │ ├── clr-27-1.mat
│ │ │ │ ├── cores_example.mat
│ │ │ │ ├── cs-stanford.mat
│ │ │ │ ├── dfs_example.mat
│ │ │ │ ├── dominator_tree_example.mat
│ │ │ │ ├── kt-3-2.mat
│ │ │ │ ├── kt-3-7.mat
│ │ │ │ ├── kt-6-23.mat
│ │ │ │ ├── kt-7-2.mat
│ │ │ │ ├── line-7.mat
│ │ │ │ ├── matching_example.mat
│ │ │ │ ├── max_flow_example.mat
│ │ │ │ ├── minnesota.mat
│ │ │ │ ├── padgett-florentine.mat
│ │ │ │ ├── tapir.mat
│ │ │ │ └── tarjan-biconn.mat
│ │ │ ├── grid_graph.m
│ │ │ ├── gursoy_atun_layout.m
│ │ │ ├── indexed_sparse.m
│ │ │ ├── is_kuratowski_graph.m
│ │ │ ├── is_straight_line_drawing.m
│ │ │ ├── johnson_all_sp.m
│ │ │ ├── kamada_kawai_spring_layout.m
│ │ │ ├── kolmogorov_max_flow.m
│ │ │ ├── kruskal_mst.m
│ │ │ ├── kuratowski_subgraph.m
│ │ │ ├── lengauer_tarjan_dominator_tree.m
│ │ │ ├── libmbgl/
│ │ │ │ ├── ccfiles.sh
│ │ │ │ ├── compile-linux-32.sh
│ │ │ │ ├── compile-linux-64-large.sh
│ │ │ │ ├── compile-linux-64.sh
│ │ │ │ ├── compile-macosx-intel-32.sh
│ │ │ │ ├── compile-macosx-ppc-32.sh
│ │ │ │ ├── compile-win32.bat
│ │ │ │ ├── compile-win64.bat
│ │ │ │ ├── components.cc
│ │ │ │ ├── crm_graph.hpp
│ │ │ │ ├── include/
│ │ │ │ │ ├── matlab_bgl.h
│ │ │ │ │ └── matlab_bgl_types.h
│ │ │ │ ├── layouts.cc
│ │ │ │ ├── libmbgl.sln
│ │ │ │ ├── libmbgl.vcproj
│ │ │ │ ├── libmbgl_test/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ ├── fr_layout_test.cc
│ │ │ │ │ ├── layout_funcs_test.cc
│ │ │ │ │ ├── libmbgl_funcs_test.cc
│ │ │ │ │ ├── libmbgl_funcs_test.h
│ │ │ │ │ ├── libmbgl_test.cc
│ │ │ │ │ ├── libmbgl_test.vcproj
│ │ │ │ │ ├── planar_funcs_test.cc
│ │ │ │ │ ├── planar_is_straight_line_test.cc
│ │ │ │ │ ├── planar_ksubgraph_test.cc
│ │ │ │ │ ├── property_map_test.cc
│ │ │ │ │ ├── simple_prop_map_test.cc
│ │ │ │ │ ├── simple_prop_map_test_2.cc
│ │ │ │ │ ├── simple_prop_map_test_3.cc
│ │ │ │ │ └── simple_prop_map_test_4.cc
│ │ │ │ ├── libmbgl_util.hpp
│ │ │ │ ├── max_flow.cc
│ │ │ │ ├── orderings.cc
│ │ │ │ ├── planar.cc
│ │ │ │ ├── searches.cc
│ │ │ │ ├── shortest_path.cc
│ │ │ │ ├── spanning_trees.cc
│ │ │ │ ├── statistics.cc
│ │ │ │ ├── stop_visitors.hpp
│ │ │ │ ├── visitor_macros.hpp
│ │ │ │ └── yasmic/
│ │ │ │ ├── .sconsign
│ │ │ │ ├── bgl_kcore.hpp
│ │ │ │ ├── binary_ifstream_graph.hpp
│ │ │ │ ├── binary_ifstream_matrix.hpp
│ │ │ │ ├── bind_utility.hpp
│ │ │ │ ├── boost_mod/
│ │ │ │ │ ├── .sconsign
│ │ │ │ │ ├── bellman_ford_shortest_paths.hpp
│ │ │ │ │ ├── betweenness_centrality.hpp
│ │ │ │ │ ├── chrobak_payne_drawing.hpp
│ │ │ │ │ ├── core_numbers.hpp
│ │ │ │ │ ├── floyd_warshall_shortest.hpp
│ │ │ │ │ ├── fruchterman_reingold.hpp
│ │ │ │ │ ├── gzip.hpp
│ │ │ │ │ ├── integer_extra.hpp
│ │ │ │ │ ├── is_straight_line_drawing.hpp
│ │ │ │ │ ├── johnson_all_pairs_shortest.hpp
│ │ │ │ │ ├── kolmogorov_max_flow.hpp
│ │ │ │ │ ├── kruskal_min_spanning_tree.hpp
│ │ │ │ │ └── zlib.cpp
│ │ │ │ ├── bvgraph_matrix.hpp
│ │ │ │ ├── cluto_ifstream_matrix.hpp
│ │ │ │ ├── compressed_row_matrix.hpp
│ │ │ │ ├── compressed_row_matrix_graph.hpp
│ │ │ │ ├── generic_matrix_operations.hpp
│ │ │ │ ├── graph_ifstream_matrix.hpp
│ │ │ │ ├── ifstream_as_matrix.hpp
│ │ │ │ ├── ifstream_matrix.hpp
│ │ │ │ ├── indexed_list.hpp
│ │ │ │ ├── indexed_list.old.hpp
│ │ │ │ ├── indexed_list_as_graph.hpp
│ │ │ │ ├── istream_as_matrix.hpp
│ │ │ │ ├── iterator_utility.hpp
│ │ │ │ ├── matrix_row_col_graph.hpp
│ │ │ │ ├── nonzero_union.hpp
│ │ │ │ ├── simple_csr_matrix.hpp
│ │ │ │ ├── simple_csr_matrix_as_graph.hpp
│ │ │ │ ├── simple_row_and_column_matrix.hpp
│ │ │ │ ├── simple_row_and_column_matrix_as_graph.hpp
│ │ │ │ ├── smatrix_traits.hpp
│ │ │ │ ├── transpose_matrix.hpp
│ │ │ │ ├── tuple_utility.hpp
│ │ │ │ ├── undir_simple_csr_matrix.hpp
│ │ │ │ ├── undir_simple_csr_matrix_as_graph.hpp
│ │ │ │ ├── util/
│ │ │ │ │ ├── .sconsign
│ │ │ │ │ ├── crm_matrix.hpp
│ │ │ │ │ ├── filtered_matrix.hpp
│ │ │ │ │ ├── load_crm_graph.hpp
│ │ │ │ │ ├── load_crm_matrix.hpp
│ │ │ │ │ ├── write_matrix.hpp
│ │ │ │ │ └── write_petsc_matrix.hpp
│ │ │ │ ├── verbose_util.hpp
│ │ │ │ ├── yasmic.cbp
│ │ │ │ ├── yasmic.layout
│ │ │ │ └── yasmic.vcproj
│ │ │ ├── make_biconnected_planar.m
│ │ │ ├── make_connected.m
│ │ │ ├── make_maximal_planar.m
│ │ │ ├── matching.m
│ │ │ ├── max_flow.m
│ │ │ ├── maximal_matching.m
│ │ │ ├── mst.m
│ │ │ ├── num_edges.m
│ │ │ ├── num_vertices.m
│ │ │ ├── path_from_pred.m
│ │ │ ├── planar_canonical_ordering.m
│ │ │ ├── prim_mst.m
│ │ │ ├── private/
│ │ │ │ ├── astar_search_mex.c
│ │ │ │ ├── betweenness_centrality_mex.c
│ │ │ │ ├── bfs_dfs_vis_mex.c
│ │ │ │ ├── bfs_mex.c
│ │ │ │ ├── biconnected_components_mex.c
│ │ │ │ ├── check_matlab_bgl.m
│ │ │ │ ├── clustering_coefficients_mex.c
│ │ │ │ ├── common_functions.h
│ │ │ │ ├── common_macros.h
│ │ │ │ ├── compile.m
│ │ │ │ ├── components_mex.c
│ │ │ │ ├── core_numbers_mex.c
│ │ │ │ ├── dfs_mex.c
│ │ │ │ ├── dominator_tree_mex.c
│ │ │ │ ├── expand_macros.h
│ │ │ │ ├── fruchterman_reingold_mex.c
│ │ │ │ ├── get_matlab_bgl_options.m
│ │ │ │ ├── gursoy_atun_mex.c
│ │ │ │ ├── kamada_kawai_spring_layout_mex.c
│ │ │ │ ├── matching_mex.c
│ │ │ │ ├── matlab_bgl_all_sp_mex.c
│ │ │ │ ├── matlab_bgl_sp_mex.c
│ │ │ │ ├── max_flow_mex.c
│ │ │ │ ├── merge_options.m
│ │ │ │ ├── merge_structs.m
│ │ │ │ ├── mst_mex.c
│ │ │ │ ├── path_from_pred_mex.c
│ │ │ │ ├── planar_drawing_mex.c
│ │ │ │ ├── planar_edges_mex.c
│ │ │ │ ├── planar_test_mex.c
│ │ │ │ ├── test_matching_mex.c
│ │ │ │ ├── todo.m
│ │ │ │ ├── todo_3_0_release.m
│ │ │ │ ├── topological_order_mex.c
│ │ │ │ └── visitor_macros.h
│ │ │ ├── push_relabel_max_flow.m
│ │ │ ├── random_graph_layout.m
│ │ │ ├── set_matlab_bgl_default.m
│ │ │ ├── shortest_paths.m
│ │ │ ├── star_graph.m
│ │ │ ├── test/
│ │ │ │ ├── assert.m
│ │ │ │ ├── rtest_1.m
│ │ │ │ ├── rtest_2.m
│ │ │ │ ├── rtest_3_cojocaru.m
│ │ │ │ ├── rtest_5_henderson.m
│ │ │ │ ├── rtest_6.m
│ │ │ │ ├── rtest_7_karsi.m
│ │ │ │ ├── rtest_all.m
│ │ │ │ ├── test_all.m
│ │ │ │ ├── test_benchmark.m
│ │ │ │ ├── test_breadth_first_search.m
│ │ │ │ ├── test_components.m
│ │ │ │ ├── test_depth_first_search.m
│ │ │ │ ├── test_examples.m
│ │ │ │ ├── test_layouts.m
│ │ │ │ ├── test_main.m
│ │ │ │ ├── test_planar.m
│ │ │ │ ├── test_searches.m
│ │ │ │ ├── test_shortest_paths.m
│ │ │ │ ├── test_spanning_trees.m
│ │ │ │ ├── test_statistics.m
│ │ │ │ └── test_trivial.m
│ │ │ ├── test_dag.m
│ │ │ ├── test_matching.m
│ │ │ ├── test_planar_graph.m
│ │ │ ├── topological_order.m
│ │ │ ├── tree_from_pred.m
│ │ │ └── wheel_graph.m
│ │ └── src/
│ │ ├── Assign_bi.m
│ │ ├── add_extra_community_data.m
│ │ ├── biconncore.m
│ │ ├── compile.m
│ │ ├── cutcond_mex.cc
│ │ ├── evaluate_clusters.m
│ │ ├── filter_community_conductance.m
│ │ ├── flip_C.m
│ │ ├── graphprep.m
│ │ ├── growclusters.m
│ │ ├── largest_component.m
│ │ ├── localEgoSeeds.m
│ │ ├── merge_community_data.m
│ │ ├── neighborhoodmin.m
│ │ ├── nise.m
│ │ ├── pprgrow.m
│ │ ├── pprgrow_mex.cc
│ │ ├── seed_report_expand.m
│ │ ├── spHubSeeds.m
│ │ ├── triangleclusters.m
│ │ ├── triangleclusters_mex.cc
│ │ ├── vpprgrow.m
│ │ └── vpprgrow_mex.cc
│ ├── 2014-Heat-Kernel/
│ │ ├── ReadMe.md
│ │ ├── authors_original_files/
│ │ │ ├── data/
│ │ │ │ ├── amazon.mat
│ │ │ │ ├── four_clusters.smat
│ │ │ │ └── netscience-cc.smat
│ │ │ ├── experiments/
│ │ │ │ ├── chirikov/
│ │ │ │ │ ├── chirikov_example.m
│ │ │ │ │ ├── chirikov_operator.m
│ │ │ │ │ ├── compile.m
│ │ │ │ │ ├── imwrite_scaled.m
│ │ │ │ │ └── pprgrow_mex.cc
│ │ │ │ ├── experimenthkgrow.m
│ │ │ │ ├── experimentpprgrow.m
│ │ │ │ ├── ground_truth/
│ │ │ │ │ ├── amazoncommunity.m
│ │ │ │ │ ├── dblpcommunity.m
│ │ │ │ │ ├── friendstercommunity.m
│ │ │ │ │ ├── ljournalcommunity.m
│ │ │ │ │ ├── orkutcommunity.m
│ │ │ │ │ └── youtubecommunity.m
│ │ │ │ ├── heavyhood.m
│ │ │ │ ├── heavyseed.m
│ │ │ │ ├── heavytwitter.m
│ │ │ │ ├── pathweights_figure.m
│ │ │ │ ├── pprfriendster.m
│ │ │ │ ├── pprheavytwitter.m
│ │ │ │ ├── pprljournal.m
│ │ │ │ ├── pprtwitter.m
│ │ │ │ ├── randhood.m
│ │ │ │ ├── randseed.m
│ │ │ │ ├── set_figure_size.m
│ │ │ │ ├── subplot3.m
│ │ │ │ ├── trials_friendster.m
│ │ │ │ ├── trials_hkgrow.m
│ │ │ │ ├── trials_ljournal.m
│ │ │ │ ├── trials_pprgrow.m
│ │ │ │ └── trials_twitter.m
│ │ │ ├── plotting/
│ │ │ │ ├── conductances.m
│ │ │ │ ├── plotconductances.m
│ │ │ │ ├── plotruntimes.m
│ │ │ │ ├── runtimes.m
│ │ │ │ └── twitcondvsclust.m
│ │ │ ├── ppr_src/
│ │ │ │ ├── compile.m
│ │ │ │ ├── pprgrow.m
│ │ │ │ └── pprgrow_mex.cc
│ │ │ └── src/
│ │ │ ├── README.md
│ │ │ ├── compile.m
│ │ │ ├── hkgrow.m
│ │ │ ├── hkgrow1.m
│ │ │ ├── hkgrow_mex.cpp
│ │ │ ├── hkgrow_mex_kdd.cpp
│ │ │ ├── load_graph.m
│ │ │ ├── normout.m
│ │ │ ├── readSMAT.m
│ │ │ ├── symmatfriend.m
│ │ │ ├── symmattwit.m
│ │ │ ├── test_hkgrow.m
│ │ │ └── test_hkgrow_mex.m
│ │ ├── src_cpp_matlab/
│ │ │ ├── hkgrow.m
│ │ │ ├── hkgrow1.m
│ │ │ ├── hkgrow_mex.cpp
│ │ │ ├── hkgrow_mex_kdd.cpp
│ │ │ ├── test_hkgrow.m
│ │ │ └── test_hkgrow_mex.m
│ │ ├── src_python/
│ │ │ ├── .gitignore
│ │ │ ├── ReadMe.md
│ │ │ ├── __init__.py
│ │ │ ├── dataset/
│ │ │ │ ├── __init__.py
│ │ │ │ ├── get_data.sh
│ │ │ │ └── graph_eval_script.txt
│ │ │ ├── demo_files/
│ │ │ │ ├── __init__.py
│ │ │ │ ├── gexpmq.py
│ │ │ │ ├── hr_relax.py
│ │ │ │ ├── yche_exp.py
│ │ │ │ └── yche_numerical_linear_algebra_exp.py
│ │ │ └── main_files/
│ │ │ ├── __init__.py
│ │ │ ├── algo_hr_grow.py
│ │ │ ├── algo_ppr.py
│ │ │ └── util_helper.py
│ │ └── yche_refactor/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── hkgrow_mex_kdd.cpp
│ │ └── main.cpp
│ └── 2015-LEMON/
│ ├── .gitignore
│ ├── LEMON/
│ │ └── __init__.py
│ ├── LICENSE
│ ├── README.md
│ ├── example/
│ │ └── amazon/
│ │ ├── README
│ │ ├── community
│ │ ├── graph
│ │ └── seed
│ └── python_yche_refactor/
│ ├── eval_ground_truth.txt
│ ├── io_helper.py
│ └── lemon.py
├── Benchmark/
│ └── 2009-LFR-Benchmark/
│ ├── ReadMe.md
│ ├── src_original_cpp/
│ │ ├── ReadMe.md
│ │ ├── binary_networks/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Sources/
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── cc.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ └── standard_include.cpp
│ │ │ ├── Thanks.txt
│ │ │ └── makefile
│ │ ├── directed_networks/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Sources/
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ └── standard_include.cpp
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ ├── hierarchical_bench2_2/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ ├── hier_ben_Sources/
│ │ │ │ ├── a.out
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── binary_benchm.cpp
│ │ │ │ ├── cc.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ └── standard_package/
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── deque_numeric.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── mutual.cpp
│ │ │ │ ├── pajek.cpp
│ │ │ │ ├── partition.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── standard_include.cpp
│ │ │ │ └── tabdeg.cpp
│ │ │ └── makefile
│ │ ├── weighted_directed_nets/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Sources/
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── dir_benchm.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ └── standard_include.cpp
│ │ │ ├── Thanks.txt
│ │ │ ├── benchmark
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ └── weighted_networks/
│ │ ├── ReadMe.txt
│ │ ├── Sources/
│ │ │ ├── Icon_
│ │ │ ├── benchm.cpp
│ │ │ ├── binary_benchm.cpp
│ │ │ ├── cast.cpp
│ │ │ ├── cc.cpp
│ │ │ ├── combinatorics.cpp
│ │ │ ├── histograms.cpp
│ │ │ ├── print.cpp
│ │ │ ├── random.cpp
│ │ │ ├── set_parameters.cpp
│ │ │ └── standard_include.cpp
│ │ ├── Thanks.txt
│ │ ├── gpl.txt
│ │ └── makefile
│ └── src_refactor_cpp/
│ ├── .gitignore
│ ├── CMakeLists.txt
│ ├── ReadMe.md
│ ├── benchmark_gen.py
│ ├── directed_graph/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── benchm.cpp
│ │ ├── doc/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Thanks.txt
│ │ │ └── gpl.txt
│ │ ├── set_parameters.cpp
│ │ └── set_parameters.h
│ ├── documents/
│ │ └── ReadMe.md
│ ├── hierarchical_comm_graph/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── benchm.cpp
│ │ ├── binary_benchm.cpp
│ │ ├── binary_benchm.h
│ │ ├── doc/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ ├── set_parameters.cpp
│ │ └── set_parameters.h
│ ├── playground/
│ │ ├── CMakeLists.txt
│ │ ├── nmi_usage_demo.cpp
│ │ └── tabdeg_demo.cpp
│ ├── run_undir_gperf.sh
│ ├── run_undir_perf.sh
│ ├── undirected_graph/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── benchm.cpp
│ │ ├── doc/
│ │ │ ├── ReadMe.txt
│ │ │ └── Thanks.txt
│ │ ├── set_parameters.cpp
│ │ └── set_parameters.h
│ ├── util/
│ │ ├── cast.cpp
│ │ ├── cast.h
│ │ ├── cc.cpp
│ │ ├── cc.h
│ │ ├── combinatorics.cpp
│ │ ├── combinatorics.h
│ │ ├── histograms.cpp
│ │ ├── histograms.h
│ │ ├── input_output/
│ │ │ ├── tab_degree.cpp
│ │ │ └── tab_degree.h
│ │ ├── metric/
│ │ │ ├── mutual.cpp
│ │ │ └── mutual.h
│ │ ├── pretty_print.h
│ │ ├── random.cpp
│ │ ├── random.h
│ │ └── unused/
│ │ ├── deque_numeric.cpp
│ │ ├── deque_numeric.h
│ │ └── input_output/
│ │ ├── pajek.cpp
│ │ └── partition.cpp
│ ├── weighted_directed_graph/
│ │ ├── CMakeLists.txt
│ │ ├── ReadMe.md
│ │ ├── benchm.cpp
│ │ ├── dir_benchm.cpp
│ │ ├── dir_benchm.h
│ │ ├── doc/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ ├── set_parameters.cpp
│ │ └── set_parameters.h
│ └── weighted_graph/
│ ├── CMakeLists.txt
│ ├── ReadMe.md
│ ├── benchm.cpp
│ ├── binary_benchm.cpp
│ ├── binary_benchm.h
│ ├── doc/
│ │ ├── ReadMe.txt
│ │ ├── Thanks.txt
│ │ └── gpl.txt
│ ├── set_parameters.cpp
│ └── set_parameters.h
├── CONTRIBUTING.md
├── Datasets/
│ ├── ReadMe.md
│ ├── collaboration_edge_list.txt
│ ├── epinions_edge_list.txt
│ ├── facebook_edge_list.txt
│ ├── football_edge_list.txt
│ ├── karate_edge_list.txt
│ ├── slashdot0811_edge_list.txt
│ ├── slashdot0902_edge_list.txt
│ └── wiki_vote_edge_list.txt
├── License.md
├── Metrics/
│ ├── MultiplexNMI-Benchmark/
│ │ ├── MultiplexBenchmark/
│ │ │ ├── ReadMe.txt
│ │ │ ├── Sources/
│ │ │ │ ├── benchm.cpp
│ │ │ │ ├── cast.cpp
│ │ │ │ ├── cc.cpp
│ │ │ │ ├── combinatorics.cpp
│ │ │ │ ├── histograms.cpp
│ │ │ │ ├── print.cpp
│ │ │ │ ├── random.cpp
│ │ │ │ ├── set_parameters.cpp
│ │ │ │ ├── standard_bench.cpp
│ │ │ │ └── standard_include.cpp
│ │ │ ├── Thanks.txt
│ │ │ ├── gpl.txt
│ │ │ └── makefile
│ │ └── MultiplexNMI/
│ │ ├── ReadMe.txt
│ │ ├── clu1
│ │ ├── clu2
│ │ ├── nmi_multiplex.cpp
│ │ └── standard_package/
│ │ ├── assert.cpp
│ │ ├── cast.cpp
│ │ ├── combinatorics.cpp
│ │ ├── deque_numeric.cpp
│ │ ├── histograms.cpp
│ │ ├── map_utilities.cpp
│ │ ├── mutual.cpp
│ │ ├── pajek.cpp
│ │ ├── partition.cpp
│ │ ├── print.cpp
│ │ ├── random.cpp
│ │ ├── standard_include.cpp
│ │ └── tabdeg.cpp
│ ├── ReadMe.md
│ ├── __init__.py
│ ├── analyze_algo_quality.py
│ ├── cis_fb.out
│ ├── facebook_combined.txt
│ ├── metrics/
│ │ ├── __init__.py
│ │ ├── demo_graph.csv
│ │ ├── link_belong_modularity.py
│ │ ├── omega_idx.py
│ │ ├── overlap_nmi.py
│ │ └── util.py
│ ├── mutual3/
│ │ ├── ReadMe.txt
│ │ ├── makefile
│ │ ├── mutual
│ │ ├── mutual3.cpp
│ │ └── standard_package/
│ │ ├── Icon
│ │ ├── cast.cpp
│ │ ├── combinatorics.cpp
│ │ ├── deque_numeric.cpp
│ │ ├── histograms.cpp
│ │ ├── mutual.cpp
│ │ ├── partition.cpp
│ │ ├── print.cpp
│ │ ├── random.cpp
│ │ └── standard_include.cpp
│ └── play_ground/
│ ├── __init__.py
│ └── play_ground.py
├── NonOverlappingCodes/
│ ├── 2005-Markov-Clustering/
│ │ ├── ReadMe.md
│ │ └── mcl-14-137/
│ │ ├── AUTHORS
│ │ ├── COPYING
│ │ ├── ChangeLog
│ │ ├── INSTALL
│ │ ├── LICENSE
│ │ ├── Makefile.am
│ │ ├── Makefile.in
│ │ ├── NEWS
│ │ ├── README
│ │ ├── THANKS
│ │ ├── TODO
│ │ ├── VERSION
│ │ ├── acinclude.m4
│ │ ├── aclocal.m4
│ │ ├── autofoo/
│ │ │ ├── config.guess
│ │ │ ├── config.sub
│ │ │ ├── depcomp
│ │ │ ├── install-sh
│ │ │ └── missing
│ │ ├── bootstrap
│ │ ├── config.h.in
│ │ ├── configure
│ │ ├── configure.ac
│ │ ├── configure.ac.in
│ │ ├── doc/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── clm.1
│ │ │ ├── clm.azm
│ │ │ ├── clm.html
│ │ │ ├── clm.ps
│ │ │ ├── clmclose.1
│ │ │ ├── clmclose.azm
│ │ │ ├── clmclose.html
│ │ │ ├── clmclose.ps
│ │ │ ├── clmdist.1
│ │ │ ├── clmdist.azm
│ │ │ ├── clmdist.html
│ │ │ ├── clmdist.ps
│ │ │ ├── clmformat.1
│ │ │ ├── clmformat.azm
│ │ │ ├── clmformat.html
│ │ │ ├── clmformat.ps
│ │ │ ├── clmimac.1
│ │ │ ├── clmimac.azm
│ │ │ ├── clmimac.html
│ │ │ ├── clmimac.ps
│ │ │ ├── clminfo.1
│ │ │ ├── clminfo.azm
│ │ │ ├── clminfo.html
│ │ │ ├── clminfo.ps
│ │ │ ├── clminfo2.1
│ │ │ ├── clminfo2.azm
│ │ │ ├── clminfo2.html
│ │ │ ├── clminfo2.ps
│ │ │ ├── clmmate.1
│ │ │ ├── clmmate.azm
│ │ │ ├── clmmate.html
│ │ │ ├── clmmate.ps
│ │ │ ├── clmmeet.1
│ │ │ ├── clmmeet.azm
│ │ │ ├── clmmeet.html
│ │ │ ├── clmmeet.ps
│ │ │ ├── clmoptics.1
│ │ │ ├── clmoptics.azm
│ │ │ ├── clmoptics.html
│ │ │ ├── clmoptics.ps
│ │ │ ├── clmorder.1
│ │ │ ├── clmorder.azm
│ │ │ ├── clmorder.html
│ │ │ ├── clmorder.ps
│ │ │ ├── clmprotocols.5
│ │ │ ├── clmprotocols.azm
│ │ │ ├── clmprotocols.html
│ │ │ ├── clmprotocols.ps
│ │ │ ├── clmprotocols2.5
│ │ │ ├── clmprotocols2.azm
│ │ │ ├── clmprotocols2.html
│ │ │ ├── clmprotocols2.ps
│ │ │ ├── clmresidue.1
│ │ │ ├── clmresidue.azm
│ │ │ ├── clmresidue.html
│ │ │ ├── clmresidue.ps
│ │ │ ├── clmvol.1
│ │ │ ├── clmvol.azm
│ │ │ ├── clmvol.html
│ │ │ ├── clmvol.ps
│ │ │ ├── distindex.html
│ │ │ ├── index.html
│ │ │ ├── index.in.azm
│ │ │ ├── mcl.1
│ │ │ ├── mcl.azm
│ │ │ ├── mcl.html
│ │ │ ├── mcl.ps
│ │ │ ├── mcl.txt
│ │ │ ├── mclblastline.html
│ │ │ ├── mclblastline.ps
│ │ │ ├── mclcm.1
│ │ │ ├── mclcm.azm
│ │ │ ├── mclcm.html
│ │ │ ├── mclcm.ps
│ │ │ ├── mclcm.txt
│ │ │ ├── mclfamily.7
│ │ │ ├── mclfamily.azm
│ │ │ ├── mclfamily.html
│ │ │ ├── mclfamily.ps
│ │ │ ├── mclfaq.7
│ │ │ ├── mclfaq.azm
│ │ │ ├── mclfaq.html
│ │ │ ├── mclfaq.ps
│ │ │ ├── mclfaq.txt
│ │ │ ├── mclindex.7
│ │ │ ├── mclindex.ps
│ │ │ ├── mclmcl.txt
│ │ │ ├── mclpipeline.1
│ │ │ ├── mclpipeline.azm
│ │ │ ├── mclpipeline.html
│ │ │ ├── mclpipeline.ps
│ │ │ ├── mcx.1
│ │ │ ├── mcx.azm
│ │ │ ├── mcx.html
│ │ │ ├── mcx.ps
│ │ │ ├── mcx.zmm
│ │ │ ├── mcxalter.1
│ │ │ ├── mcxalter.azm
│ │ │ ├── mcxalter.html
│ │ │ ├── mcxalter.ps
│ │ │ ├── mcxarray.1
│ │ │ ├── mcxarray.azm
│ │ │ ├── mcxarray.html
│ │ │ ├── mcxarray.ps
│ │ │ ├── mcxassemble.1
│ │ │ ├── mcxassemble.azm
│ │ │ ├── mcxassemble.html
│ │ │ ├── mcxassemble.ps
│ │ │ ├── mcxclcf.1
│ │ │ ├── mcxclcf.azm
│ │ │ ├── mcxclcf.html
│ │ │ ├── mcxclcf.ps
│ │ │ ├── mcxconvert.1
│ │ │ ├── mcxconvert.azm
│ │ │ ├── mcxconvert.html
│ │ │ ├── mcxconvert.ps
│ │ │ ├── mcxctty.1
│ │ │ ├── mcxctty.azm
│ │ │ ├── mcxctty.html
│ │ │ ├── mcxctty.ps
│ │ │ ├── mcxdeblast.html
│ │ │ ├── mcxdeblast.ps
│ │ │ ├── mcxdiameter.1
│ │ │ ├── mcxdiameter.azm
│ │ │ ├── mcxdiameter.html
│ │ │ ├── mcxdiameter.ps
│ │ │ ├── mcxdump.1
│ │ │ ├── mcxdump.azm
│ │ │ ├── mcxdump.html
│ │ │ ├── mcxdump.ps
│ │ │ ├── mcxerdos.1
│ │ │ ├── mcxerdos.azm
│ │ │ ├── mcxerdos.html
│ │ │ ├── mcxerdos.ps
│ │ │ ├── mcxi.1
│ │ │ ├── mcxi.azm
│ │ │ ├── mcxi.html
│ │ │ ├── mcxi.ps
│ │ │ ├── mcxio.5
│ │ │ ├── mcxio.azm
│ │ │ ├── mcxio.html
│ │ │ ├── mcxio.ps
│ │ │ ├── mcxload.1
│ │ │ ├── mcxload.azm
│ │ │ ├── mcxload.html
│ │ │ ├── mcxload.ps
│ │ │ ├── mcxmap.1
│ │ │ ├── mcxmap.azm
│ │ │ ├── mcxmap.html
│ │ │ ├── mcxmap.ps
│ │ │ ├── mcxquery.1
│ │ │ ├── mcxquery.azm
│ │ │ ├── mcxquery.html
│ │ │ ├── mcxquery.ps
│ │ │ ├── mcxrand.1
│ │ │ ├── mcxrand.azm
│ │ │ ├── mcxrand.html
│ │ │ ├── mcxrand.ps
│ │ │ ├── mcxsubs.1
│ │ │ ├── mcxsubs.azm
│ │ │ ├── mcxsubs.html
│ │ │ ├── mcxsubs.ps
│ │ │ ├── minimcl
│ │ │ ├── stamp.day
│ │ │ ├── stamp.month
│ │ │ ├── stamp.stamp
│ │ │ ├── stamp.year
│ │ │ ├── tingea.log.7
│ │ │ ├── tingea.log.azm
│ │ │ ├── tingea.log.html
│ │ │ └── tingea.log.ps
│ │ ├── graphs/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── T
│ │ │ ├── Tx
│ │ │ ├── Txy
│ │ │ ├── Ty
│ │ │ ├── data.abc.hdr
│ │ │ ├── data.abc.raw
│ │ │ ├── data.hdr
│ │ │ ├── data.raw
│ │ │ ├── data.tab
│ │ │ ├── falkner.coords
│ │ │ ├── falkner.mci
│ │ │ ├── falkner2.mci
│ │ │ ├── friends
│ │ │ ├── fznyy.mci
│ │ │ ├── fznyy.tab
│ │ │ ├── honey.mci
│ │ │ ├── infinity.mci
│ │ │ ├── lattice.mci
│ │ │ ├── make-falkner.pl
│ │ │ ├── matula.mci
│ │ │ ├── petersen.mci
│ │ │ ├── proteins.mci
│ │ │ ├── seven.mci
│ │ │ ├── small.mci
│ │ │ ├── small.tab
│ │ │ ├── small64.mci
│ │ │ ├── tiny-min.mci
│ │ │ ├── tiny-nil.mci
│ │ │ ├── tiny-nilnine.mci
│ │ │ ├── tiny-ninenil.mci
│ │ │ ├── tiny-one.mci
│ │ │ └── tiny-zero.mci
│ │ ├── img/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── fa.ps
│ │ │ ├── falkner-bidi.ps
│ │ │ ├── falkner.ps
│ │ │ └── small.ps
│ │ ├── include/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ └── include.am
│ │ ├── mkinstalldirs
│ │ ├── scripts/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── TODO
│ │ │ ├── clmsnare
│ │ │ ├── clxcoarse
│ │ │ ├── clxdo
│ │ │ ├── docme
│ │ │ ├── gengraph
│ │ │ ├── mcxplotlines.R
│ │ │ ├── minimcl
│ │ │ ├── mlm-analyze
│ │ │ ├── mlm-fifofum
│ │ │ ├── mlm-quilt
│ │ │ ├── mlm-summary
│ │ │ ├── movgraph
│ │ │ ├── packed-example.sh
│ │ │ ├── packed-example2.sh
│ │ │ ├── pichi
│ │ │ ├── piclo
│ │ │ └── tree3.pl
│ │ ├── setversion
│ │ ├── src/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── README
│ │ │ ├── alien/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ └── oxygen/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── doc/
│ │ │ │ │ ├── Makefile.am
│ │ │ │ │ ├── Makefile.in
│ │ │ │ │ ├── mclblastline.1
│ │ │ │ │ ├── mclblastline.azm
│ │ │ │ │ ├── mclblastline.html
│ │ │ │ │ ├── mclblastline.ps
│ │ │ │ │ ├── mcxdeblast.1
│ │ │ │ │ ├── mcxdeblast.azm
│ │ │ │ │ ├── mcxdeblast.html
│ │ │ │ │ └── mcxdeblast.ps
│ │ │ │ └── src/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── mclblastline
│ │ │ │ └── mcxdeblast
│ │ │ ├── clew/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── cat.c
│ │ │ │ ├── cat.h
│ │ │ │ ├── claw.c
│ │ │ │ ├── claw.h
│ │ │ │ ├── clm.c
│ │ │ │ ├── clm.h
│ │ │ │ ├── scan.c
│ │ │ │ └── scan.h
│ │ │ ├── gryphon/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── path.c
│ │ │ │ └── path.h
│ │ │ ├── impala/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── app.c
│ │ │ │ ├── app.h
│ │ │ │ ├── compose.c
│ │ │ │ ├── compose.h
│ │ │ │ ├── edge.c
│ │ │ │ ├── edge.h
│ │ │ │ ├── iface.c
│ │ │ │ ├── iface.h
│ │ │ │ ├── io.c
│ │ │ │ ├── io.h
│ │ │ │ ├── ivp.c
│ │ │ │ ├── ivp.h
│ │ │ │ ├── ivptypes.h
│ │ │ │ ├── matrix.c
│ │ │ │ ├── matrix.h
│ │ │ │ ├── pval.c
│ │ │ │ ├── pval.h
│ │ │ │ ├── stream.c
│ │ │ │ ├── stream.h
│ │ │ │ ├── tab.c
│ │ │ │ ├── tab.h
│ │ │ │ ├── vector.c
│ │ │ │ ├── vector.h
│ │ │ │ ├── version.c
│ │ │ │ └── version.h
│ │ │ ├── mcl/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── alg.c
│ │ │ │ ├── alg.h
│ │ │ │ ├── dpsd.c
│ │ │ │ ├── dpsd.h
│ │ │ │ ├── expand.c
│ │ │ │ ├── expand.h
│ │ │ │ ├── inflate.c
│ │ │ │ ├── inflate.h
│ │ │ │ ├── interpret.c
│ │ │ │ ├── interpret.h
│ │ │ │ ├── proc.c
│ │ │ │ ├── proc.h
│ │ │ │ ├── procinit.c
│ │ │ │ ├── procinit.h
│ │ │ │ ├── shadow.c
│ │ │ │ ├── shadow.h
│ │ │ │ ├── transform.c
│ │ │ │ └── transform.h
│ │ │ ├── shcl/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── clm.c
│ │ │ │ ├── clm.h
│ │ │ │ ├── clmadjust.c
│ │ │ │ ├── clmadjust.h
│ │ │ │ ├── clmclose.c
│ │ │ │ ├── clmclose.h
│ │ │ │ ├── clmdag.c
│ │ │ │ ├── clmdist.c
│ │ │ │ ├── clmdist.h
│ │ │ │ ├── clmformat.c
│ │ │ │ ├── clmformat.zmm
│ │ │ │ ├── clmformat.zmm.h
│ │ │ │ ├── clmframe.c
│ │ │ │ ├── clmimac.c
│ │ │ │ ├── clmimac.h
│ │ │ │ ├── clminfo.c
│ │ │ │ ├── clminfo.h
│ │ │ │ ├── clminfo2.c
│ │ │ │ ├── clminfo2.h
│ │ │ │ ├── clmmate.c
│ │ │ │ ├── clmmate.h
│ │ │ │ ├── clmmeet.c
│ │ │ │ ├── clmmeet.h
│ │ │ │ ├── clmoptics.c
│ │ │ │ ├── clmoptics.h
│ │ │ │ ├── clmorder.c
│ │ │ │ ├── clmorder.h
│ │ │ │ ├── clmps.c
│ │ │ │ ├── clmps.defs
│ │ │ │ ├── clmps.defs.h
│ │ │ │ ├── clmps.h
│ │ │ │ ├── clmresidue.c
│ │ │ │ ├── clmresidue.h
│ │ │ │ ├── mclgraga
│ │ │ │ ├── mclgrep
│ │ │ │ ├── mclpipeline
│ │ │ │ ├── report.c
│ │ │ │ └── report.h
│ │ │ ├── shmcl/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── mcl.c
│ │ │ │ └── mclcm.c
│ │ │ ├── shmcx/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── TODO
│ │ │ │ ├── glob.c
│ │ │ │ ├── glob.h
│ │ │ │ ├── mcxi.c
│ │ │ │ ├── ops.c
│ │ │ │ ├── ops.h
│ │ │ │ ├── stack.c
│ │ │ │ ├── stack.h
│ │ │ │ ├── util.c
│ │ │ │ └── util.h
│ │ │ ├── shmcxquery/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── TODO
│ │ │ │ └── mcxquery.c
│ │ │ └── shmx/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── README
│ │ │ ├── TODO
│ │ │ ├── fake
│ │ │ ├── mcx.c
│ │ │ ├── mcx.h
│ │ │ ├── mcxalter.c
│ │ │ ├── mcxalter.h
│ │ │ ├── mcxarray.c
│ │ │ ├── mcxassemble.c
│ │ │ ├── mcxclcf.c
│ │ │ ├── mcxclcf.h
│ │ │ ├── mcxcollect.c
│ │ │ ├── mcxcollect.h
│ │ │ ├── mcxconvert.c
│ │ │ ├── mcxconvert.h
│ │ │ ├── mcxdiameter.c
│ │ │ ├── mcxdiameter.h
│ │ │ ├── mcxdump.c
│ │ │ ├── mcxerdos.c
│ │ │ ├── mcxerdos.h
│ │ │ ├── mcxfp.c
│ │ │ ├── mcxfp.h
│ │ │ ├── mcxload.c
│ │ │ ├── mcxmap.c
│ │ │ ├── mcxmetric.c
│ │ │ ├── mcxminusmeet.c
│ │ │ ├── mcxmm.c
│ │ │ ├── mcxquery.c
│ │ │ ├── mcxquery.h
│ │ │ ├── mcxrand.c
│ │ │ ├── mcxsubs.c
│ │ │ ├── mcxtab.c
│ │ │ ├── mcxtab.h
│ │ │ ├── mcxtest.c
│ │ │ └── mcxtest2.c
│ │ ├── testing/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── blast/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ ├── blastfile
│ │ │ │ └── blastfile9
│ │ │ ├── setops/
│ │ │ │ ├── Makefile.am
│ │ │ │ ├── Makefile.in
│ │ │ │ └── set-test.sh
│ │ │ └── stream/
│ │ │ ├── Makefile.am
│ │ │ ├── Makefile.in
│ │ │ ├── abc-pairs.pl
│ │ │ ├── abc-test.sh
│ │ │ ├── abc.pl
│ │ │ └── az.tab
│ │ └── util/
│ │ ├── Makefile.am
│ │ ├── Makefile.in
│ │ ├── alloc.c
│ │ ├── alloc.h
│ │ ├── array.c
│ │ ├── array.h
│ │ ├── compile.h
│ │ ├── ding.c
│ │ ├── ding.h
│ │ ├── equate.c
│ │ ├── equate.h
│ │ ├── err.c
│ │ ├── err.h
│ │ ├── getpagesize.h
│ │ ├── gralloc.c
│ │ ├── gralloc.h
│ │ ├── hash.c
│ │ ├── hash.h
│ │ ├── heap.c
│ │ ├── heap.h
│ │ ├── inttypes.h
│ │ ├── io.c
│ │ ├── io.h
│ │ ├── let.c
│ │ ├── let.h
│ │ ├── list.c
│ │ ├── list.h
│ │ ├── minmax.h
│ │ ├── opt.c
│ │ ├── opt.h
│ │ ├── rand.c
│ │ ├── rand.h
│ │ ├── ting.c
│ │ ├── ting.h
│ │ ├── tok.c
│ │ ├── tok.h
│ │ ├── tr.c
│ │ ├── tr.h
│ │ ├── types.c
│ │ └── types.h
│ ├── 2008-Louvain-MultiLevel-Aggregation-Opt-Modularity/
│ │ ├── Makefile
│ │ ├── ReadMe.md
│ │ ├── community.cpp
│ │ ├── community.h
│ │ ├── graph.cpp
│ │ ├── graph.h
│ │ ├── graph_binary.cpp
│ │ ├── graph_binary.h
│ │ ├── main_community.cpp
│ │ ├── main_convert.cpp
│ │ ├── main_hierarchy.cpp
│ │ ├── main_random.cpp
│ │ └── readme.txt
│ ├── 2008-Sequential-Clique-Percolation/
│ │ ├── License.txt
│ │ ├── ReadMe.md
│ │ ├── cliqueHash.cpp
│ │ ├── cliqueHash.h
│ │ ├── communityTracker.cpp
│ │ ├── communityTracker.h
│ │ ├── dendrogram.cpp
│ │ ├── dendrogram.h
│ │ ├── k_clique.cpp
│ │ ├── k_clique.h
│ │ ├── kruskal.cpp
│ │ ├── kruskal.h
│ │ ├── lcelib/
│ │ │ ├── Containers.H
│ │ │ ├── License.txt
│ │ │ ├── Nets.H
│ │ │ ├── Neural/
│ │ │ │ └── NNet.H
│ │ │ ├── PrefetchPolicy.H
│ │ │ ├── Randgens.H
│ │ │ ├── bits/
│ │ │ │ ├── EmbBoolSelector.H
│ │ │ │ ├── FiboHeapCore.H
│ │ │ │ └── hashcore.H
│ │ │ ├── containers/
│ │ │ │ ├── ArrayBase.H
│ │ │ │ ├── ContainerPolicies.H
│ │ │ │ ├── DefaultIndexParams.H
│ │ │ │ ├── KeyPolicy.H
│ │ │ │ ├── Pair.H
│ │ │ │ ├── WeightPolicy.H
│ │ │ │ ├── indices/
│ │ │ │ │ ├── Array.H
│ │ │ │ │ ├── AutoVec.H
│ │ │ │ │ ├── HashControllers.H
│ │ │ │ │ ├── LinearHash.H
│ │ │ │ │ ├── OrderedArray.H
│ │ │ │ │ ├── TableWithStatus.H
│ │ │ │ │ └── Vector.H
│ │ │ │ └── tables/
│ │ │ │ ├── ExplSumTreeTable.H
│ │ │ │ ├── ImplSumTreeTable.H
│ │ │ │ ├── ImplTreeHelper.H
│ │ │ │ ├── StubBase.H
│ │ │ │ ├── ValueTable.H
│ │ │ │ └── WeightSumTable.H
│ │ │ ├── hashes.H
│ │ │ ├── k_clique/
│ │ │ │ ├── cliqueHash.H
│ │ │ │ ├── multiIter.H
│ │ │ │ ├── numSet.H
│ │ │ │ ├── numSet2.H
│ │ │ │ └── weighedClique.H
│ │ │ ├── misc/
│ │ │ │ ├── Bindata.H
│ │ │ │ ├── BinomialSampler.H
│ │ │ │ ├── CalQueue.H
│ │ │ │ ├── EventQueue.H
│ │ │ │ ├── FiboHeap.H
│ │ │ │ ├── KruskalTree.H
│ │ │ │ └── KruskalTree2.H
│ │ │ ├── nets/
│ │ │ │ ├── Dijkstrator.H
│ │ │ │ ├── DirNetExtras.H
│ │ │ │ ├── Distributions.H
│ │ │ │ ├── Models.H
│ │ │ │ ├── NetExtras.H
│ │ │ │ ├── NetExtras2.H
│ │ │ │ ├── OldModels.H
│ │ │ │ ├── Randomizer.H
│ │ │ │ ├── UnweightedDijk.H
│ │ │ │ └── models/
│ │ │ │ ├── BA.H
│ │ │ │ ├── BBV.H
│ │ │ │ ├── Boguna.H
│ │ │ │ ├── CommunityNet.H
│ │ │ │ ├── Davidsen.H
│ │ │ │ ├── ErdosRenyi.H
│ │ │ │ ├── HolmeKim.H
│ │ │ │ ├── Marsili.H
│ │ │ │ ├── SeedNet.H
│ │ │ │ ├── SimpleNets.H
│ │ │ │ ├── VDEB.H
│ │ │ │ └── Wong.H
│ │ │ └── packedqueue.H
│ │ ├── makefile
│ │ ├── nodeCommunities.cpp
│ │ ├── nodeCommunities.h
│ │ ├── testData/
│ │ │ ├── random_1000_005.edg
│ │ │ └── random_1000_005.edg_files/
│ │ │ ├── k=3/
│ │ │ │ └── communities
│ │ │ ├── k=4/
│ │ │ │ └── communities
│ │ │ └── k=5/
│ │ │ └── communities
│ │ ├── testScp.py
│ │ ├── weighedClique.cpp
│ │ └── weighedClique.h
│ ├── 2009-Community-Infomap-MapEquation/
│ │ ├── .gitignore
│ │ ├── .hgignore
│ │ ├── CHANGES.txt
│ │ ├── LICENSE_AGPLv3.txt
│ │ ├── Makefile
│ │ ├── README.txt
│ │ ├── ReadMe.md
│ │ ├── examples/
│ │ │ ├── R/
│ │ │ │ ├── Makefile
│ │ │ │ ├── example-igraph.R
│ │ │ │ ├── example-minimal.R
│ │ │ │ └── load-infomap.R
│ │ │ ├── cpp/
│ │ │ │ ├── Infomap-igraph-interface-library/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ └── src/
│ │ │ │ │ ├── Infomap-igraph-interface.cpp
│ │ │ │ │ └── Infomap-igraph-interface.h
│ │ │ │ ├── igraph/
│ │ │ │ │ ├── Makefile
│ │ │ │ │ └── example-igraph.cpp
│ │ │ │ └── minimal/
│ │ │ │ ├── Makefile
│ │ │ │ ├── example.cpp
│ │ │ │ ├── mem-example.cpp
│ │ │ │ └── multi-example.cpp
│ │ │ ├── js/
│ │ │ │ ├── Infomap-worker.html
│ │ │ │ └── Makefile
│ │ │ └── python/
│ │ │ ├── Infomap.py
│ │ │ ├── Makefile
│ │ │ ├── example-file-io.py
│ │ │ └── example-networkx.py
│ │ ├── interfaces/
│ │ │ ├── js/
│ │ │ │ └── pre-worker-module.js
│ │ │ ├── python/
│ │ │ │ └── setup.py
│ │ │ └── swig/
│ │ │ ├── Config.i
│ │ │ ├── Date.i
│ │ │ ├── HierarchicalNetwork.i
│ │ │ ├── Infomap.i
│ │ │ └── Network.i
│ │ ├── ninetriangles.net
│ │ └── src/
│ │ ├── Infomap.cpp
│ │ ├── Infomap.h
│ │ ├── Informatter.cpp
│ │ ├── infomap/
│ │ │ ├── Edge.h
│ │ │ ├── FlowNetwork.cpp
│ │ │ ├── FlowNetwork.h
│ │ │ ├── InfomapBase.cpp
│ │ │ ├── InfomapBase.h
│ │ │ ├── InfomapContext.cpp
│ │ │ ├── InfomapContext.h
│ │ │ ├── InfomapGreedy.h
│ │ │ ├── InfomapGreedyCommon.h
│ │ │ ├── InfomapGreedySpecialized.h
│ │ │ ├── InfomapGreedyTypeSpecialized.h
│ │ │ ├── MemFlowNetwork.cpp
│ │ │ ├── MemFlowNetwork.h
│ │ │ ├── MemNetwork.cpp
│ │ │ ├── MemNetwork.h
│ │ │ ├── MemoryNetworkAdapter.cpp
│ │ │ ├── MemoryNetworkAdapter.h
│ │ │ ├── MultiplexNetwork.cpp
│ │ │ ├── MultiplexNetwork.h
│ │ │ ├── Network.cpp
│ │ │ ├── Network.h
│ │ │ ├── NetworkAdapter.cpp
│ │ │ ├── NetworkAdapter.h
│ │ │ ├── Node.cpp
│ │ │ ├── Node.h
│ │ │ ├── NodeFactory.h
│ │ │ ├── TreeData.cpp
│ │ │ ├── TreeData.h
│ │ │ ├── flowData.h
│ │ │ ├── flowData_traits.h
│ │ │ └── treeIterators.h
│ │ ├── io/
│ │ │ ├── BipartiteClusterReader.cpp
│ │ │ ├── BipartiteClusterReader.h
│ │ │ ├── ClusterReader.cpp
│ │ │ ├── ClusterReader.h
│ │ │ ├── Config.h
│ │ │ ├── HierarchicalNetwork.cpp
│ │ │ ├── HierarchicalNetwork.h
│ │ │ ├── ProgramInterface.cpp
│ │ │ ├── ProgramInterface.h
│ │ │ ├── SafeFile.h
│ │ │ ├── TreeDataWriter.cpp
│ │ │ ├── TreeDataWriter.h
│ │ │ ├── convert.h
│ │ │ ├── version.cpp
│ │ │ └── version.h
│ │ └── utils/
│ │ ├── Date.h
│ │ ├── FileURI.cpp
│ │ ├── FileURI.h
│ │ ├── Logger.cpp
│ │ ├── Logger.h
│ │ ├── MersenneTwister.h
│ │ ├── Stopwatch.h
│ │ ├── gap_iterator.h
│ │ ├── infomath.h
│ │ └── types.h
│ ├── 2014-Grappolo/
│ │ ├── Makefile
│ │ ├── README.txt
│ │ ├── RngStream.cpp
│ │ ├── RngStream.h
│ │ ├── binary/
│ │ │ └── convertFileToBinary
│ │ ├── buildNextPhase.cpp
│ │ ├── coloringDistanceOne.cpp
│ │ ├── convertFileToBinary.cpp
│ │ ├── convertFileToEdgeList.cpp
│ │ ├── convertSnapFileToBinary.cpp
│ │ ├── defs.h
│ │ ├── driverForColoringExperiments.cpp
│ │ ├── driverForGraphClustering.cpp
│ │ ├── driverForGraphClusteringBigMem.cpp
│ │ ├── driverForPartitioningWithMetis.cpp
│ │ ├── driverProcessPowerGridNetworks.cpp
│ │ ├── generateRGG.cpp
│ │ ├── generateRMAT.cpp
│ │ ├── input/
│ │ │ ├── karate.graph
│ │ │ └── west1505.gr
│ │ ├── louvainMultiPhaseRun.cpp
│ │ ├── parallelLouvainMethod.cpp
│ │ ├── parallelLouvainMethodEager.cpp
│ │ ├── parallelLouvainWithColoring.cpp
│ │ ├── parseInputFiles.cpp
│ │ ├── parseInputParameters.cpp
│ │ ├── scripts/
│ │ │ └── RunWithValgrind.sh
│ │ ├── utilityClusteringFunctions.cpp
│ │ ├── utilityClusteringFunctions.h
│ │ ├── utilityFunctions.cpp
│ │ ├── utilityGraphPartitioner.cpp
│ │ ├── utilityGraphPartitioner.h
│ │ ├── utilityParseInputParameters.hpp
│ │ ├── utilityStringTokenizer.hpp
│ │ ├── vertexFollowing.cpp
│ │ └── writeGraphDimacsFormat.cpp
│ └── ReadMe.md
├── Prensentation/
│ ├── ReadMe.md
│ ├── __init__.py
│ ├── algorithms/
│ │ ├── clique_percolation/
│ │ │ ├── community_result_visualization.py
│ │ │ ├── conradlee_clique_percolation.py
│ │ │ ├── example_edge_list.txt
│ │ │ └── problem_vis.py
│ │ ├── dynamics/
│ │ │ ├── async_lp_res0.txt
│ │ │ ├── example_edge_list.txt
│ │ │ ├── label_propagation.py
│ │ │ ├── label_propagation_yche.py
│ │ │ ├── others/
│ │ │ │ ├── aync_vs_sync.py
│ │ │ │ ├── copra_lpa.py
│ │ │ │ └── lpa.py
│ │ │ ├── prev/
│ │ │ │ ├── disjoint_community.txt
│ │ │ │ └── disjoint_visualization.py
│ │ │ ├── problem_vis.py
│ │ │ └── sync_lp_res0.txt
│ │ ├── link_partition/
│ │ │ ├── example_edge_list.txt
│ │ │ ├── graph_io_helper.py
│ │ │ ├── input/
│ │ │ │ └── get_karate_edge_list.py
│ │ │ ├── link_clustering.py
│ │ │ ├── link_clustering_algo.py
│ │ │ ├── result/
│ │ │ │ ├── example_edge_list_dendro.cid2edge.txt
│ │ │ │ ├── example_edge_list_dendro.linkage.txt
│ │ │ │ ├── example_edge_list_maxS0.250000_maxD0.777778.comm2edges.txt
│ │ │ │ ├── example_edge_list_maxS0.250000_maxD0.777778.comm2nodes.txt
│ │ │ │ ├── example_edge_list_maxS0.250000_maxD0.777778.edge2comm.txt
│ │ │ │ ├── example_edge_list_thr_D.txt
│ │ │ │ ├── karate_edge_list_maxS0.333333_maxD0.284758.comm2edges.txt
│ │ │ │ ├── karate_edge_list_maxS0.333333_maxD0.284758.comm2nodes.txt
│ │ │ │ ├── karate_edge_list_maxS0.333333_maxD0.284758.edge2comm.txt
│ │ │ │ └── karate_edge_list_thr_D.txt
│ │ │ └── visualization/
│ │ │ ├── dendrogram/
│ │ │ │ ├── dendrogram_vis.py
│ │ │ │ ├── radial_demo.py
│ │ │ │ ├── radial_grouper.py
│ │ │ │ ├── radial_support.py
│ │ │ │ └── radial_visualizer.py
│ │ │ └── link_clustering_visualization.py
│ │ ├── local_expansion/
│ │ │ ├── cis_algo.py
│ │ │ ├── cis_algo_output.txt
│ │ │ ├── cis_algo_res.txt
│ │ │ ├── cis_algo_visualization.py
│ │ │ ├── example_edge_list.txt
│ │ │ ├── karate_edge_list.txt
│ │ │ ├── problem_vis.py
│ │ │ ├── result_for_vis.txt
│ │ │ └── src/
│ │ │ ├── CMakeLists.txt
│ │ │ ├── cis_algo_output.txt
│ │ │ ├── cis_sequential_algorithm.cpp
│ │ │ ├── cis_sequential_algorithm.h
│ │ │ ├── demo_cis.cpp
│ │ │ └── util/
│ │ │ ├── ReadMe.md
│ │ │ ├── basic_io_helper.h
│ │ │ ├── graph_io_helper.cpp
│ │ │ ├── graph_io_helper.h
│ │ │ └── pretty_print.h
│ │ └── statistical_inference/
│ │ └── block_model_demo.py
│ ├── graph_serialization/
│ │ ├── __init__.py
│ │ ├── graph_formats.py
│ │ ├── input/
│ │ │ ├── __init__.py
│ │ │ └── example_graph.edgelist
│ │ ├── output_json/
│ │ │ ├── adjacency.json
│ │ │ └── node_link.json
│ │ ├── output_other/
│ │ │ ├── example_graph.gml
│ │ │ └── example_graph.pajek
│ │ ├── output_raw/
│ │ │ ├── __init__.py
│ │ │ ├── example_graph.adjlist
│ │ │ ├── example_graph.edgelist
│ │ │ └── example_graph.multiline_adjlist
│ │ ├── output_serialization/
│ │ │ ├── __init__.py
│ │ │ ├── example_graph.graph6
│ │ │ ├── example_graph.pickle
│ │ │ └── example_graph.yaml
│ │ └── output_xml/
│ │ ├── __init__.py
│ │ ├── example_graph.gexf
│ │ └── example_graph.graphml
│ ├── graph_tool_usage/
│ │ ├── intro_graph_tool/
│ │ │ ├── .gitignore
│ │ │ ├── begining.py
│ │ │ ├── draw_pie_graph.py
│ │ │ ├── graph_creation_basics.py
│ │ │ ├── graph_notations.md
│ │ │ └── nx2gt.py
│ │ └── play.py
│ ├── jupter_playground/
│ │ ├── .gitignore
│ │ ├── .ipynb_checkpoints/
│ │ │ ├── graph_draw_study0-checkpoint.ipynb
│ │ │ └── pie_graph-checkpoint.ipynb
│ │ ├── graph_draw_study0.ipynb
│ │ └── pie_graph.ipynb
│ ├── metrics/
│ │ ├── ReadMe.md
│ │ ├── __init__.py
│ │ ├── demo_graph.csv
│ │ ├── link_belong_modularity.py
│ │ ├── omega_idx.py
│ │ ├── overlap_nmi.py
│ │ ├── rand_idx_example.py
│ │ └── util.py
│ ├── problem_definition/
│ │ ├── demo_cis_output_result.txt
│ │ ├── demo_input_graph.txt
│ │ └── problem_vis.py
│ ├── social_network/
│ │ ├── disjoint_community_detection.py
│ │ ├── others/
│ │ │ └── visualization_different_colors.py
│ │ ├── visualization_karate.py
│ │ └── zachary_karate_club/
│ │ ├── __init__.py
│ │ ├── gml_formatter.py
│ │ ├── gml_parser.py
│ │ ├── karate.gml
│ │ ├── karate.txt
│ │ └── karate_new.gml
│ └── test.gml
├── README.md
├── Scripts/
│ └── dataset_aggragation.py
├── SubModules/
│ └── ReadMe.md
└── Survey/
├── Community-Detection-New-Findings.md
├── Community-Detection-Reading-List.md
├── Community-Detection-Survey.md
├── Community-Search-Survey.md
├── Conference-Papers-About-Graph/
│ └── VLDB.md
├── Overlapping-Community-Detection-Codes.md
├── ReadMe.md
└── Social-Media-Recommendation.md
Showing preview only (888K chars total). Download the full file or copy to clipboard to get everything.
SYMBOL INDEX (9797 symbols across 1202 files)
FILE: Algorithms/2008-CliquePercolation/conradlee_clique_percolation.py
function get_percolated_cliques (line 5) | def get_percolated_cliques(G, k):
FILE: Algorithms/2008-CliquePercolation/src_cpp/cliqueHash.h
function class (line 27) | class cliqueHash
FILE: Algorithms/2008-CliquePercolation/src_cpp/communityTracker.h
function class (line 33) | class CommunityTracker
FILE: Algorithms/2008-CliquePercolation/src_cpp/dendrogram.h
function class (line 30) | class Dendrogram
function compareNodes (line 67) | static bool compareNodes(DendrogramNode * first, DendrogramNode * second...
FILE: Algorithms/2008-CliquePercolation/src_cpp/k_clique.cpp
type Link (line 50) | struct Link{
method Link (line 54) | Link(size_t source=0,size_t dest=0, float weight=0.0) : source(source)...
function determineHashSize (line 60) | size_t determineHashSize(const size_t numElements, const size_t k)
function getNetSizeAndLinkNumbers (line 78) | bool getNetSizeAndLinkNumbers(char * fileName, size_t & netSize, size_t ...
function readLine (line 120) | bool readLine(std::ifstream & myfile, size_t & source, size_t & dest, f...
function kCliquesFind (line 144) | void kCliquesFind(std::vector<weighedClique> & cliqueVector, NetType & n...
function kCommunitiesFind (line 248) | void kCommunitiesFind(std::vector<weighedClique> & cliqueVector, Kruskal...
function outputCommunityStructure (line 294) | void outputCommunityStructure(KruskalTree & communities, cliqueHash & k1...
function unweightedSCP (line 323) | void unweightedSCP(NetType & net, std::list<Link> & linkList, const size...
function weighedCliqueCmp (line 374) | bool weighedCliqueCmp(const weighedClique lhs, const weighedClique rhs)
function kCommunitiesFindWeighted (line 379) | void kCommunitiesFindWeighted(std::vector<weighedClique> & cliqueVector,...
function weightedSCP (line 403) | void weightedSCP(NetType & net, std::ifstream & file, const size_t numbe...
function validateLinkList (line 434) | bool validateLinkList(std::list<Link> &linkList,size_t netSize,bool verb...
function percolation (line 453) | int percolation(char * fileName, const size_t k, const size_t weighted, ...
function main (line 481) | int main(int argc, char* argv[])
FILE: Algorithms/2008-CliquePercolation/src_cpp/k_clique.h
type Set (line 51) | typedef Set<size_t> nodeSet;
FILE: Algorithms/2008-CliquePercolation/src_cpp/kruskal.h
function class (line 28) | class KruskalTree
FILE: Algorithms/2008-CliquePercolation/src_cpp/nodeCommunities.h
type Set (line 30) | typedef Set<size_t> nodeSet;
function class (line 32) | class nodeCommunities
FILE: Algorithms/2008-CliquePercolation/src_cpp/script/testScp.py
function listComp (line 8) | def listComp(l1, l2):
function compareCommunities (line 17) | def compareCommunities(scpComms, cfComms):
FILE: Algorithms/2008-CliquePercolation/src_cpp/weighedClique.h
function class (line 29) | class clique
type SymmNet (line 82) | typedef SymmNet<float> NetType;
function class (line 86) | class weighedClique: public clique
FILE: Algorithms/2008-CliquePercolation/src_python/seq_clique_percolation.py
class Net (line 22) | class Net(object):
method __init__ (line 25) | def __init__(self):
method _legaledge (line 28) | def _legaledge(self, src, dst):
method _intsetedge (line 32) | def _intsetedge(self, src, dst, val):
method _setedge (line 46) | def _setedge(self, src, dst, val):
method __getitem__ (line 51) | def __getitem__(self, args):
method __setitem__ (line 64) | def __setitem__(self, key, val):
method __delitem__ (line 85) | def __delitem__(self, args):
method __iter__ (line 95) | def __iter__(self):
method isSymmetric (line 98) | def isSymmetric(self):
method __len__ (line 101) | def __len__(self):
class Node (line 105) | class Node(object):
method __init__ (line 106) | def __init__(self, net, index):
method __iter__ (line 110) | def __iter__(self):
method __getitem__ (line 116) | def __getitem__(self, index):
method __setitem__ (line 119) | def __setitem__(self, index, val):
method deg (line 123) | def deg(self):
class SymmNet (line 127) | class SymmNet(Net):
method _legaledge (line 130) | def _legaledge(self, src, dst):
method _intsetedge (line 139) | def _intsetedge(self, src, dst, val):
method isSymmetric (line 144) | def isSymmetric(self):
class Net_edges (line 149) | class Net_edges:
method __init__ (line 150) | def __init__(self, net):
method __iter__ (line 153) | def __iter__(self):
method __len__ (line 160) | def __len__(self):
method __str__ (line 169) | def __str__(self):
function getSubnet (line 176) | def getSubnet(net, nodes):
function loadNet_edg (line 197) | def loadNet_edg(input, mutualEdges=False, splitterChar=None, symmetricNe...
class Enumerator (line 245) | class Enumerator:
method __init__ (line 261) | def __init__(self):
method _addItem (line 265) | def _addItem(self, item):
method __getitem__ (line 271) | def __getitem__(self, item):
method getReverse (line 277) | def getReverse(self, number):
method __iter__ (line 280) | def __iter__(self):
method __len__ (line 283) | def __len__(self):
class NodeFamily (line 287) | class NodeFamily:
method __init__ (line 292) | def __init__(self, cmap={}, inputFile=None):
method _parseStrings (line 300) | def _parseStrings(self, input):
method __str__ (line 306) | def __str__(self):
method _sortBySize (line 314) | def _sortBySize(self):
method _addCommunity (line 317) | def _addCommunity(self, newCommunity):
method __getitem__ (line 320) | def __getitem__(self, index):
method __len__ (line 323) | def __len__(self):
method getSizeDist (line 326) | def getSizeDist(self):
method getGiant (line 339) | def getGiant(self):
method getGiantSize (line 352) | def getGiantSize(self):
method getSusceptibility (line 362) | def getSusceptibility(self, size=None):
method getCollapsed (line 402) | def getCollapsed(self):
method getNew (line 421) | def getNew(self, newNodes):
method getSetsForNodes (line 441) | def getSetsForNodes(self):
class KtreeInteger (line 456) | class KtreeInteger:
method __init__ (line 461) | def __init__(self, size=0):
method __getRealParent (line 468) | def __getRealParent(self, node):
method __setRealParent (line 478) | def __setRealParent(self, node, newParent):
method getParent (line 488) | def getParent(self, node):
method setParent (line 494) | def setParent(self, node, newParent):
method __iter__ (line 497) | def __iter__(self):
method getCommStruct (line 501) | def getCommStruct(self, separateElements=True):
method __len__ (line 518) | def __len__(self):
method mergeSetsWithElements (line 521) | def mergeSetsWithElements(self, elements):
method addEdge (line 526) | def addEdge(self, edge):
method setSize (line 529) | def setSize(self, newSize):
class Ktree (line 534) | class Ktree(KtreeInteger):
method __init__ (line 540) | def __init__(self, size=0):
method getParent (line 545) | def getParent(self, node):
method setParent (line 548) | def setParent(self, node, newParent):
method __iter__ (line 551) | def __iter__(self):
method getCommStruct (line 554) | def getCommStruct(self):
class EvaluationList (line 565) | class EvaluationList:
method __init__ (line 571) | def __init__(self, thelist, weightFunction=lambda x: x[2]):
method setEvaluations (line 578) | def setEvaluations(self, evaluationPoints):
method setLinearEvaluations (line 581) | def setLinearEvaluations(self, first, last, numberOfEvaluationPoints):
method setStrengthEvaluations (line 592) | def setStrengthEvaluations(self):
method setLastEvaluation (line 596) | def setLastEvaluation(self):
method __iter__ (line 599) | def __iter__(self):
function getKCliqueComponents (line 629) | def getKCliqueComponents(net, k):
class KClique (line 646) | class KClique(object):
method __init__ (line 652) | def __init__(self, nodelist, notSorted=True):
method __hash__ (line 658) | def __hash__(self):
method __iter__ (line 663) | def __iter__(self):
method __cmp__ (line 667) | def __cmp__(self, kclique):
method __add__ (line 673) | def __add__(self, kclique):
method getSubcliques (line 676) | def getSubcliques(self):
method __str__ (line 680) | def __str__(self):
method getEdges (line 683) | def getEdges(self):
method getK (line 689) | def getK(self):
function getIntensity (line 693) | def getIntensity(kclique, net):
class EvaluationEvent (line 700) | class EvaluationEvent:
method __init__ (line 701) | def __init__(self, threshold=None, addedElements=None):
function kcliquesAtSubnet (line 706) | def kcliquesAtSubnet(nodes, net, k):
function kcliquesByEdges (line 727) | def kcliquesByEdges(edges, k):
function kcliquesWeight (line 757) | def kcliquesWeight(net, k, weightFunction):
function communitiesByKCliques (line 764) | def communitiesByKCliques(kcliques):
function kcliquePercolator (line 783) | def kcliquePercolator(net, k, start, stop, evaluations, reverse=False, w...
FILE: Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Files/IOX.cc
function fline_tr (line 15) | bool fline_tr(ifstream* fin, vector<string>* fields, string delim)
function split_tr (line 52) | void split_tr(string input, vector < string >* fields, string delim){
function openFile (line 87) | bool openFile(ifstream* fin, string filename)
function openFileHarsh (line 108) | void openFileHarsh(ifstream* fin, string filename)
function FileError (line 119) | void FileError(const string& filename){
FILE: Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Files/StringEx.cc
function trim (line 12) | const std::string trim(const std::string& pString,
function replaceAll (line 34) | void replaceAll(string& str, const char& x, const char& y){
function string (line 50) | string replaceStrChar(string str, const string& replace, char ch)
FILE: Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/Format.cc
function ChangeDelimiter (line 16) | void ChangeDelimiter ( const string& filein, const string& fileout, cons...
function EncodeNetwork (line 50) | void EncodeNetwork ( const string& filein, const string& fileout, const ...
function DecodeCommunities (line 99) | void DecodeCommunities ( const string& filein, const string& fileout, co...
FILE: Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/Network.h
type cmp_str_ptr (line 9) | struct cmp_str_ptr{
type cmp_set_str (line 15) | struct cmp_set_str{
function class (line 31) | class Network {
FILE: Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/RandomNetwork.h
function RandomNetwork (line 7) | void RandomNetwork ( const int& V, const double& dist, const int& min_de...
FILE: Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/TemporalNetwork.h
type set (line 16) | typedef set < shared_ptr < string >, cmp_str_ptr > community;
function class (line 22) | class TemporalNetwork{
FILE: Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Params/Parameters.h
type sui (line 20) | typedef short unsigned int sui;
type lui (line 21) | typedef long unsigned int lui;
function class (line 28) | class Parameters {
FILE: Algorithms/2009-Connected-Iterative-Scan/src-orginal/main.cc
function Print (line 16) | void Print( const set < shared_ptr < string >, cmp_str_ptr >& seed ){
function CalcDensity (line 37) | double CalcDensity( const int& size, const double& Win, const double& Wo...
function Components (line 60) | map < double, set < shared_ptr < string >, cmp_str_ptr > > Components ( ...
function ExpandSeed (line 115) | void ExpandSeed ( set < shared_ptr < string >, cmp_str_ptr >& seed, shar...
function Print (line 306) | void Print( const set < shared_ptr < string >, cmp_str_ptr >& seed, ofst...
function main (line 323) | int main ( int argc, char** argv ){
FILE: Algorithms/2009-Connected-Iterative-Scan/src-refactor/graph/network.h
type cmp_str_ptr (line 11) | struct cmp_str_ptr {
type cmp_set_str (line 17) | struct cmp_set_str {
function class (line 34) | class network {
FILE: Algorithms/2009-Connected-Iterative-Scan/src-refactor/graph/temporal_network.h
type set (line 16) | typedef set<shared_ptr<string>, cmp_str_ptr> community;
function class (line 22) | class temporal_network {
FILE: Algorithms/2009-Connected-Iterative-Scan/src-refactor/main.cc
function Print (line 15) | void Print(const set<shared_ptr<string>, cmp_str_ptr> &seed) {
function CalcDensity (line 36) | double CalcDensity(const int &size, const double &Win, const double &Wou...
function Components (line 59) | map<double, set<shared_ptr<string>, cmp_str_ptr> >
function ExpandSeed (line 117) | void ExpandSeed(set<shared_ptr<string>, cmp_str_ptr> &seed, shared_ptr<n...
function Print (line 316) | void Print(const set<shared_ptr<string>, cmp_str_ptr> &seed, ofstream &f...
function main (line 333) | int main(int argc, char **argv) {
FILE: Algorithms/2009-Connected-Iterative-Scan/src-refactor/useless/RandomNetwork.h
function RandomNetwork (line 7) | void RandomNetwork ( const int& V, const double& dist, const int& min_de...
FILE: Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/graph_io_helper.cc
function ChangeDelimiter (line 16) | void ChangeDelimiter(const string &filein, const string &fileout, const ...
function EncodeNetwork (line 51) | void EncodeNetwork(const string &filein, const string &fileout, const ch...
function DecodeCommunities (line 102) | void DecodeCommunities(const string &filein, const string &fileout, cons...
FILE: Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/io_helper.cc
function fline_tr (line 15) | bool fline_tr(ifstream *fin, vector<string> *fields, string delim) {
function split_tr (line 49) | void split_tr(string input, vector<string> *fields, string delim) {
function openFile (line 82) | bool openFile(ifstream *fin, string filename) {
function openFileHarsh (line 101) | void openFileHarsh(ifstream *fin, string filename) {
function FileError (line 110) | void FileError(const string &filename) {
FILE: Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/parameters_helper.h
type sui (line 22) | typedef short unsigned int sui;
type lui (line 23) | typedef long unsigned int lui;
function class (line 30) | class parameters_helper {
FILE: Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/string_helper.cc
function trim (line 12) | const std::string trim(const std::string& pString,
function replaceAll (line 34) | void replaceAll(string& str, const char& x, const char& y){
function string (line 50) | string replaceStrChar(string str, const string& replace, char ch)
FILE: Algorithms/2009-EAGLE/graphs/tools/converter.py
function asdot (line 18) | def asdot(AS):
function select (line 25) | def select(x):
class Converter (line 28) | class Converter:
method reg (line 34) | def reg(self, v):
method add (line 43) | def add(self, data, mv):
method toFileAs (line 67) | def toFileAs(self, path):
method toGraph (line 75) | def toGraph(self):
FILE: Algorithms/2009-EAGLE/graphs/tools/examples.py
function example0 (line 7) | def example0():
function example1 (line 15) | def example1():
function example2 (line 25) | def example2():
function example3 (line 45) | def example3():
function example4 (line 54) | def example4():
function example5 (line 66) | def example5():
function example6 (line 74) | def example6():
function example7 (line 82) | def example7():
function example8 (line 88) | def example8():
FILE: Algorithms/2009-EAGLE/graphs/tools/progressbar.py
class ProgressBarWidget (line 62) | class ProgressBarWidget(object):
method update (line 69) | def update(self, pbar):
class ProgressBarWidgetHFill (line 79) | class ProgressBarWidgetHFill(object):
method update (line 88) | def update(self, pbar, width):
class ETA (line 100) | class ETA(ProgressBarWidget):
method format_time (line 102) | def format_time(self, seconds):
method update (line 104) | def update(self, pbar):
class FileTransferSpeed (line 114) | class FileTransferSpeed(ProgressBarWidget):
method __init__ (line 116) | def __init__(self, unit='B'):
method update (line 120) | def update(self, pbar):
class RotatingMarker (line 132) | class RotatingMarker(ProgressBarWidget):
method __init__ (line 134) | def __init__(self, markers='|/-\\'):
method update (line 137) | def update(self, pbar):
class Percentage (line 143) | class Percentage(ProgressBarWidget):
method update (line 145) | def update(self, pbar):
class SimpleProgress (line 148) | class SimpleProgress(ProgressBarWidget):
method __init__ (line 150) | def __init__(self, sep=' of '):
method update (line 152) | def update(self, pbar):
class Bar (line 155) | class Bar(ProgressBarWidgetHFill):
method __init__ (line 157) | def __init__(self, marker='#', left='|', right='|'):
method _format_marker (line 161) | def _format_marker(self, pbar):
method update (line 166) | def update(self, pbar, width):
class ReverseBar (line 174) | class ReverseBar(Bar):
method update (line 176) | def update(self, pbar, width):
class ProgressBar (line 185) | class ProgressBar(object):
method __init__ (line 233) | def __init__(self, maxval=None, widgets=default_widgets, term_width=None,
method __call__ (line 258) | def __call__(self, iterable):
method __iter__ (line 271) | def __iter__(self):
method next (line 274) | def next(self):
method _handle_resize (line 283) | def _handle_resize(self, signum, frame):
method percentage (line 287) | def percentage(self):
method _format_widgets (line 291) | def _format_widgets(self):
method _format_line (line 313) | def _format_line(self):
method _next_update (line 316) | def _next_update(self):
method _need_update (line 321) | def _need_update(self):
method update (line 341) | def update(self, value):
method start (line 355) | def start(self):
method finish (line 378) | def finish(self):
FILE: Algorithms/2009-EAGLE/src/communities.cpp
function BOOST_FOREACH (line 73) | BOOST_FOREACH(CID c, keys) {
function BOOST_FOREACH (line 84) | BOOST_FOREACH(CID c, toDelete) {
function BOOST_FOREACH (line 190) | BOOST_FOREACH(unsigned int i, keys) {
function CID (line 267) | CID Communities::registerCommunity(CommunityPtr c) {
function CID (line 275) | CID Communities::addCommunity(NodeSet *s) {
function CID (line 295) | CID Communities::addCommunity(igraph_vector_t *vector) {
function CID (line 315) | CID Communities::addCommunity(unsigned int i) {
FILE: Algorithms/2009-EAGLE/src/communities.h
type Community (line 27) | struct Community
type Node (line 29) | typedef unsigned int Node;
type CID (line 30) | typedef unsigned int CID;
type Community (line 32) | typedef Community *CommunityPtr;
type std (line 33) | typedef std::set<Node> NodeSet;
type NodeSet (line 34) | typedef const NodeSet *NodeSetPtr;
type boost (line 36) | typedef boost::unordered_map<CID, CommunityPtr> CommunitiesMap;
type boost (line 37) | typedef boost::unordered_map<Node, std::set<CID> > MembershipMap;
type Community (line 53) | struct Community {
function update (line 155) | inline
function degrees (line 184) | inline
function CommunityPtr (line 192) | inline
function CommunityPtr (line 203) | inline
function igraph_vector_t (line 213) | inline
function igraph_vs_t (line 226) | inline
function CommunityPtr (line 234) | inline
function class (line 250) | class Communities {
function size (line 412) | inline
function getDegree (line 418) | inline
function areConnected (line 423) | inline
function getCommunitySize (line 431) | inline
function ownership (line 436) | inline
function CommunityPtr (line 441) | inline
function conductance (line 460) | inline
function expansion (line 467) | inline
function internalDensity (line 474) | inline
function cutRatio (line 481) | inline
function normalizedCut (line 488) | inline
function linkDensity (line 497) | inline
function scaledLinkDensity (line 504) | inline
function maxODF (line 511) | inline
function avgODF (line 545) | inline
function flakeODF (line 580) | inline
function EQ (line 614) | inline
function similarity (line 648) | inline
function NodeSetPtr (line 665) | inline
FILE: Algorithms/2009-EAGLE/src/eagle.cpp
function Communities (line 67) | Communities *EAGLE::run() {
FILE: Algorithms/2009-EAGLE/src/eagle.h
function class (line 10) | class EAGLE {
FILE: Algorithms/2009-EAGLE/src/main.cpp
function main (line 6) | int main(int argc, char *argv[]) {
FILE: Algorithms/2009-EAGLE/src/max_cache.cpp
function Max (line 60) | Max MaxCache::get() {
FILE: Algorithms/2009-EAGLE/src/max_cache.h
type Max (line 14) | struct Max {
function class (line 45) | class MaxCache {
FILE: Algorithms/2009-LineGraph/src/TseGraph.h
function class (line 39) | class TseGraph {
FILE: Algorithms/2009-LineGraph/src/main.cpp
function printLineGraphTypes (line 27) | void
function printFileFormats (line 36) | void
function usage (line 63) | void
function usage (line 80) | void
function parse_args (line 88) | void
function display_time (line 137) | void
function makeLineGraph (line 158) | void
function main (line 261) | int main(int argc, char **argv) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/CM.java
class CM (line 19) | public class CM {
method CM (line 24) | public CM() {
method main (line 27) | public static void main(String[] var0) {
method realGraph (line 58) | private static void realGraph(String var0, String var1, int var2) {
method benchmarkGraph (line 91) | private static void benchmarkGraph(int var0, int var1, int var2, doubl...
method omegaResult (line 129) | private static void omegaResult(String var0, String var1, int var2) {
method omegaBGLL (line 140) | private static double omegaBGLL(String var0, String var1, int var2) {
method modularityResult (line 149) | private static void modularityResult(String var0, String var1) {
method printOmega (line 155) | private static void printOmega() {
method avgOmegaOthers (line 163) | private static void avgOmegaOthers(int var0) {
method avgOmegaCM (line 188) | private static void avgOmegaCM(int var0) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/algorithm/BK/BK.java
class BK (line 18) | public class BK {
method BK (line 27) | public BK() {
method main (line 30) | public static void main(String[] var0) throws FileNotFoundException {
method communityResults (line 50) | public static long communityResults(String var0, String var1, int var2...
method saveCliques (line 78) | private static void saveCliques(ArrayList var0) {
method printGraph (line 90) | private static void printGraph(ArrayList<HashSet<Integer>> var0) {
method calculate (line 107) | private static void calculate(ArrayList<HashSet<Integer>> var0) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/algorithm/BK/BronKerboschCFFast.java
class BronKerboschCFFast (line 13) | public class BronKerboschCFFast {
method BronKerboschCFFast (line 17) | public BronKerboschCFFast(ArrayList<HashSet<Integer>> var1) {
method getBiggestMaximalCliques (line 21) | public Collection<Set<Integer>> getBiggestMaximalCliques() {
method getAllMaximalCliques (line 47) | public Collection<Set<Integer>> getAllMaximalCliques() {
method findCliques (line 63) | private Set<Integer> findCliques(List<Integer> var1, List<Integer> var...
method check (line 129) | private void check(String var1, Set<Integer> var2, List<Integer> var3) {
method end (line 139) | private boolean end(List<Integer> var1, List<Integer> var2) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/algorithm/KJ/KJ.java
class KJ (line 22) | public class KJ {
method KJ (line 31) | public KJ() {
method main (line 34) | public static void main(String[] var0) throws FileNotFoundException {
method communityResults (line 54) | public static long communityResults(String var0, String var1, int var2...
method saveCliques (line 101) | private static void saveCliques(ArrayList var0) {
method converseTolist (line 113) | private static ArrayList converseTolist(HashSet<Integer> var0) {
method printGraph (line 125) | private static void printGraph(ArrayList<HashSet<Integer>> var0) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/algorithm/MaxClique.java
class MaxClique (line 19) | public class MaxClique {
method MaxClique (line 29) | public MaxClique() {
method main (line 32) | public static void main(String[] var0) {
method mcq (line 39) | public static HashSet<Integer> mcq(String var0) {
method mcq (line 45) | public static HashSet<Integer> mcq(ArrayList<HashSet<Integer>> var0, i...
method mcq (line 51) | public static HashSet<Integer> mcq(ArrayList<HashSet<Integer>> var0, A...
method readGraph (line 66) | private static int readGraph(String var0, ArrayList<HashSet<Integer>> ...
method convert_V (line 108) | public static ARRAY2 convert_V(int var0) {
method convert_e (line 120) | public static boolean[][] convert_e(ArrayList<HashSet<Integer>> var0) {
method MCQ (line 134) | private static long MCQ(ArrayList<HashSet<Integer>> var0, ARRAY2 var1,...
method vSort (line 156) | private static void vSort(ARRAY2 var0, TreeSet<ELEMENT> var1, ArrayLis...
method initVerts (line 170) | public static TreeSet<ELEMENT> initVerts(ARRAY2 var0, ArrayList<HashSe...
method EXPAND (line 188) | private static void EXPAND(ARRAY2 var0, boolean[][] var1, int var2) {
method CUT2 (line 213) | private static boolean CUT2(int var0, ARRAY2 var1, ARRAY2 var2, boolea...
method COLOR_SORT (line 227) | private static void COLOR_SORT(ARRAY2 var0, boolean[][] var1, int var2) {
method CUT1 (line 286) | private static boolean CUT1(int var0, ARRAY_FIX var1, boolean[][] var2) {
method COPY (line 295) | private static void COPY(ARRAY_FIX var0, ARRAY_FIX var1) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/input_output/ReadEdges.java
class ReadEdges (line 12) | public class ReadEdges {
method ReadEdges (line 13) | public ReadEdges() {
method readGraph (line 16) | public ArrayList<HashSet<Integer>> readGraph(String var1, int var2) th...
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/input_output/WriteCliques.java
class WriteCliques (line 12) | public class WriteCliques {
method WriteCliques (line 13) | public WriteCliques() {
method saveGraphfile (line 16) | public static void saveGraphfile(ArrayList<HashSet<Integer>> var0, Str...
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/ARRAY2.java
class ARRAY2 (line 8) | public class ARRAY2 {
method ARRAY2 (line 12) | public ARRAY2() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/ARRAY_FIX.java
class ARRAY_FIX (line 8) | public class ARRAY_FIX {
method ARRAY_FIX (line 12) | public ARRAY_FIX(int var1) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/Pair.java
class Pair (line 6) | public class Pair {
method Pair (line 10) | public Pair(int var1, int var2) {
method toString (line 15) | public String toString() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/Tree.java
class Tree (line 8) | public class Tree {
method Tree (line 14) | public Tree(HashSet<Integer> var1) {
method Tree (line 19) | public Tree(Tree var1, Tree var2) {
method add (line 25) | public void add(Tree var1) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/benchmark/GG.java
class GG (line 26) | public class GG {
method GG (line 32) | public GG() {
method main (line 35) | public static void main(String[] var0) {
method gen_benchmark (line 202) | public static int gen_benchmark(int var0, int var1, int var2, double v...
method run_command (line 233) | private static long run_command(String var0, boolean var1) {
method convert_bm_network (line 257) | public static void convert_bm_network(String var0, String var1) {
method convert_bm_community (line 280) | public static int convert_bm_community(String var0, String var1) {
method generate (line 327) | public static GGResult generate(int var0, int var1, int var2, double v...
method gen (line 336) | private static GGResult gen(int var0, int var1, int var2, double var3,...
method pruneGraph (line 420) | private static void pruneGraph(ArrayList<HashSet<Integer>> var0, HashS...
method showStatsBi (line 437) | private static void showStatsBi(String var0, ArrayList<HashSet<Integer...
method nVertices (line 506) | private static int nVertices(ArrayList<HashSet<Integer>> var0) {
method sameGroup (line 518) | private static boolean sameGroup(int var0, int var1, ArrayList<TreeSet...
method checkSaveGraph (line 528) | private static GGResult checkSaveGraph(ArrayList<HashSet<Integer>> var...
method invert (line 539) | public static ArrayList<HashSet<Integer>> invert(ArrayList<HashSet<Int...
method project (line 558) | public static ArrayList<HashSet<Integer>> project(ArrayList<HashSet<In...
method weightedProject (line 576) | public static ArrayList<HashMap<Integer, Integer>> weightedProject(Arr...
method averageDiameter (line 604) | private static GGResult averageDiameter(ArrayList<TreeSet<Integer>> va...
method diameter (line 625) | private static int diameter(TreeSet<Integer> var0, ArrayList<HashSet<I...
method maxDist (line 640) | private static int maxDist(int var0, TreeSet<Integer> var1, ArrayList<...
method saveGroups (line 672) | private static void saveGroups(ArrayList<TreeSet<Integer>> var0, int v...
method saveGraph (line 705) | private static void saveGraph(ArrayList<HashSet<Integer>> var0, int va...
method saveWGraph (line 741) | private static void saveWGraph(ArrayList<HashMap<Integer, Integer>> va...
method saveGraphCSV (line 777) | private static void saveGraphCSV(ArrayList<HashSet<Integer>> var0, int...
method randName (line 804) | private static String randName(int var0, int var1, double var2, double...
method minSize (line 814) | private static int minSize(ArrayList<TreeSet<Integer>> var0, int var1) {
method makeArrayList (line 827) | private static ArrayList<HashSet<Integer>> makeArrayList(HashMap<Integ...
method makeEdgesPA (line 847) | private static ArrayList<HashSet<Integer>> makeEdgesPA(ArrayList<TreeS...
method randInt (line 961) | private static int randInt(double var0, Random var2) {
method findInitVertex (line 970) | private static int findInitVertex(int var0, int var1, ArrayList<ArrayL...
method findVertex (line 985) | private static int findVertex(int var0, int var1, ArrayList<TreeSet<In...
method makeEdgesOld (line 1017) | private static ArrayList<HashSet<Integer>> makeEdgesOld(HashMap<Intege...
method makeEdges (line 1055) | private static ArrayList<HashSet<Integer>> makeEdges(ArrayList<TreeSet...
method makeEdgesBi (line 1059) | private static ArrayList<HashSet<Integer>> makeEdgesBi(ArrayList<TreeS...
method findVertex1 (line 1159) | private static int findVertex1(int var0, double var1, TreeSet<Integer>...
method inVertex (line 1175) | private static int inVertex(Integer[] var0, Random var1) {
method outVertex (line 1180) | private static int outVertex(int var0, TreeSet<Integer> var1, Random v...
method makeEdges (line 1189) | private static void makeEdges(int var0, HashSet<Integer> var1, ArrayLi...
method makeEdge (line 1198) | private static boolean makeEdge(double var0, int var2, int var3, Array...
method makeEdge (line 1207) | private static boolean makeEdge(int var0, int var1, ArrayList<HashSet<...
method makeEdgesPref (line 1220) | private static HashMap<Integer, HashSet<Integer>> makeEdgesPref(HashMa...
method makeEdgesFlat (line 1299) | private static boolean[][] makeEdgesFlat(HashSet<Pair> var0, int var1,...
method randIntFromDouble (line 1354) | private static int randIntFromDouble(double var0, Random var2) {
method randBoolean (line 1363) | private static boolean randBoolean(double var0, Random var2) {
method makeSameGroup (line 1367) | private static HashMap<Integer, HashSet<Integer>> makeSameGroup(int va...
method makeGroups (line 1394) | private static ArrayList<TreeSet<Integer>> makeGroups(int var0, int va...
method individualName (line 1502) | private static int individualName(int var0) {
method printBoolean (line 1506) | private static void printBoolean(boolean[][] var0, int var1) {
method componentOf (line 1521) | private static HashSet<Integer> componentOf(int var0, ArrayList<HashSe...
method printUsageAndExit (line 1543) | private static void printUsageAndExit() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/benchmark/GGResult.java
class GGResult (line 6) | class GGResult {
method GGResult (line 14) | public GGResult(int var1, double var2, double var4, double var6) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CPP.java
class CPP (line 23) | public class CPP {
method CPP (line 24) | public CPP() {
method main (line 27) | public static void main(String[] var0) {
method preprocess (line 57) | public static int preprocess(String var0, String var1, String var2) {
method process (line 69) | public static void process(String var0, String var1, String var2) {
method convert_wakita_clusters (line 118) | public static void convert_wakita_clusters(String var0, String var1, i...
method convert_cnm_clusters (line 186) | public static void convert_cnm_clusters(String var0, String var1) {
method convert_cnm (line 192) | private static void convert_cnm(String var0, String var1) {
method convert_pons_clusters (line 223) | public static void convert_pons_clusters(String var0, String var1) {
method convert_blondel_clusters (line 260) | public static boolean convert_blondel_clusters(String var0, String var...
method printUsageAndExit (line 312) | private static void printUsageAndExit() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CommPair.java
class CommPair (line 6) | public class CommPair {
method CommPair (line 11) | public CommPair(int var1, int var2, double var3) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CommPairSet.java
class CommPairSet (line 12) | public class CommPairSet {
method compare (line 15) | public int compare(CommPair var1, CommPair var2) {
method CommPairSet (line 20) | public CommPairSet(int var1) {
method add (line 27) | public boolean add(CommPair var1) {
method remove (line 33) | public void remove(int var1) {
method best (line 49) | public CommPair best() {
method toString (line 53) | public String toString() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CompleteCliques.java
class CompleteCliques (line 13) | public class CompleteCliques {
method CompleteCliques (line 16) | public CompleteCliques() {
method completeCliques (line 19) | public static ArrayList<HashSet<Integer>> completeCliques(ArrayList<Ha...
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CompleteCliques1.java
class CompleteCliques1 (line 13) | public class CompleteCliques1 {
method CompleteCliques1 (line 14) | public CompleteCliques1() {
method completeCliques1 (line 17) | public static ArrayList<HashSet<Integer>> completeCliques1(ArrayList<H...
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/RebuildCommunities.java
class RebuildCommunities (line 17) | public class RebuildCommunities {
method RebuildCommunities (line 20) | public RebuildCommunities() {
method rebuildCommunities (line 23) | public static ArrayList<HashSet<Integer>> rebuildCommunities(int var0,...
method compareCliques_mod_fast (line 102) | private static double compareCliques_mod_fast(int var0, int var1, int[...
method collect (line 106) | private static void collect(Tree var0, HashSet<Integer> var1) {
method modularity (line 118) | private static double modularity(ArrayList<HashSet<Integer>> var0, int...
method show (line 177) | public static void show(int[][] var0, ArrayList<HashSet<Integer>> var1...
method detcomp (line 190) | public static int detcomp(double var0, int var2, int var3, double var4...
method updateMod (line 194) | private static double updateMod(int var0, int var1, int[][] var2, Arra...
method compareCliques_missing (line 221) | static double compareCliques_missing(int var0, int var1, ArrayList<Has...
method compareCliques_missing2 (line 232) | static double compareCliques_missing2(int var0, int var1, ArrayList<Ha...
method compareCliques_edgeCount (line 241) | static double compareCliques_edgeCount(int var0, int var1, ArrayList<H...
method edgeCount (line 248) | static int edgeCount(HashSet<Integer> var0, HashSet<Integer> var1, Arr...
method compareCliques_mod (line 267) | static double compareCliques_mod(int var0, int var1, ArrayList<HashSet...
method getMod (line 276) | static double getMod(String var0, ArrayList<HashSet<Integer>> var1, in...
method writeCom (line 305) | static void writeCom(HashSet<Integer> var0, PrintStream var1) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/RemoveCliques.java
class RemoveCliques (line 15) | public class RemoveCliques {
method RemoveCliques (line 16) | public RemoveCliques() {
method removeCliques (line 19) | public static ArrayList<HashSet<Integer>> removeCliques(ArrayList<Hash...
method saveNewedges (line 35) | public static void saveNewedges(ArrayList<HashSet<Integer>> var0, Stri...
method saveUndirected (line 57) | public static void saveUndirected(ArrayList<HashSet<Integer>> var0) {
method printGraph (line 83) | private static void printGraph(ArrayList<HashSet<Integer>> var0) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/graph/ELEMENT.java
class ELEMENT (line 6) | public class ELEMENT {
method ELEMENT (line 10) | public ELEMENT() {
method ELEMENT (line 13) | public ELEMENT(int var1, int var2) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/metric/Modularity.java
class Modularity (line 19) | public class Modularity {
method Modularity (line 22) | public Modularity() {
method main (line 25) | public static void main(String[] var0) {
method modularity (line 33) | public static double modularity(String var0, String var1) {
method modularity (line 58) | private static double modularity(int var0, List<Integer> var1, List<Pa...
method readClusters (line 95) | private static int readClusters(List<Integer> var0, String var1, HashM...
method numVertex (line 130) | private static int numVertex(String var0, HashMap<String, Integer> var...
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/metric/Omega.java
class Omega (line 12) | public class Omega {
method Omega (line 13) | public Omega() {
method main (line 16) | public static void main(String[] var0) {
method readCount (line 29) | public static int readCount(Vector<HashMap<Integer, Integer>> var0, St...
method evaluateOmega (line 91) | public static double evaluateOmega(Vector<HashMap<Integer, Integer>> v...
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/CONGA.java
class CONGA (line 39) | public class CONGA {
method CONGA (line 64) | public CONGA() {
method main (line 67) | public static void main(String[] var0) {
method clusterGraph (line 202) | public static Stats clusterGraph(int var0, HashSet<String> var1, Strin...
method clusterGraph1 (line 212) | private static Stats clusterGraph1(int var0, String var1, int var2, Ha...
method getSplitWeight (line 318) | private static float getSplitWeight(String var0, HashMap<String, HashM...
method showOption (line 360) | private static void showOption(int var0, String var1, String var2) {
method sameCluster (line 369) | private static boolean sameCluster(String var0, String var1, HashSet<H...
method checkGraph (line 384) | private static int checkGraph(HashMap<String, HashSet<String>> var0) t...
method statsGraph (line 410) | private static void statsGraph(List<HashSet<Integer>> var0) {
method readGraphEdges (line 452) | public static HashMap<String, HashSet<String>> readGraphEdges(String v...
method addWeight (line 538) | public static void addWeight(String var0, String var1, float var2, Has...
method readGraph (line 554) | public static HashMap<String, HashSet<String>> readGraph(String var0, ...
method vertex (line 633) | private static void vertex(String var0, HashMap<String, HashSet<String...
method neighbour (line 640) | private static void neighbour(String var0, String var1, HashMap<String...
method compactGraph (line 654) | public static void compactGraph(HashMap<String, HashSet<String>> var0,...
method findClusters (line 713) | private static void findClusters(HashMap<String, HashSet<String>> var0...
method writeSplitGraph (line 744) | public static void writeSplitGraph(List<HashSet<Integer>> var0, List<H...
method sb_vs_vb (line 853) | private static float sb_vs_vb(int var0) {
method cluster (line 877) | private static void cluster(List<HashSet<Integer>> var0, List<HashMap<...
method wEdgeBetweenness (line 1056) | private static float wEdgeBetweenness(Edge var0, List<HashMap<Integer,...
method wVertexBetweenness (line 1073) | private static float wVertexBetweenness(Vertex var0, float var1) {
method updatePhase (line 1077) | private static boolean updatePhase(int var0, float var1, float var2, b...
method addNewEdges (line 1100) | private static void addNewEdges(List<HashSet<Integer>> var0, List<Hash...
method showStep (line 1165) | private static void showStep(int var0, int var1, int var2, float var3,...
method setSizes (line 1204) | private static void setSizes(int var0, Between var1, List<HashSet<Inte...
method update2Comps (line 1225) | private static boolean update2Comps(int var0, int var1, Between var2, ...
method updateComps (line 1250) | private static void updateComps(HashSet<Integer> var0, Between var1, L...
method compBetweenness (line 1261) | private static void compBetweenness(Between var0, List<HashSet<Integer...
method betweenness (line 1272) | private static void betweenness(int var0, Between var1, List<HashSet<I...
method compVertices (line 1373) | private static void compVertices(TreeSet<Integer> var0, Between var1, ...
method detLess (line 1394) | public static boolean detLess(float var0, float var1) {
method detLess (line 1398) | public static boolean detLess(float var0, float var1, int var2, int va...
method detLess (line 1402) | public static boolean detLess(float var0, float var1, int var2, int va...
method removeEdge (line 1406) | private static void removeEdge(int var0, int var1, Between var2, List<...
method splitVertex (line 1420) | private static int splitVertex(int var0, Split var1, Between var2, Lis...
method replaceWeight (line 1455) | private static void replaceWeight(int var0, int var1, int var2, List<H...
method nameVertex (line 1473) | private static String nameVertex(List<String> var0, HashSet<Integer> v...
method rootName (line 1481) | public static String rootName(String var0) {
method compVertex (line 1486) | private static void compVertex(Integer var0, Between var1, List<HashSe...
method tempMatrixCopy (line 1601) | private static float[][] tempMatrixCopy(float[][] var0, int var1) {
method componentOf (line 1616) | public static TreeSet<Integer> componentOf(int var0, List<HashSet<Inte...
method regionOf (line 1620) | private static TreeSet<Integer> regionOf(int var0, int var1, List<Hash...
method regionOf (line 1626) | private static List<Integer> regionOf(int var0, int var1, List<HashSet...
method smallRegion (line 1652) | private static boolean smallRegion(List<Integer> var0, TreeSet<Integer...
method constructShowClusters (line 1675) | private static void constructShowClusters(String var0, int var1, Strin...
method showClusters (line 1761) | private static void showClusters(List<Pair> var0, List<Pair> var1, Lis...
method vad (line 1969) | private static double vad(HashMap<Integer, HashMap<String, Double>> va...
method makeClusters (line 1989) | private static int makeClusters(int[] var0, HashMap<Integer, HashMap<S...
method incWeight (line 2015) | private static void incWeight(HashMap<String, Double> var0, String var...
method averageDiameter (line 2023) | private static GResult averageDiameter(HashMap<Integer, HashMap<String...
method diameter (line 2047) | private static int diameter(HashMap<String, Double> var0, HashMap<Stri...
method maxDist (line 2062) | private static int maxDist(String var0, HashMap<String, Double> var1, ...
method modularity (line 2094) | private static double modularity(int var0, int[] var1, List<Pair> var2) {
method rootOf (line 2131) | private static Tree rootOf(Tree var0) {
method makeTree (line 2139) | private static Tree makeTree(Tree var0, Tree var1) {
method clusterId (line 2149) | private static int clusterId(Tree var0) {
method dispTree (line 2153) | private static void dispTree(Tree var0) {
method flattenTree (line 2168) | private static HashSet<Integer> flattenTree(Tree var0) {
method flattenTree (line 2174) | private static void flattenTree(Tree var0, HashSet<Integer> var1) {
method printDegree (line 2184) | public static void printDegree(TreeSet<Integer> var0, List<HashSet<Int...
method printUsageAndExit (line 2194) | private static void printUsageAndExit() {
method cSplit (line 2219) | private static void cSplit(int var0, int var1, PrintStream var2, Clust...
method cEdge (line 2229) | private static void cEdge(int var0, int var1, PrintStream var2, Cluste...
method dOutput (line 2238) | private static void dOutput(String var0) {
method sOutputN (line 2245) | private static void sOutputN(String var0) {
method sOutput (line 2252) | private static void sOutput(String var0) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/algorithm/Between.java
class Between (line 20) | public class Between {
method compare (line 25) | public int compare(Edge var1, Edge var2) {
method compare (line 36) | public int compare(Vertex var1, Vertex var2) {
method Between (line 41) | public Between(List<HashSet<Integer>> var1, HashSet<String> var2, List...
method getPB (line 66) | public PB getPB(int var1) {
method setSize (line 70) | public void setSize(int var1) {
method bestEdge (line 83) | public Edge bestEdge() {
method bestVertex (line 87) | public Vertex bestVertex() {
method initComp (line 91) | public void initComp(TreeSet<Integer> var1, List<HashSet<Integer>> var...
method removeEdge (line 103) | public void removeEdge(int var1, int var2) {
method splitVertex (line 109) | public void splitVertex(int var1, int var2, HashSet<Integer> var3, Has...
method putEdge (line 131) | public void putEdge(int var1, int var2) {
method putVertex (line 144) | public void putVertex(int var1, float var2, Split var3) {
method putVertex (line 148) | public void putVertex(int var1, float var2, Split var3, float var4) {
method getVertex (line 159) | public Vertex getVertex(int var1) {
method wBetweenness (line 164) | private float wBetweenness(Edge var1, List<HashMap<Integer, Float>> va...
method replaceEdges (line 179) | private void replaceEdges(int var1, HashSet<Integer> var2) {
method replaceEdge (line 203) | private void replaceEdge(int var1, int var2, int var3) {
method deleteEdge (line 218) | private void deleteEdge(int var1, int var2) {
method addEdge (line 232) | private void addEdge(int var1, int var2) {
method reduceVertex (line 242) | private void reduceVertex(int var1, int var2) {
method deleteVertex (line 250) | private void deleteVertex(int var1) {
method addVertex (line 260) | private void addVertex(int var1, HashSet<Integer> var2) {
method printBetweenness (line 269) | public void printBetweenness(int var1, List<String> var2) {
method checkConsistency (line 287) | public void checkConsistency(int var1, List<HashSet<Integer>> var2) {
method getSplitBetweenness (line 384) | public ArrayList<Float> getSplitBetweenness(List<String> var1) {
method getVertexBetweenness (line 410) | public ArrayList<Float> getVertexBetweenness(TreeSet<Integer> var1, Li...
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/algorithm/CPP.java
class CPP (line 23) | public class CPP {
method CPP (line 24) | public CPP() {
method main (line 27) | public static void main(String[] var0) {
method preprocessDir (line 91) | public static void preprocessDir(String var0, String var1, String var2) {
method preprocess (line 165) | public static int preprocess(String var0, String var1, String var2, bo...
method alspac (line 181) | public static void alspac(String var0, String var1) {
method process (line 214) | public static void process(String var0, String var1, String var2) {
method convert_wakita_clusters (line 270) | public static void convert_wakita_clusters(String var0, String var1, i...
method convert_cnm_clusters (line 338) | public static void convert_cnm_clusters(String var0, String var1) {
method convert_cnm_network (line 344) | public static void convert_cnm_network(String var0, String var1) {
method convert_cnm (line 366) | private static void convert_cnm(String var0, String var1) {
method convert_pons_clusters (line 397) | public static void convert_pons_clusters(String var0, String var1) {
method convert_lfm_clusters (line 433) | public static void convert_lfm_clusters(String var0, String var1) {
method convert_fc_clusters (line 475) | public static void convert_fc_clusters(String var0, String var1) {
method convert_nmf_clusters (line 534) | public static void convert_nmf_clusters(String var0, String var1) {
method convert_eagle_clusters (line 585) | public static void convert_eagle_clusters(String var0, String var1) {
method convert_im_clusters (line 611) | public static void convert_im_clusters(String var0, String var1) {
method convert_oslom_clusters (line 669) | public static void convert_oslom_clusters(String var0, String var1) {
method convert_nmf_graph (line 690) | public static int convert_nmf_graph(String var0, String var1) {
method convert_eagle_graph (line 748) | public static void convert_eagle_graph(String var0, String var1, Strin...
method convert_im_graph (line 784) | public static void convert_im_graph(String var0, String var1) {
method convert_blondel_clusters (line 841) | public static boolean convert_blondel_clusters(String var0, String var...
method printUsageAndExit (line 893) | private static void printUsageAndExit() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/algorithm/PB.java
class PB (line 13) | public class PB {
method PB (line 21) | public PB(HashSet<Integer> var1, Vertex var2) {
method replace (line 37) | public void replace(int var1, int var2) {
method remove (line 43) | public int remove(int var1) {
method print (line 70) | public void print(String var1) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/Pair.java
class Pair (line 6) | public class Pair {
method Pair (line 10) | public Pair(int var1, int var2) {
method toString (line 15) | public String toString() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/StrPair.java
class StrPair (line 6) | public class StrPair {
method StrPair (line 10) | public StrPair(String var1, String var2) {
method toString (line 15) | public String toString() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/Tree.java
class Tree (line 6) | public class Tree {
method Tree (line 12) | public Tree(int var1) {
method Tree (line 19) | public Tree(Tree var1) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/benchmark/GResult.java
class GResult (line 6) | public class GResult {
method GResult (line 11) | public GResult(double var1, double var3, double var5) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/community/BP.java
class BP (line 6) | public class BP {
method BP (line 10) | public BP(float var1, float var2) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/community/ClusterInfo.java
class ClusterInfo (line 10) | public class ClusterInfo {
method ClusterInfo (line 16) | public ClusterInfo() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/community/Stats.java
class Stats (line 12) | public class Stats {
method Stats (line 43) | public Stats() {
method showStats (line 46) | public void showStats(String var1) throws Exception {
method splitVertex (line 59) | public void splitVertex(String var1, Split var2) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/graph/Edge.java
class Edge (line 6) | public class Edge {
method Edge (line 11) | public Edge(int var1, int var2) {
method Edge (line 17) | public Edge(int var1, int var2, float var3) {
method toString (line 23) | public String toString() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/graph/LabelledEdge.java
class LabelledEdge (line 6) | public class LabelledEdge {
method LabelledEdge (line 11) | public LabelledEdge(float var1, int var2, int var3) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/graph/Split.java
class Split (line 8) | public class Split {
method Split (line 12) | public Split(HashSet<Integer> var1, HashSet<Integer> var2) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/graph/Vertex.java
class Vertex (line 6) | public class Vertex {
method Vertex (line 12) | public Vertex(int var1) {
method Vertex (line 19) | public Vertex(int var1, float var2, Split var3, float var4) {
method toString (line 26) | public String toString() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/metric/ModOverlap.java
class ModOverlap (line 15) | public class ModOverlap {
method ModOverlap (line 18) | public ModOverlap() {
method main (line 21) | public static void main(String[] var0) {
method modOverlap (line 29) | public static double modOverlap(String var0, String var1) {
method showClusters (line 45) | private static void showClusters(HashMap<Integer, HashMap<String, Doub...
method invertClusters (line 51) | private static HashMap<String, HashMap<Integer, Double>> invertCluster...
method readClusters (line 72) | private static HashMap<Integer, HashMap<String, Double>> readClusters(...
method readGraphEdges (line 124) | public static HashMap<String, HashSet<String>> readGraphEdges(String v...
method normalize (line 178) | public static void normalize(HashMap<Integer, HashMap<String, Double>>...
method modOverlap (line 193) | public static double modOverlap(HashMap<Integer, HashMap<String, Doubl...
method beta_out (line 258) | private static double beta_out(String var0, int var1, double var2, Has...
method beta_in (line 278) | private static double beta_in(String var0, int var1, double var2, Hash...
method F (line 298) | private static double F(String var0, String var1, int var2, HashMap<In...
method f (line 305) | private static double f(double var0) {
method alpha (line 309) | private static double alpha(String var0, int var1, HashMap<Integer, Ha...
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/copra/Project.java
class Project (line 18) | public class Project {
method Project (line 19) | public Project() {
method main (line 22) | public static void main(String[] var0) {
method project (line 71) | private static List<HashSet<Integer>> project(List<HashSet<Integer>> v...
method weightedProject (line 89) | private static List<HashMap<Integer, Float>> weightedProject(List<Hash...
method writeGraphEdges (line 117) | private static void writeGraphEdges(String var0, List<HashSet<Integer>...
method writeWeightedEdges (line 139) | private static void writeWeightedEdges(String var0, List<HashMap<Integ...
method printUsageAndExit (line 163) | private static void printUsageAndExit() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/copra/algorithm/COPRA.java
class COPRA (line 30) | public class COPRA {
method COPRA (line 39) | public COPRA() {
method main (line 42) | public static void main(String[] var0) {
method showOptions (line 219) | private static void showOptions(int var0, int var1, int var2, boolean ...
method clusterGraph (line 305) | public static VecPair clusterGraph(int var0, String var1, String var2,...
method clusterGraph (line 314) | public static VecPair clusterGraph(int var0, String var1, String var2,...
method clusterGraph1 (line 337) | private static VecPair clusterGraph1(int var0, String var1, List<HashS...
method nEdges (line 515) | private static int nEdges(List<HashSet<Integer>> var0) {
method stdDev (line 525) | private static double stdDev(double var0, int var2, double var3) {
method minSummary (line 537) | private static Map<Integer, Float> minSummary(Map<Integer, Float> var0...
method clusteringSummary1 (line 553) | private static Map<Integer, Float> clusteringSummary1(List<ClusterLabe...
method clusteringSummary2 (line 572) | private static Map<Integer, Float> clusteringSummary2(List<ClusterLabe...
method propagate (line 593) | public static void propagate(String var0, int var1, String var2, Strin...
method propagateClusters (line 606) | private static List<ClusterLabel> propagateClusters(List<ClusterLabel>...
method reportRes (line 629) | private static void reportRes(Vector<Double> var0, Vector<String> var1...
method sumRes (line 640) | private static Vector<Double> sumRes(Vector<Double> var0, Vector<Doubl...
method report (line 656) | private static void report(double var0, double var2, double var4, doub...
method readBiGraphEdges (line 673) | public static void readBiGraphEdges(String var0, List<HashSet<Integer>...
method copyFile (line 679) | private static void copyFile(String var0, String var1) {
method readBiGraphEdges (line 700) | private static int readBiGraphEdges(String var0, List<HashSet<Integer>...
method nameInt (line 768) | private static int nameInt(String var0, List<String> var1, Map<String,...
method outputClusters (line 784) | private static Vector<Double> outputClusters(List<ClusterLabel> var0, ...
method totSize (line 852) | private static int totSize(List<TreeSet<Integer>> var0) {
method filterClusters (line 862) | private static List<TreeSet<Integer>> filterClusters(List<TreeSet<Inte...
method combineGraphs (line 891) | private static List<HashSet<Integer>> combineGraphs(List<HashSet<Integ...
method combineClusters (line 916) | private static void combineClusters(List<TreeSet<Integer>> var0, List<...
method addSingletons (line 923) | private static void addSingletons(List<TreeSet<Integer>> var0, HashSet...
method flatten (line 938) | private static HashSet<Integer> flatten(List<TreeSet<Integer>> var0) {
method writeClusters (line 948) | private static void writeClusters(List<TreeSet<Integer>> var0, String ...
method convertClusters (line 965) | private static List<TreeSet<Integer>> convertClusters(List<ClusterLabe...
method removeEmpty (line 992) | private static List<TreeSet<Integer>> removeEmpty(List<TreeSet<Integer...
method simpleSimplifyClusters (line 1005) | private static void simpleSimplifyClusters(List<TreeSet<Integer>> var0...
method deletable (line 1016) | private static boolean deletable(int var0, List<TreeSet<Integer>> var1) {
method simplifyClusters (line 1032) | private static void simplifyClusters(List<TreeSet<Integer>> var0) {
method contiguous (line 1066) | private static List<TreeSet<Integer>> contiguous(List<TreeSet<Integer>...
method contiguous (line 1082) | private static TreeSet<Integer> contiguous(int var0, TreeSet<Integer> ...
method writeBiClusters (line 1100) | private static void writeBiClusters(List<TreeSet<Integer>> var0, Strin...
method writeClusters (line 1135) | private static void writeClusters(List<TreeSet<Integer>> var0, PrintSt...
method writeCluster (line 1147) | private static void writeCluster(TreeSet<Integer> var0, PrintStream va...
method simpleClustering (line 1171) | private static List<ClusterLabel> simpleClustering(int var0, float var...
method printUsageAndExit (line 1182) | private static void printUsageAndExit() {
method readClusters (line 1198) | private static List<ClusterLabel> readClusters(String var0, int var1, ...
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/LabelPair.java
class LabelPair (line 6) | public class LabelPair {
method LabelPair (line 10) | public LabelPair(float var1, int var2) {
method toString (line 15) | public String toString() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/SetPair.java
class SetPair (line 8) | public class SetPair implements Comparable<SetPair> {
method SetPair (line 12) | public SetPair(int var1, TreeSet<Integer> var2) {
method compareTo (line 17) | public int compareTo(SetPair var1) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/VecPair.java
class VecPair (line 8) | public class VecPair {
method VecPair (line 12) | public VecPair(Vector<String> var1, Vector<Double> var2) {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/Vert.java
class Vert (line 6) | public class Vert implements Comparable<Vert> {
method Vert (line 10) | public Vert(int var1, int var2) {
method compareTo (line 15) | @Override
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/community/ClusterLabel.java
class ClusterLabel (line 14) | public class ClusterLabel {
method ClusterLabel (line 20) | public ClusterLabel(int var1, float var2) {
method ClusterLabel (line 24) | public ClusterLabel(int var1, float var2, int var3, boolean var4) {
method initialize (line 33) | private void initialize(int var1, float var2) {
method getLabel (line 45) | public Map<Integer, Float> getLabel() {
method getWeight (line 49) | public float getWeight() {
method labelSet (line 53) | public TreeSet<Integer> labelSet() {
method labelMap (line 57) | public Map<Integer, Float> labelMap() {
method add (line 61) | public void add(int var1) {
method sameAs (line 71) | public boolean sameAs(ClusterLabel var1) {
method neighbour (line 100) | public void neighbour(ClusterLabel var1, float var2) {
method noMore (line 119) | public void noMore() {
method reduce (line 124) | private void reduce() {
method normalize (line 174) | public void normalize() {
method toString (line 188) | public String toString() {
FILE: Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/metric/ModOverlap.java
class ModOverlap (line 15) | public class ModOverlap {
method ModOverlap (line 18) | public ModOverlap() {
method main (line 21) | public static void main(String[] var0) {
method modOverlap (line 29) | public static double modOverlap(String var0, String var1) {
method showClusters (line 45) | private static void showClusters(HashMap<Integer, HashMap<String, Doub...
method invertClusters (line 51) | private static HashMap<String, HashMap<Integer, Double>> invertCluster...
method readClusters (line 72) | private static HashMap<Integer, HashMap<String, Double>> readClusters(...
method readGraphEdges (line 124) | public static HashMap<String, HashSet<String>> readGraphEdges(String v...
method normalize (line 178) | public static void normalize(HashMap<Integer, HashMap<String, Double>>...
method modOverlap (line 193) | public static double modOverlap(HashMap<Integer, HashMap<String, Doubl...
method beta_out (line 258) | private static double beta_out(String var0, int var1, double var2, Has...
method beta_in (line 278) | private static double beta_in(String var0, int var1, double var2, Hash...
method F (line 298) | private static double F(String var0, String var1, int var2, HashMap<In...
method f (line 305) | private static double f(double var0) {
method alpha (line 309) | private static double alpha(String var0, int var1, HashMap<Integer, Ha...
FILE: Algorithms/2010-LinkCommunity/cpp/calcAndWrite_Jaccards.cpp
function intersection_size (line 56) | int intersection_size( const set<int> &A, const set<int> &B ) {
function main (line 76) | int main (int argc, char const *argv[]){
FILE: Algorithms/2010-LinkCommunity/cpp/clusterJaccsFile.cpp
function main (line 65) | int main (int argc, char const *argv[]){
FILE: Algorithms/2010-LinkCommunity/cpp/edgelist2pairs.py
function getDelimiter (line 46) | def getDelimiter(infile, expectedLength=2):
FILE: Algorithms/2010-LinkCommunity/cpp/partition_density.py
function load_cluster_stats (line 29) | def load_cluster_stats(filename):
function partition_density (line 33) | def partition_density(list_mc_nc):
function partition_density_from_file (line 42) | def partition_density_from_file(filename):
FILE: Algorithms/2010-LinkCommunity/python/link_clustering.py
function swap (line 42) | def swap(a, b):
function Dc (line 48) | def Dc(m, n):
class HLC (line 56) | class HLC:
method __init__ (line 57) | def __init__(self, adj, edges):
method initialize_edges (line 70) | def initialize_edges(self):
method merge_comms (line 79) | def merge_comms(self, edge1, edge2, S, dendro_flag=False):
method single_linkage (line 117) | def single_linkage(self, threshold=None, w=None, dendro_flag=False):
function similarities_unweighted (line 156) | def similarities_unweighted(adj):
function similarities_weighted (line 173) | def similarities_weighted(adj, ij2wij):
function read_edgelist_unweighted (line 202) | def read_edgelist_unweighted(filename, delimiter=None, nodetype=str):
function read_edgelist_weighted (line 218) | def read_edgelist_weighted(filename, delimiter=None, nodetype=str, weigh...
function write_edge2cid (line 238) | def write_edge2cid(e2c, filename, delimiter="\t"):
function write_dendro (line 271) | def write_dendro(filename, orig_cid2edge, linkage):
class MyParser (line 283) | class MyParser(OptionParser):
method format_epilog (line 284) | def format_epilog(self, formatter):
FILE: Algorithms/2010-LinkCommunity/python_yche_refactor/graph_io_helper.py
function get_sorted_edge (line 9) | def get_sorted_edge(a, b):
function read_edge_list_unweighted (line 13) | def read_edge_list_unweighted(filename, node_type=str):
function read_edge_list_weighted (line 32) | def read_edge_list_weighted(filename, node_type=str, weight_type=float):
function write_edge2cid (line 48) | def write_edge2cid(e2c, filename, delimiter="\t"):
function write_dendro (line 74) | def write_dendro(filename, orig_cid2edge, linkage):
FILE: Algorithms/2010-LinkCommunity/python_yche_refactor/link_clustering.py
class MyParser (line 10) | class MyParser(OptionParser):
method format_epilog (line 11) | def format_epilog(self, formatter):
FILE: Algorithms/2010-LinkCommunity/python_yche_refactor/link_clustering_algo.py
class HLC (line 10) | class HLC:
method get_sorted_pair (line 12) | def get_sorted_pair(a, b):
method sort_edge_pairs_by_similarity (line 16) | def sort_edge_pairs_by_similarity(adj_list_dict):
method sort_edge_pairs_by_similarity_weighted (line 31) | def sort_edge_pairs_by_similarity_weighted(adj_list_dict, edge_weight_...
method __init__ (line 57) | def __init__(self, adj_list_dict, edges):
method single_linkage (line 85) | def single_linkage(self, threshold=None, w=None, dendro_flag=False):
FILE: Algorithms/2010-TopGC/src_original/Graphs/original/mkidx.c
type list (line 7) | struct list {
type list (line 13) | struct list
type list (line 14) | struct list
type list (line 21) | struct list
function add (line 72) | void
function dowrite (line 92) | void dowrite() {
function outInt (line 106) | void outInt(long data) {
FILE: Algorithms/2010-TopGC/src_original/mkidx.c
type list (line 7) | struct list
type list (line 14) | struct list
type list (line 15) | struct list
type list (line 22) | struct list
function add (line 91) | void
function dowrite (line 114) | void
function outInt (line 130) | void
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/FindMostProm.java
class FindMostProm (line 16) | public class FindMostProm implements Runnable {
method FindMostProm (line 50) | public FindMostProm(int start, int end, int threadNum, String graphFil...
method run (line 76) | public void run() {
method getScore2 (line 163) | public double getScore2(int currentNode, ArrayList<TempDouble2> neighb...
method makeAndStoreWords (line 344) | public void makeAndStoreWords(int topN, ArrayList<TempDouble2> neighbo...
method convertToList (line 441) | public LinkedList<TempDouble2> convertToList(Hashtable<Integer, Double...
method getNumNeighborsCutoffs (line 464) | public HashSet<Integer> getNumNeighborsCutoffs(ArrayList<TempDouble2> ...
method findIndex (line 486) | public int findIndex(double guess, TempDouble2[] neighbors) {
method setLSH (line 503) | public void setLSH() {
method setLSH2 (line 528) | public void setLSH2() {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/HoldBucket.java
class HoldBucket (line 9) | public class HoldBucket implements Comparable<HoldBucket> {
method HoldBucket (line 13) | public HoldBucket(double score, Hashtable<Integer, Integer> bin) {
method compareTo (line 18) | public int compareTo(HoldBucket other) {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/HoldInt.java
class HoldInt (line 6) | public class HoldInt {
method HoldInt (line 9) | public HoldInt(int[] m) {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/IntAndDouble.java
class IntAndDouble (line 6) | public class IntAndDouble implements Comparable<IntAndDouble> {
method IntAndDouble (line 10) | public IntAndDouble(int i, double d) {
method compareTo (line 15) | public int compareTo(IntAndDouble other) {
method toString (line 19) | public String toString() {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/LSH.java
class LSH (line 14) | public class LSH {
method LSH (line 34) | public LSH(HashSet<Integer> bestNodes, String graphFileName, int m2, i...
method setLSH (line 126) | public void setLSH() {
method setLSH2 (line 151) | public void setLSH2() {
method findLessBins (line 175) | public int findLessBins(double mult, int numToFind) {
method findBins3 (line 245) | public int findBins3(double mult) {
method findBins2 (line 307) | public int findBins2(double mult) {
method findBins (line 367) | public int findBins(double mult) {
method getCutoff (line 427) | public double getCutoff(double mult, double averageNumNeighbors) {
method clearMem (line 436) | public void clearMem() {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/LSHThread.java
class LSHThread (line 14) | public class LSHThread implements Runnable {
method LSHThread (line 39) | public LSHThread(int start2, int cutKey, String graphFileName, int tri...
method run (line 66) | public void run() {
method getNeighbors (line 113) | public LinkedList<TempDouble2> getNeighbors(Look3 look, int currentNod...
method getNumNeighborsCutoffs (line 148) | public HashSet<Integer> getNumNeighborsCutoffs(LinkedList<TempDouble2>...
method findIndex (line 170) | public int findIndex(double guess, TempDouble2[] neighbors) {
method makeAndStoreWords (line 197) | public void makeAndStoreWords(int topN, LinkedList<TempDouble2> neighb...
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/LSH_Cluster.java
class LSH_Cluster (line 11) | public class LSH_Cluster implements Comparable<LSH_Cluster> {
method LSH_Cluster (line 18) | public LSH_Cluster(String l, Hashtable<Integer, Integer> n, Hashtable<...
method LSH_Cluster (line 31) | public LSH_Cluster(String l, HashSet<Integer> n, Hashtable<Integer, Ha...
method LSH_Cluster (line 44) | public LSH_Cluster(String l, HashSet<String> n, Hashtable<String, Hash...
method compareTo (line 57) | public int compareTo(LSH_Cluster other) {
method size (line 61) | public int size() {
method getScore (line 65) | double getScore(Hashtable<Integer, Hashtable<Integer, Double>> smallGr...
method getScore2 (line 94) | double getScore2(Hashtable<String, Hashtable<String, Double>> smallGra...
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/Look3.java
class Look3 (line 10) | public class Look3 {
method Look3 (line 24) | public Look3(String filename) throws Exception {
method setCache (line 32) | public void setCache(int size) {
method look (line 43) | public int[] look(int node) throws Exception {
method getNEdges (line 86) | public int getNEdges() {
method getNNodes (line 90) | public int getNNodes() {
method hasWeights (line 94) | public boolean hasWeights() {
method cacheLook (line 98) | private int[] cacheLook(int key) {
method addCache (line 109) | public void addCache(int key, int[] entry) {
method printCacheStats (line 120) | public static void printCacheStats() {
method main (line 125) | public static void main(String[] args) {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/MaxHeap.java
class MaxHeap (line 8) | public class MaxHeap {
method main (line 13) | public static void main(String[] args) {
method MaxHeap (line 25) | public MaxHeap() {
method MaxHeap (line 29) | public MaxHeap(int max) {
method leftchild (line 36) | private int leftchild(int pos) {
method rightchild (line 40) | private int rightchild(int pos) {
method parent (line 44) | private int parent(int pos) {
method isleaf (line 48) | private boolean isleaf(int pos) {
method swap (line 52) | private void swap(int pos1, int pos2) {
method insert (line 58) | public void insert(HoldBucket elem) {
method doubleSize (line 72) | public void doubleSize() {
method print (line 83) | public void print() {
method peek (line 91) | public HoldBucket peek() {
method removeMin (line 95) | public HoldBucket removeMin() {
method pushdown (line 105) | private void pushdown(int position) {
method size (line 122) | public int size() {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/MinHeap.java
class MinHeap (line 6) | public class MinHeap {
method main (line 11) | public static void main(String[] args) {
method MinHeap (line 29) | public MinHeap() {
method MinHeap (line 33) | public MinHeap(int max) {
method leftchild (line 40) | private int leftchild(int pos) {
method rightchild (line 44) | private int rightchild(int pos) {
method parent (line 48) | private int parent(int pos) {
method isleaf (line 52) | private boolean isleaf(int pos) {
method swap (line 56) | private void swap(int pos1, int pos2) {
method insert (line 62) | public void insert(IntAndDouble elem) {
method doubleSize (line 76) | public void doubleSize() {
method print (line 87) | public void print() {
method peek (line 95) | public IntAndDouble peek() {
method removeMin (line 99) | public IntAndDouble removeMin() {
method pushdown (line 109) | private void pushdown(int position) {
method size (line 126) | public int size() {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/Prime.java
class Prime (line 6) | public class Prime {
method Prime (line 7) | public Prime() {
method isPrime (line 10) | boolean isPrime(int n) {
method getPrime (line 28) | int getPrime(int n) {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/TempDouble2.java
class TempDouble2 (line 6) | class TempDouble2 implements Comparable<TempDouble2> {
method TempDouble2 (line 11) | public TempDouble2(int n, double w) {
method compareTo (line 16) | public int compareTo(TempDouble2 other) {
FILE: Algorithms/2010-TopGC/src_refactor/src/main/java/TopGC.java
class TopGC (line 20) | public class TopGC {
method main (line 45) | public static void main(String[] argv) throws FileNotFoundException, I...
method TopGC (line 49) | public TopGC(String[] argv) {
method setDefaultArgs (line 329) | public void setDefaultArgs() {
method overlapCluster (line 368) | public boolean overlapCluster(LSH_Cluster cluster, LinkedList<HashSet<...
method getScore (line 397) | public double getScore(int currentNode, Hashtable<Integer, Double> nei...
method checkArgsFirst (line 425) | public void checkArgsFirst(String[] argv) {
method checkArgs (line 478) | public void checkArgs(String[] argv) {
method makeLine (line 575) | public String makeLine(Hashtable<Integer, Integer> cluster) {
method makeLine (line 594) | public String makeLine(HashSet<Integer> cluster) {
method removeDupes (line 613) | public ArrayList<Hashtable<Integer, Integer>> removeDupes(ArrayList<Ha...
method intersect (line 776) | public int intersect(HashSet<Integer> compare1, HashSet<Integer> compa...
method overlapTooMuch (line 789) | public boolean overlapTooMuch(HashSet<Integer> compare1, HashSet<Integ...
method convertClust (line 811) | public Hashtable<Integer, Integer> convertClust(HashSet<Integer> nodes...
method shouldCombine (line 835) | public boolean shouldCombine(double overlapRemove, TopGC.TempCluster b...
method removeOverlap (line 887) | public boolean removeOverlap(double overlapRemove, ArrayList<Hashtable...
method combineBuckets (line 946) | public void combineBuckets(Hashtable<Integer, Integer> bucket1, Hashta...
method split (line 961) | public String[] split(String str, char delim) {
class IterateSet (line 981) | private class IterateSet {
method IterateSet (line 986) | public IterateSet(LinkedList<Integer> var1) {
method almostDone (line 995) | public boolean almostDone() {
method hasNext (line 1007) | public boolean hasNext() {
method next (line 1011) | public HashSet<Integer> next() {
method incr (line 1024) | public void incr() {
class TempCluster (line 1042) | private class TempCluster {
method TempCluster (line 1054) | private TempCluster(HashSet<Integer> var1, HashSet<Integer> nodes) {
method TempCluster (line 1060) | private TempCluster(TopGC.TempCluster clust1, TopGC.TempCluster clus...
FILE: Algorithms/2010-iLCD/src/src/main/java/CorePackage/Main.java
class Main (line 29) | public class Main {
method main (line 93) | public static void main(String args[]) {
method argumentsHandling (line 132) | private void argumentsHandling(String args[]) {
FILE: Algorithms/2010-iLCD/src/src/main/java/Inputs/InputCTNFhandler.java
class InputCTNFhandler (line 16) | public class InputCTNFhandler extends InputHandlerInterface{
method InputCTNFhandler (line 18) | public InputCTNFhandler(Network net) {
method operationFromLine (line 25) | public Operation operationFromLine(String line){
FILE: Algorithms/2010-iLCD/src/src/main/java/Inputs/InputHandlerInterface.java
class InputHandlerInterface (line 6) | public abstract class InputHandlerInterface {
method InputHandlerInterface (line 9) | InputHandlerInterface(Network net){
method operationFromLine (line 12) | public abstract Operation operationFromLine(String line);
FILE: Algorithms/2010-iLCD/src/src/main/java/Inputs/InputNCOLhandler.java
class InputNCOLhandler (line 10) | public class InputNCOLhandler extends InputHandlerInterface{
method InputNCOLhandler (line 12) | public InputNCOLhandler(Network net) {
method operationFromLine (line 19) | public Operation operationFromLine(String line){
FILE: Algorithms/2010-iLCD/src/src/main/java/Inputs/InputOLDLNDhandler.java
class InputOLDLNDhandler (line 17) | public class InputOLDLNDhandler extends InputHandlerInterface{
method InputOLDLNDhandler (line 19) | public InputOLDLNDhandler(Network net) {
method operationFromLine (line 26) | public Operation operationFromLine(String line){
FILE: Algorithms/2010-iLCD/src/src/main/java/Outputs/OutputCTNF.java
class OutputCTNF (line 31) | public class OutputCTNF implements OutputHandlerInterface{
method OutputCTNF (line 41) | public OutputCTNF(MyDateManager dateManager, Network theNetwork) {
method initialise (line 46) | public void initialise(String outputFile){
method terminate (line 56) | public void terminate(){
method printLine (line 60) | public void printLine(String line){
method handleGrowth (line 71) | public void handleGrowth(Node n, Community c){
method handleGrowth (line 75) | public void handleGrowth(Community initialCommunity, Community resulti...
method handleBirth (line 84) | public void handleBirth(Community c) {
method handleDeath (line 90) | public void handleDeath(Community c) {
method handleContraction (line 106) | public void handleContraction(Node n, Community c) {
method handleNewEdge (line 110) | public void handleNewEdge(Node n, Node n2) {
method handleRemoveEdge (line 114) | public void handleRemoveEdge(Node n, Node n2) {
method handleFusion (line 118) | public void handleFusion(Community resultingCommunity, Community suppr...
method handleDateChange (line 123) | public void handleDateChange(String date) {
FILE: Algorithms/2010-iLCD/src/src/main/java/Outputs/OutputHandlerInterface.java
type OutputHandlerInterface (line 15) | public interface OutputHandlerInterface {
method initialise (line 20) | public void initialise(String outputFile);
method terminate (line 23) | public void terminate();
method handleGrowth (line 28) | public void handleGrowth(Node n, Community c);
method handleGrowth (line 30) | public void handleGrowth(Community initialCommunity, Community resulti...
method handleBirth (line 32) | public void handleBirth(Community c);
method handleDeath (line 34) | public void handleDeath(Community c);
method handleContraction (line 38) | public void handleContraction(Node n, Community c);
method handleNewEdge (line 40) | public void handleNewEdge(Node n, Node n2);
method handleRemoveEdge (line 42) | public void handleRemoveEdge(Node n, Node n2);
method handleFusion (line 44) | public void handleFusion(Community resultingCommunity, Community suppr...
method handleDateChange (line 45) | public void handleDateChange(String date);
FILE: Algorithms/2010-iLCD/src/src/main/java/Outputs/OutputMultipleHandler.java
class OutputMultipleHandler (line 18) | public class OutputMultipleHandler implements OutputHandlerInterface{
method OutputMultipleHandler (line 29) | public OutputMultipleHandler() {
method addOutputHandler (line 32) | public void addOutputHandler(OutputHandlerInterface oh){
method initialise (line 35) | public void initialise(String outputFile){
method terminate (line 41) | public void terminate(){
method handleGrowth (line 47) | public void handleGrowth(Node n, Community c){
method handleGrowth (line 53) | public void handleGrowth(Community initialCommunity, Community resulti...
method handleBirth (line 60) | public void handleBirth(Community c) {
method handleDeath (line 68) | public void handleDeath(Community c) {
method handleContraction (line 81) | public void handleContraction(Node n, Community c) {
method handleNewEdge (line 86) | public void handleNewEdge(Node n, Node n2) {
method handleRemoveEdge (line 91) | public void handleRemoveEdge(Node n, Node n2) {
method handleFusion (line 96) | public void handleFusion(Community resultingCommunity, Community suppr...
method handleDateChange (line 102) | public void handleDateChange(String date) {
FILE: Algorithms/2010-iLCD/src/src/main/java/Outputs/OutputStatic.java
class OutputStatic (line 26) | public class OutputStatic implements OutputHandlerInterface{
method OutputStatic (line 37) | public OutputStatic(MyDateManager dateManager, Network theNetwork) {
method initialise (line 41) | public void initialise(String outputFile){
method terminate (line 51) | public void terminate(){
method printLine (line 70) | public void printLine(String line){
method handleGrowth (line 78) | public void handleGrowth(Node n, Community c){
method handleGrowth (line 82) | public void handleGrowth(Community initialCommunity, Community resulti...
method handleBirth (line 86) | public void handleBirth(Community c) {
method handleDeath (line 92) | public void handleDeath(Community c) {
method handleContraction (line 105) | public void handleContraction(Node n, Community c) {
method handleNewEdge (line 109) | public void handleNewEdge(Node n, Node n2) {
method handleRemoveEdge (line 113) | public void handleRemoveEdge(Node n, Node n2) {
method handleFusion (line 117) | public void handleFusion(Community resultingCommunity, Community suppr...
method handleDateChange (line 121) | public void handleDateChange(String date) {
FILE: Algorithms/2010-iLCD/src/src/main/java/Outputs/OutputSummary.java
class OutputSummary (line 27) | public class OutputSummary implements OutputHandlerInterface{
method OutputSummary (line 42) | public OutputSummary(MyDateManager dateManager, Network theNetwork) {
method initialise (line 47) | public void initialise(String outputFile){
method terminate (line 57) | public void terminate(){
method printACommunity (line 78) | private void printACommunity(CommunityToPrint ctp){
method printLine (line 93) | public void printLine(String line){
method handleGrowth (line 104) | public void handleGrowth(Node n, Community c){
method handleGrowth (line 111) | public void handleGrowth(Community initialCommunity, Community resulti...
method handleBirth (line 120) | public void handleBirth(Community c) {
method handleDeath (line 135) | public void handleDeath(Community c) {
method handleContraction (line 158) | public void handleContraction(Node n, Community c) {
method handleNewEdge (line 162) | public void handleNewEdge(Node n, Node n2) {
method handleRemoveEdge (line 166) | public void handleRemoveEdge(Node n, Node n2) {
method handleFusion (line 170) | public void handleFusion(Community resultingCommunity, Community suppr...
method handleDateChange (line 177) | public void handleDateChange(String date) {
class CommunityToPrint (line 182) | private class CommunityToPrint implements Comparable<CommunityToPrint>{
method compareTo (line 188) | @Override
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Community.java
class Community (line 12) | public class Community implements Comparable<Community>{
method Community (line 22) | public Community(Community c) {
method Community (line 26) | public Community(){
method Community (line 31) | public Community(int ID){
method addNode (line 35) | private void addNode(Node node1) {
method addNodeToCommunity (line 46) | public void addNodeToCommunity(Node n){
method removeNodeFromCommunity (line 52) | protected void removeNodeFromCommunity(Node n){
method removeNode (line 58) | protected void removeNode(Node n) {
method getID (line 67) | public int getID() {
method isDifferent (line 72) | public boolean isDifferent(Community otherCom) {
method setBirthDate (line 92) | protected void setBirthDate(MyDate date){
method getComponents (line 97) | public THashSet<Node> getComponents() {
method youngerThan (line 101) | public boolean youngerThan(Community c2) {
method compareTo (line 105) | @Override
method getCommonNodes (line 110) | public THashSet<Node> getCommonNodes(Community cTested) {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/CoreProcessor.java
class CoreProcessor (line 19) | public class CoreProcessor {
method CoreProcessor (line 28) | public CoreProcessor(Network mainNetwork) {
method setOperationHandler (line 32) | public void setOperationHandler(OperationsHandler opHandler){
method setInputHandler (line 36) | public void setInputHandler(InputHandlerInterface inputHandler){
method initializeReading (line 40) | public void initializeReading(String file){
method readALine (line 50) | public void readALine(String line){
method readOperationStream (line 59) | public void readOperationStream(String file){
method getOperation (line 80) | public Operation getOperation(String line){
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Interface.java
class Interface (line 13) | public class Interface {
type PossibleOutputFormat (line 25) | public static enum PossibleOutputFormat{CTNF,SUMMARY,STATIC}
type PossibleInputFormat (line 26) | public enum PossibleInputFormat {UNKNOWN, NCOL, TNF, CTNF, LND}
method Interface (line 29) | public Interface(String inputFile, String inputDateF){
method addOutput (line 61) | public void addOutput(PossibleOutputFormat format, String outputFile, ...
method setOperationHandler (line 86) | public void setOperationHandler(OperationsHandler operationHandler){
method readOperationStream (line 94) | public void readOperationStream() {
method processALine (line 103) | public String processALine(String line) {
method terminate (line 113) | public void terminate() {
method getFileType (line 118) | public static PossibleInputFormat getFileType(String file){
method getCurrentDate (line 138) | public String getCurrentDate(){
method getInputFileType (line 142) | public PossibleInputFormat getInputFileType(){
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/MyDate.java
class MyDate (line 3) | public class MyDate implements Comparable{
type dateType (line 5) | public enum dateType {YYYYMMDD,YYYYMMDDHHMMSS,NONE}
method MyDate (line 11) | public MyDate(String date, dateType type){
method MyDate (line 24) | public MyDate(MyDate currentTime) {
method writeDate (line 29) | public String writeDate(dateType type){
method before (line 42) | public boolean before(MyDate toCompare){
method after (line 46) | public boolean after(MyDate toCompare){
method sameDateAs (line 50) | public boolean sameDateAs(MyDate toCompare){
method beginningOfTheUniverse (line 55) | public static MyDate beginningOfTheUniverse(){
method increment (line 60) | public MyDate increment() {
method compareTo (line 70) | @Override
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/MyDateManager.java
class MyDateManager (line 5) | public class MyDateManager {
method MyDateManager (line 12) | public MyDateManager(String inputFormat){
method setOutputDateFormat (line 17) | public void setOutputDateFormat(String outputFormat){
method getDate (line 22) | public MyDate getDate(String date){
method writeDate (line 34) | public String writeDate(MyDate aDate){
method convertDateFormat (line 38) | private MyDate.dateType convertDateFormat(String stringFormat){
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Network.java
class Network (line 17) | public class Network {
method Network (line 26) | public Network(MyDateManager dateManager, OutputHandlerInterface outpu...
method getNode (line 32) | public Node getNode(String nodeName) {
method doOperation (line 43) | public void doOperation(Operation currentOperation) {
method changeTime (line 91) | public void changeTime(MyDate newDate) {
method getCurrentTime (line 100) | public MyDate getCurrentTime() {
method createCommunity (line 105) | public void createCommunity(Integer c) {
method getCommunity (line 114) | public Community getCommunity(Integer com) {
method removeCommunity (line 122) | public void removeCommunity(Community c) {
method addCommunity (line 131) | public void addCommunity(Community c) {
method getCommunities (line 139) | public THashSet<Community> getCommunities() {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Node.java
class Node (line 10) | public class Node {
method Node (line 18) | public Node(String nodeName) {
method getCommunities (line 22) | public THashSet<Community> getCommunities(){
method addCommunity (line 26) | protected void addCommunity(Community c) {
method getName (line 35) | public String getName() {
method removeCommunity (line 39) | protected void removeCommunity(Community c) {
method getNeighbors (line 47) | public THashSet<Node> getNeighbors() {
method getNeighborsInCommunity (line 51) | public THashSet<Node> getNeighborsInCommunity(Community c){
method addNeighbor (line 58) | protected void addNeighbor(Node node2) {
method removeNeighbor (line 68) | protected void removeNeighbor(Node node2) {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Operations/AddEdgeOperation.java
class AddEdgeOperation (line 6) | public class AddEdgeOperation extends Operation{
method AddEdgeOperation (line 8) | public AddEdgeOperation(Node n1, Node n2) {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Operations/BirthCommunityOperation.java
class BirthCommunityOperation (line 9) | public class BirthCommunityOperation extends Operation{
method BirthCommunityOperation (line 13) | public BirthCommunityOperation(Community c) {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Operations/ContractCommunityOperation.java
class ContractCommunityOperation (line 7) | public class ContractCommunityOperation extends Operation{
method ContractCommunityOperation (line 9) | public ContractCommunityOperation(Community c, Node n) {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Operations/DeathCommunityOperation.java
class DeathCommunityOperation (line 6) | public class DeathCommunityOperation extends Operation{
method DeathCommunityOperation (line 8) | public DeathCommunityOperation(Community c) {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Operations/FusionCommunityOperation.java
class FusionCommunityOperation (line 6) | public class FusionCommunityOperation extends Operation{
method FusionCommunityOperation (line 8) | public FusionCommunityOperation(Community absorb, Community mergedIn) {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Operations/GrowthCommunityOperation.java
class GrowthCommunityOperation (line 7) | public class GrowthCommunityOperation extends Operation{
method GrowthCommunityOperation (line 9) | public GrowthCommunityOperation(Community c, Node n) {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Operations/Operation.java
class Operation (line 8) | public class Operation {
type OperationType (line 26) | public enum OperationType { ADD, REMOVE,BIRTH,DEATH,FUSION,GROWTH,CONT...
method Operation (line 29) | public Operation(Node n1, Node n2, Community c1, Community c2, Communi...
method getNode1 (line 37) | public Node getNode1(){
method getNode2 (line 41) | public Node getNode2(){
method getCommunity1 (line 45) | public Community getCommunity1(){
method getCommunity2 (line 49) | public Community getCommunity2(){
method getCommunity3 (line 53) | public Community getCommunity3(){
method getNodes (line 57) | public HashSet<Node> getNodes(){
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/Operations/RemoveEdgeOperation.java
class RemoveEdgeOperation (line 6) | public class RemoveEdgeOperation extends Operation{
method RemoveEdgeOperation (line 8) | public RemoveEdgeOperation(Node n1, Node n2) {
FILE: Algorithms/2010-iLCD/src/src/main/java/TemporalNetworkManipulation/OperationsHandler.java
type OperationsHandler (line 5) | public interface OperationsHandler {
method handle (line 7) | public void handle(Operation currentOperation);
FILE: Algorithms/2010-iLCD/src/src/main/java/communityDetectionPackage/ILCDMetaAlgorithm.java
class ILCDMetaAlgorithm (line 44) | public class ILCDMetaAlgorithm implements OperationsHandler {
method ILCDMetaAlgorithm (line 56) | public ILCDMetaAlgorithm(Implementation implementationToUse, Network n...
method handle (line 61) | public void handle(Operation currentOperation) {
method addNodeToCommunity (line 248) | public void addNodeToCommunity(Node node, Community c) {
method fusion (line 256) | private void fusion(Community resultingCommunity, Community c1, Commun...
method deathOf (line 275) | private void deathOf(Community c) {
method contract (line 297) | public void contract(Node n, Community community) {
method diviseCommunity (line 308) | private void diviseCommunity(Community tempSavedCom, ArrayList<Communi...
method addCommunity (line 315) | public void addCommunity(Community c) {
FILE: Algorithms/2010-iLCD/src/src/main/java/implementable/Implementation.java
class Implementation (line 22) | public abstract class Implementation {
method GROWTH (line 30) | public abstract boolean GROWTH(Node candidate, Community com);
method BIRTH (line 40) | public abstract ArrayList<Community> BIRTH(Node n1, Node n2);
method CONTRACTION_DIVISION (line 54) | public abstract ArrayList<Community> CONTRACTION_DIVISION(Community af...
method DEATH (line 61) | public abstract boolean DEATH(Community testedCom);
method FUSION (line 71) | public abstract ArrayList<Community> FUSION(Community c1, Community c2...
method getCommunitiesForWhichIsRepresentative (line 78) | public THashSet<Community> getCommunitiesForWhichIsRepresentative(Node...
FILE: Algorithms/2010-iLCD/src/src/main/java/implementable/ImplementationRNHM.java
class ImplementationRNHM (line 21) | public class ImplementationRNHM extends Implementation {
method ImplementationRNHM (line 32) | public ImplementationRNHM(int intialComSize, float integrateParameter,...
method GROWTH (line 38) | @Override
method BIRTH (line 53) | @Override
method CONTRACTION_DIVISION (line 80) | @Override
method DEATH (line 118) | @Override
method FUSION (line 128) | @Override
method getRepresentativity (line 167) | private float getRepresentativity(Node n, Community c) {
method getIdRelation (line 180) | private String getIdRelation(Node n, Community c) {
method getBelongingStrength (line 184) | private float getBelongingStrength(Node n, Community c) {
method getIntrinsicCohesion (line 204) | private float getIntrinsicCohesion(Community c) {
method birthCase3 (line 229) | private ArrayList<Community> birthCase3(ArrayList<Community> newCommun...
method birthCase4 (line 258) | private ArrayList<Community> birthCase4(ArrayList<Community> newCommun...
FILE: Algorithms/2010-iLCD/src/src/main/java/tools/DebugMode.java
class DebugMode (line 5) | public class DebugMode {
method printDebug (line 9) | public static void printDebug(String s){
method printBasic (line 24) | public static void printBasic(String s){
FILE: Algorithms/2010-iLCD/src/src/main/java/tools/SortEdges.java
class SortEdges (line 8) | public class SortEdges {
method sort (line 12) | public static void sort(String input, String output){
method main (line 47) | public static void main(String args[]){
FILE: Algorithms/2010-iLCD/src/src/main/java/tools/Sorter.java
class Sorter (line 7) | public class Sorter<T> {
method Sorter (line 11) | public Sorter(){
method add (line 16) | public void add(T el, Double val){
method getSortedValues (line 33) | public ArrayList<T> getSortedValues(){
method getElts (line 44) | public ArrayList<T> getElts(){
class Element (line 50) | public class Element<T> implements Comparable{
method compareTo (line 54) | @Override
method modVal (line 62) | public void modVal(T el, Double val){
method getHigher (line 68) | public T getHigher(){
FILE: Algorithms/2010-iLCD/src/src/main/java/tools/TextFileHandler.java
class TextFileHandler (line 14) | public class TextFileHandler {
method loadDictionary (line 19) | public static HashMap<String,String> loadDictionary(String fileName,St...
method readFirstLine (line 53) | public static String readFirstLine(String fileName){
method loadFile (line 74) | public static ArrayList<String> loadFile(String fileName){
method printFile (line 97) | public static void printFile(String fileName,ArrayList<String> lines){
method splitLine (line 117) | public static Vector<String> splitLine(String line, String separator){
method main (line 125) | public static void main(String args[]){
method cleanNodeName (line 158) | public static String cleanNodeName(String nodeName){
FILE: Algorithms/2010-iLCD/src/src/main/java/tools/ToolDate.java
class ToolDate (line 7) | public class ToolDate {
method timInDaySince (line 11) | public static long timInDaySince(Date d){
method timInDayBetween (line 15) | public static long timInDayBetween(Date beginning, Date end){
method dateFromString (line 19) | public static Date dateFromString(String date, String format){
FILE: Algorithms/2011-GCE/src-original/Community_Finder.cpp
function sizeSortFunctionLargestFirst (line 26) | bool sizeSortFunctionLargestFirst (Seed * two, Seed * one)
function sizeSortFunctionSmallestFirst (line 31) | bool sizeSortFunctionSmallestFirst (Seed * one, Seed * two)
function vectorSizeSortFunctionLargestFirst (line 36) | bool vectorSizeSortFunctionLargestFirst (vector <V> two, vector <V> one)
function vectorSizeSortFunctionSmallestFirst (line 40) | bool vectorSizeSortFunctionSmallestFirst (vector <V> one, vector <V> two)
FILE: Algorithms/2011-GCE/src-original/Community_Finder.h
function class (line 26) | class Community_Finder {
FILE: Algorithms/2011-GCE/src-original/Range.hpp
class IteratorRange (line 13) | class IteratorRange {
method IteratorRange (line 20) | IteratorRange(const Iterator & _begin, const Iterator & _end) : curren...
method IteratorRange (line 21) | IteratorRange(std::pair<Iterator,Iterator> be) : current(be.first), en...
method empty (line 23) | bool empty() const { return current == end; }
method Iterated (line 24) | Iterated & front() const { return *current; }
method Iterator (line 25) | Iterator frontIterator() const { return current; }
method popFront (line 26) | void popFront() { ++current; }
class ContainerProperties (line 30) | class ContainerProperties {
class ContainerRange (line 37) | class ContainerRange : public IteratorRange< typename ContainerPropertie...
method ContainerRange (line 39) | ContainerRange(Container &c) : IteratorRange< typename ContainerProper...
class ContainerRangeReverse (line 42) | class ContainerRangeReverse : public IteratorRange< typename ContainerPr...
method ContainerRangeReverse (line 44) | ContainerRangeReverse(Container &c) : IteratorRange< typename Containe...
class RangeTypes (line 50) | class RangeTypes {
class ChainedRange (line 57) | class ChainedRange { // Chain Two together
method ChainedRange (line 61) | ChainedRange(const Range &_first, const Range &_second) : first(_first...
method empty (line 62) | bool empty() const { return first.empty() && second.empty(); }
method firstEmpty (line 63) | bool firstEmpty() const { return first.empty(); }
method front (line 64) | typename RangeTypes<Range>::ElementType front() const { return first.e...
method popFront (line 65) | void popFront() { if (first.empty()) second.popFront(); else first.pop...
FILE: Algorithms/2011-GCE/src-original/Seed.h
function class (line 19) | class Seed {
FILE: Algorithms/2011-GCE/src-original/aaron_utils.cpp
function testForError (line 2) | int testForError(FILE * x) { return x==NULL; }
function testForError (line 3) | int testForError(int x) { return x==-1; }
function string (line 5) | string show(long x) { ostringstream s; s << x; return s.str(); }
function string (line 6) | string show(const char * x) { ostringstream s; s << x; return s.str(); }
function string (line 7) | string show(const string &s) { return s; }
function string (line 15) | string runningAverage::operator() (void) const {
function DummyOutputStream (line 21) | DummyOutputStream& DummyOutputStream::operator << (int) { return *this; }
function DummyOutputStream (line 22) | DummyOutputStream& DummyOutputStream::operator << (const char*) { return...
FILE: Algorithms/2011-GCE/src-original/aaron_utils.hpp
function string (line 24) | static string thousandsSeparated(unsigned long x) {
class runningAverage (line 57) | class runningAverage {
type RefPair (line 68) | struct RefPair {
method RefPair (line 71) | RefPair(T1 &in1, T2 &in2) : e1(in1), e2(in2) { }
function make_refpair (line 75) | RefPair<T1, T2> make_refpair(T1 &e1, T2 &e2) {
type DummyOutputStream (line 80) | struct DummyOutputStream {
type StopWatch (line 86) | struct StopWatch { // TODO: put the stopWatch in another file?
type timeval (line 87) | struct timeval
type timeval (line 88) | struct timeval
method StopWatch (line 89) | StopWatch() {
method laptime (line 93) | void laptime(void) { laptime(""); }
method laptime (line 94) | void laptime(const string &tag) {
FILE: Algorithms/2011-GCE/src-original/cliques.cpp
type cliques (line 3) | namespace cliques {
function cliquesForOneNode (line 8) | void cliquesForOneNode(const SimpleIntGraph &g, CliqueFunctionAdaptor ...
function tryCandidate (line 26) | static inline void tryCandidate (const SimpleIntGraph & g, CliqueFunct...
function cliquesWorker (line 42) | void cliquesWorker(const SimpleIntGraph & g, CliqueFunctionAdaptor &cl...
function create_directory (line 120) | void create_directory(const string& directory) throw() {
function cliquesToDirectory (line 130) | void cliquesToDirectory(const bloomGraph<int> &g_, const string &outpu...
FILE: Algorithms/2011-GCE/src-original/cliques.hpp
type cliques (line 15) | namespace cliques {
type CliqueFunctionAdaptor (line 17) | struct CliqueFunctionAdaptor {
function findCliques (line 30) | void findCliques(const SimpleIntGraph &g, T & cliquesOut, unsigned int...
function findCliquesJustIDs (line 54) | void findCliquesJustIDs (const bloomGraph<int> &g, T &cliqu...
function findCliquesOriginalVertexNames (line 55) | void findCliquesOriginalVertexNames(const bloomGraph<int> &g, T &cliqu...
type CliqueSink (line 57) | struct CliqueSink { // Dump the cliques to a file in the CFinder format
method CliqueSink (line 61) | CliqueSink(const bloomGraph<int> &_g, const string& fileName) : g(_g...
method ForeachContainer (line 65) | ForeachContainer(V v, Compsub) {
FILE: Algorithms/2011-GCE/src-original/find_communities.cpp
function main (line 19) | int main (int argc, char **argv) {
FILE: Algorithms/2011-GCE/src-original/graph_analysis.hpp
type graph_analysis (line 3) | namespace graph_analysis {
FILE: Algorithms/2011-GCE/src-original/graph_loading.cpp
type graph_loading (line 15) | namespace graph_loading {
type readEdgeInvalidLineInDataException (line 16) | struct readEdgeInvalidLineInDataException : public exception { }
class RangeOfEdges (line 19) | class RangeOfEdges {
method read_a_row (line 25) | void read_a_row() { updating_p = readEdge(p, l, r); }
method RangeOfEdges (line 27) | RangeOfEdges(const char* b, const char* e) : p(b), fileEnd(e) { if(p...
method front (line 28) | pair<Name, Name> front() { return make_pair(l,r); }
method empty (line 29) | bool empty() { return p == fileEnd; }
method popFront (line 30) | void popFront() { p = updating_p ; if(p!=fileEnd) read_a_row(); }
function loadSimpleIntGraphFromFile (line 43) | void loadSimpleIntGraphFromFile(SimpleIntGraph &bg, const char *fileNa...
function loadBloomGraphMMAP (line 46) | void loadBloomGraphMMAP(SimpleIntGraph &bg, const char *fileName) {
function loadBloomGraphMMAPFastButFussy (line 110) | void loadBloomGraphMMAPFastButFussy(SimpleIntGraph &bg, const char *fi...
function findDistinctVertices (line 151) | void findDistinctVertices(RangeOfEdges<SimpleIntGraph::Name> roe, Simp...
function countDegrees (line 219) | void countDegrees(RangeOfEdges<SimpleIntGraph::Name> roe, SimpleIntGra...
function convertDegreesToOffsets (line 230) | void convertDegreesToOffsets(SimpleIntGraph &bg) {
function populateNameToIDHash (line 251) | void populateNameToIDHash(SimpleIntGraph &bg) {
function addNeighbour (line 267) | static void addNeighbour(VertexIDType edge_source, VertexIDType edge_t...
function loadEdges (line 294) | void loadEdges(RangeOfEdges<SimpleIntGraph::Name> roe, SimpleIntGraph ...
function mmapFile (line 314) | pair<const char *, const char *> mmapFile(const char *fileName) {
FILE: Algorithms/2011-GCE/src-original/graph_loading.hpp
type graph_loading (line 5) | namespace graph_loading {
FILE: Algorithms/2011-GCE/src-original/graph_representation.cpp
function string (line 26) | string VertexNameToString (const int &l) {
FILE: Algorithms/2011-GCE/src-original/graph_representation.hpp
type bloomGraph (line 14) | struct bloomGraph
method bloomGraph (line 34) | bloomGraph(void) : vertex_count(0), edge_count(0) {}
method vcount (line 36) | long unsigned int vcount(void) const { return vertex_count ; }
method ecount (line 37) | long unsigned int ecount(void) const { return edge_count / 2; }
method degree (line 38) | inline long unsigned int degree(long int v) const { return degrees.at(...
method VertexNameType (line 39) | VertexNameType name_of_one_node(long int v) const { return vertex_mapp...
method string (line 40) | string name_of_one_node_asString(long int v) const { return VertexName...
method are_connected (line 42) | bool are_connected(const EdgeType &e) const {
method neighbours (line 48) | pair<const VertexIDType*,const VertexIDType*> neighbours(VertexIDType ...
method neighbours (line 54) | pair<VertexIDType*,VertexIDType*> neighbours(VertexIDType i) {
function H (line 19) | H hash_integer( // This is used in populateHash and key_for_vertexName f...
type bloomGraph (line 27) | struct bloomGraph {
method bloomGraph (line 34) | bloomGraph(void) : vertex_count(0), edge_count(0) {}
method vcount (line 36) | long unsigned int vcount(void) const { return vertex_count ; }
method ecount (line 37) | long unsigned int ecount(void) const { return edge_count / 2; }
method degree (line 38) | inline long unsigned int degree(long int v) const { return degrees.at(...
method VertexNameType (line 39) | VertexNameType name_of_one_node(long int v) const { return vertex_mapp...
method string (line 40) | string name_of_one_node_asString(long int v) const { return VertexName...
method are_connected (line 42) | bool are_connected(const EdgeType &e) const {
method neighbours (line 48) | pair<const VertexIDType*,const VertexIDType*> neighbours(VertexIDType ...
method neighbours (line 54) | pair<VertexIDType*,VertexIDType*> neighbours(VertexIDType i) {
FILE: Algorithms/2011-GCE/src-original/iterative.hpp
type iterative (line 3) | namespace iterative {
FILE: Algorithms/2011-GCE/src-original/modularity.hpp
type modularity (line 4) | namespace modularity {
FILE: Algorithms/2011-GCE/src-refactor/algorithm/cliques.cpp
type cliques (line 3) | namespace cliques {
function cliquesForOneNode (line 9) | void cliquesForOneNode(const SimpleIntGraph &g, CliqueFunctionAdaptor ...
function tryCandidate (line 27) | static inline void
function cliquesWorker (line 44) | void cliquesWorker(const SimpleIntGraph &g, CliqueFunctionAdaptor &cli...
function create_directory (line 127) | void create_directory(const string &directory) throw() {
function cliquesToDirectory (line 137) | void
FILE: Algorithms/2011-GCE/src-refactor/algorithm/cliques.hpp
type cliques (line 16) | namespace cliques {
type CliqueFunctionAdaptor (line 18) | struct CliqueFunctionAdaptor {
function findCliques (line 41) | void findCliques(const SimpleIntGraph &g, T &cliquesOut, unsigned int ...
function findCliquesJustIDs (line 68) | void findCliquesJustIDs(const bloomGraph<int> &g, T &cliquesOut, unsig...
function findCliquesOriginalVertexNames (line 73) | void findCliquesOriginalVertexNames(const bloomGraph<int> &g, T &cliqu...
type CliqueSink (line 76) | struct CliqueSink { // Dump the cliques to a file in the CFinder format
method CliqueSink (line 81) | CliqueSink(const bloomGraph<int> &_g, const string &fileName) : g(_g...
method ForeachContainer (line 86) | ForeachContainer(V v, Compsub) {
FILE: Algorithms/2011-GCE/src-refactor/algorithm/community_finder.cpp
function sizeSortFunctionLargestFirst (line 27) | bool sizeSortFunctionLargestFirst(Seed *two, Seed *one) {
function sizeSortFunctionSmallestFirst (line 31) | bool sizeSortFunctionSmallestFirst(Seed *one, Seed *two) {
function vectorSizeSortFunctionLargestFirst (line 35) | bool vectorSizeSortFunctionLargestFirst(vector<V> two, vector<V> one) {
function vectorSizeSortFunctionSmallestFirst (line 39) | bool vectorSizeSortFunctionSmallestFirst(vector<V> one, vector<V> two) {
FILE: Algorithms/2011-GCE/src-refactor/algorithm/community_finder.h
function class (line 29) | class community_finder {
FILE: Algorithms/2011-GCE/src-refactor/algorithm/find_communities.cpp
function main (line 17) | int main(int argc, char **argv) {
FILE: Algorithms/2011-GCE/src-refactor/algorithm/seed.h
function class (line 22) | class Seed {
FILE: Algorithms/2011-GCE/src-refactor/useless/graph_analysis.hpp
type graph_analysis (line 3) | namespace graph_analysis {
FILE: Algorithms/2011-GCE/src-refactor/useless/iterative.hpp
type iterative (line 3) | namespace iterative {
FILE: Algorithms/2011-GCE/src-refactor/useless/modularity.hpp
type modularity (line 3) | namespace modularity {
FILE: Algorithms/2011-GCE/src-refactor/util/aaron_utils.cpp
function testForError (line 3) | int testForError(FILE *x) { return x == NULL; }
function testForError (line 5) | int testForError(int x) { return x == -1; }
function string (line 7) | string show(long x) {
function string (line 13) | string show(const char *x) {
function string (line 19) | string show(const string &s) { return s; }
function string (line 29) | string runningAverage::operator()(void) const {
function DummyOutputStream (line 35) | DummyOutputStream &DummyOutputStream::operator<<(int) { return *this; }
function DummyOutputStream (line 37) | DummyOutputStream &DummyOutputStream::operator<<(const char *) { return ...
FILE: Algorithms/2011-GCE/src-refactor/util/aaron_utils.hpp
function string (line 28) | static string thousandsSeparated(unsigned long x) {
class runningAverage (line 65) | class runningAverage {
type RefPair (line 79) | struct RefPair {
method RefPair (line 83) | RefPair(T1 &in1, T2 &in2) : e1(in1), e2(in2) {}
function make_refpair (line 92) | RefPair<T1, T2> make_refpair(T1 &e1, T2 &e2) {
type DummyOutputStream (line 97) | struct DummyOutputStream {
type StopWatch (line 105) | struct StopWatch { // TODO: put the stopWatch in another file?
type timeval (line 106) | struct timeval
type timeval (line 107) | struct timeval
method StopWatch (line 109) | StopWatch() {
method laptime (line 114) | void laptime(void) { laptime(""); }
method laptime (line 116) | void laptime(const string &tag) {
FILE: Algorithms/2011-GCE/src-refactor/util/graph/graph_loading.cpp
type graph_loading (line 15) | namespace graph_loading {
type readEdgeInvalidLineInDataException (line 16) | struct readEdgeInvalidLineInDataException : public exception {
class RangeOfEdges (line 21) | class RangeOfEdges {
method read_a_row (line 28) | void read_a_row() { updating_p = readEdge(p, l, r); }
method RangeOfEdges (line 31) | RangeOfEdges(const char *b, const char *e) : p(b), fileEnd(e) { if (...
method front (line 33) | pair<Name, Name> front() { return make_pair(l, r); }
method empty (line 35) | bool empty() { return p == fileEnd; }
method popFront (line 37) | void popFront() {
function loadSimpleIntGraphFromFile (line 61) | void loadSimpleIntGraphFromFile(SimpleIntGraph &bg, const char *fileNa...
function loadBloomGraphMMAP (line 65) | void loadBloomGraphMMAP(SimpleIntGraph &bg, const char *fileName) {
function loadBloomGraphMMAPFastButFussy (line 133) | void loadBloomGraphMMAPFastButFussy(SimpleIntGraph &bg, const char *fi...
function findDistinctVertices (line 174) | void findDistinctVertices(RangeOfEdges<SimpleIntGraph::Name> roe, Simp...
function countDegrees (line 248) | void countDegrees(RangeOfEdges<SimpleIntGraph::Name> roe, SimpleIntGra...
function convertDegreesToOffsets (line 259) | void convertDegreesToOffsets(SimpleIntGraph &bg) {
function populateNameToIDHash (line 281) | void populateNameToIDHash(SimpleIntGraph &bg) {
function addNeighbour (line 298) | static void
function loadEdges (line 330) | void loadEdges(RangeOfEdges<SimpleIntGraph::Name> roe, SimpleIntGraph ...
function mmapFile (line 351) | pair<const char *, const char *> mmapFile(const char *fileName) {
FILE: Algorithms/2011-GCE/src-refactor/util/graph/graph_loading.hpp
type graph_loading (line 5) | namespace graph_loading {
FILE: Algorithms/2011-GCE/src-refactor/util/graph/graph_representation.cpp
function string (line 28) | string VertexNameToString(const int &l) {
FILE: Algorithms/2011-GCE/src-refactor/util/graph/graph_representation.hpp
type bloomGraph (line 14) | struct bloomGraph
method bloomGraph (line 35) | bloomGraph(void) : vertex_count(0), edge_count(0) {}
method vcount (line 37) | long unsigned int vcount(void) const { return vertex_count; }
method ecount (line 39) | long unsigned int ecount(void) const {
method degree (line 42) | inline long unsigned int degree(long int v) const { return degrees.at(...
method VertexNameType (line 44) | VertexNameType name_of_one_node(long int v) const { return vertex_mapp...
method string (line 46) | string name_of_one_node_asString(long int v) const { return VertexName...
method are_connected (line 50) | bool are_connected(const EdgeType &e) const {
method neighbours (line 57) | pair<const VertexIDType *, const VertexIDType *>
method neighbours (line 64) | pair<VertexIDType *, VertexIDType *> neighbours(VertexIDType i) {
function H (line 19) | H hash_integer( // This is used in populateHash and key_for_vertexName f...
type bloomGraph (line 28) | struct bloomGraph {
method bloomGraph (line 35) | bloomGraph(void) : vertex_count(0), edge_count(0) {}
method vcount (line 37) | long unsigned int vcount(void) const { return vertex_count; }
method ecount (line 39) | long unsigned int ecount(void) const {
method degree (line 42) | inline long unsigned int degree(long int v) const { return degrees.at(...
method VertexNameType (line 44) | VertexNameType name_of_one_node(long int v) const { return vertex_mapp...
method string (line 46) | string name_of_one_node_asString(long int v) const { return VertexName...
method are_connected (line 50) | bool are_connected(const EdgeType &e) const {
method neighbours (line 57) | pair<const VertexIDType *, const VertexIDType *>
method neighbours (line 64) | pair<VertexIDType *, VertexIDType *> neighbours(VertexIDType i) {
FILE: Algorithms/2011-GCE/src-refactor/util/range.hpp
class IteratorRange (line 13) | class IteratorRange {
method IteratorRange (line 21) | IteratorRange(const Iterator &_begin, const Iterator &_end) : current(...
method IteratorRange (line 23) | IteratorRange(std::pair<Iterator, Iterator> be) : current(be.first), e...
method empty (line 25) | bool empty() const { return current == end; }
method Iterated (line 27) | Iterated &front() const { return *current; }
method Iterator (line 29) | Iterator frontIterator() const { return current; }
method popFront (line 31) | void popFront() { ++current; }
class ContainerProperties (line 35) | class ContainerProperties {
class ContainerRange (line 43) | class ContainerRange : public IteratorRange<typename ContainerProperties...
method ContainerRange (line 45) | ContainerRange(Container &c) : IteratorRange<typename ContainerPropert...
class ContainerRangeReverse (line 50) | class ContainerRangeReverse : public IteratorRange<typename ContainerPro...
method ContainerRangeReverse (line 52) | ContainerRangeReverse(Container &c) : IteratorRange<typename Container...
class RangeTypes (line 58) | class RangeTypes {
class ChainedRange (line 65) | class ChainedRange { // Chain Two together
method ChainedRange (line 69) | ChainedRange(const Range &_first, const Range &_second) : first(_first...
method empty (line 71) | bool empty() const { return first.empty() && second.empty(); }
method firstEmpty (line 73) | bool firstEmpty() const { return first.empty(); }
method front (line 75) | typename RangeTypes<Range>::ElementType front() const { return first.e...
method popFront (line 77) | void popFront() { if (first.empty()) second.popFront(); else first.pop...
FILE: Algorithms/2011-MOSES/src-original/Range.cpp
type amd (line 5) | namespace amd {
function rangeOverStream (line 7) | std::auto_ptr< Range<std::string> > rangeOverStream(std::istream &_ist...
FILE: Algorithms/2011-MOSES/src-original/Range.hpp
class IteratorRange (line 23) | class IteratorRange {
method IteratorRange (line 30) | IteratorRange(const Iterator & _begin, const Iterator & _end) : curren...
method IteratorRange (line 31) | IteratorRange(std::pair<Iterator,Iterator> be) : current(be.first), en...
method empty (line 33) | bool empty() const { return current == end; }
method Iterated (line 34) | Iterated & front() const { return *current; }
method Iterator (line 35) | Iterator frontIterator() const { return current; }
method popFront (line 36) | void popFront() { ++current; }
class ContainerProperties (line 40) | class ContainerProperties {
class ContainerRange (line 47) | class ContainerRange : public IteratorRange< typename ContainerPropertie...
method ContainerRange (line 49) | ContainerRange(Container &c) : IteratorRange< typename ContainerProper...
class RangeTypes (line 55) | class RangeTypes {
class ChainedRange (line 62) | class ChainedRange { // Chain Two together
method ChainedRange (line 66) | ChainedRange(const Range &_first, const Range &_second) : first(_first...
method empty (line 67) | bool empty() const { return first.empty() && second.empty(); }
method firstEmpty (line 68) | bool firstEmpty() const { return first.empty(); }
method front (line 69) | typename RangeTypes<Range>::ElementType front() const { return first.e...
method popFront (line 70) | void popFront() { if (first.empty()) second.popFront(); else first.pop...
type Range (line 74) | struct Range {
type RangeContainer (line 84) | struct RangeContainer
method RangeContainer (line 89) | explicit RangeContainer(Iterator first, Iterator last) : _current(firs...
method empty (line 91) | virtual bool empty() const { return _current == _last; }
method popFront (line 92) | virtual void popFront() { ++_current; }
method front (line 93) | virtual typename Iterator::reference front() const { return *_current; }
type amd (line 99) | namespace amd {
function mk_range (line 101) | std::auto_ptr< Range< typename C::iterator::reference > > mk_range(C &...
function mk_range (line 105) | std::auto_ptr< Range< typename C::const_iterator::reference > > mk_ran...
function mk_range_c (line 109) | std::auto_ptr< Range< typename C::const_iterator::reference > > mk_ran...
function mk_reverse_range (line 113) | std::auto_ptr< Range< typename C::reverse_iterator::reference > > mk_r...
function mk_reverse_range (line 117) | std::auto_ptr< Range< typename C::const_reverse_iterator::reference > ...
class RangeOverStream (line 122) | class RangeOverStream : public Range<std::string> {
class RangeMapper (line 137) | class RangeMapper : public Range<typename boost::result_of<F(typename ...
method RangeMapper (line 144) | RangeMapper(const T & mapped_, F f_) : mapped(mapped_), f(f_) {}
method empty (line 145) | bool empty() const { return mapped.empty(); }
method popFront (line 146) | void popFront() { mapped.popFront(); }
method value_type (line 147) | value_type front() const {
function make_mapper_range (line 152) | RangeMapper<T, F> make_mapper_range(const T& m, F f) {
function map_range (line 157) | RangeMapper<T, F> map_range(const F &f, const T& m) {
class RangeFilter (line 162) | class RangeFilter : public Range<typename R::value_type> {
method RangeFilter (line 167) | RangeFilter(const R& _r, const P& _p) : r(_r), p(_p) {
method empty (line 172) | virtual bool empty() const { return r.empty(); }
method popFront (line 173) | virtual void popFront() {
method value_type (line 178) | virtual value_type front() const {
function make_filter_range (line 183) | RangeFilter<R,P> make_filter_range(const R& r, const P& p) {
function filter (line 188) | RangeFilter<R,P> filter(const P& p, const R& r) {
function range_length (line 192) | int range_length(R r) {
class RangeEnum (line 202) | class RangeEnum : public Range<I> {
method RangeEnum (line 205) | RangeEnum(I a_) : a(a_) {}
method empty (line 206) | virtual bool empty() const { return false; }
method I (line 207) | virtual I front() const { return a; }
method popFront (line 208) | virtual void popFront() { ++a; }
function make_counter_range (line 212) | RangeEnum<I> make_counter_range(I first) {
class RangeZipper (line 218) | class RangeZipper : public Range< std::pair<
method RangeZipper (line 229) | RangeZipper(const L &l_, const R &r_) : l(l_), r(r_) {}
method empty (line 230) | virtual bool empty() const { return l.empty() || r.empty(); }
method value_type (line 231) | virtual value_type front() const { return make_pair(l.front(), r.fro...
method popFront (line 232) | virtual void popFront() { l.popFront(); r.popFront(); }
function zip (line 236) | RangeZipper<L,R> zip(const L &l, const R &r) {
class RangeChain (line 242) | class RangeChain : public Range< typename L::value_type > {
method RangeChain (line 247) | RangeChain(const L &l_, const R &r_) : l(l_), r(r_) {}
method empty (line 248) | virtual bool empty() const { return l.empty() && r.empty(); }
method value_type (line 249) | virtual value_type front() const {
method popFront (line 255) | virtual void popFront() {
function chain (line 263) | RangeChain<L,R> chain(const L &l, const R &r) {
class auto_ptrWithPairedBool (line 285) | class auto_ptrWithPairedBool : public std::auto_ptr<Type> {
method auto_ptrWithPairedBool (line 287) | auto_ptrWithPairedBool(Type *p) : std::auto_ptr<Type> (p), interrupted...
FILE: Algorithms/2011-MOSES/src-original/aaron_utils.cpp
function testForError (line 6) | int testForError(FILE * x) { return x==NULL; }
function testForError (line 7) | int testForError(int x) { return x==-1; }
function string (line 9) | string show(int64 x) { ostringstream s; s << x; return s.str(); }
function string (line 10) | string show(const char * x) { ostringstream s; s << x; return s.str(); }
function string (line 11) | string show(const string &s) { return s; }
function string (line 19) | string runningAverage::operator() (void) const {
function DummyOutputStream (line 25) | DummyOutputStream& DummyOutputStream::operator << (int) { return *this; }
function DummyOutputStream (line 26) | DummyOutputStream& DummyOutputStream::operator << (const char*) { return...
function string (line 29) | string thousandsSeparated(uint64 x) {
function istream (line 40) | istream *amd::zcatThis(const char *gzippedFile) {
type stat (line 50) | struct stat
FILE: Algorithms/2011-MOSES/src-original/aaron_utils.hpp
class runningAverage (line 60) | class runningAverage {
type RefPair (line 71) | struct RefPair {
method RefPair (line 74) | RefPair(T1 &in1, T2 &in2) : e1(in1), e2(in2) { }
function make_refpair (line 78) | RefPair<T1, T2> make_refpair(T1 &e1, T2 &e2) {
type DummyOutputStream (line 83) | struct DummyOutputStream {
type StopWatch (line 89) | struct StopWatch { // TODO: put the stopWatch in another file?
type timeval (line 90) | struct timeval
type timeval (line 91) | struct timeval
method StopWatch (line 92) | StopWatch() {
method laptime (line 96) | void laptime(void) { laptime(""); }
method laptime (line 97) | void laptime(const string &tag) {
class maxOnlymap (line 111) | class maxOnlymap : public map<K, V> {
method insert (line 113) | pair<typename map<K,V>::iterator,bool> insert ( const typename map<K,V...
type Timer (line 125) | struct Timer {
type timeval (line 126) | struct timeval
method Timer (line 128) | Timer() {
method Timer (line 131) | Timer(const string &s): _s(s) {
method age (line 134) | double age() const {
type amd (line 146) | namespace amd {
type DebugCounter (line 151) | struct DebugCounter {
function Histogram (line 160) | void Histogram(T r) {
function TwoWayTable (line 178) | void TwoWayTable(T1 r1, T2 r2) {
function constAt (line 227) | typename C::value_type constAt(const C &c, int i) {
FILE: Algorithms/2011-MOSES/src-original/graph_loading.cpp
type graph_loading (line 25) | namespace graph_loading {
type readEdgeInvalidLineInDataException (line 27) | struct readEdgeInvalidLineInDataException : public exception { }
class RangeOfEdges (line 31) | class RangeOfEdges {
method read_a_row (line 37) | void read_a_row() { updating_p = readEdge(p, l, r); }
method RangeOfEdges (line 39) | RangeOfEdges(const char* b, const char* e) : p(b), fileEnd(e) { if(p...
method front (line 40) | pair<Name, Name> front() { return make_pair(l,r); }
method empty (line 41) | bool empty() { return p == fileEnd; }
method popFront (line 42) | void popFront() { p = updating_p ; if(p!=fileEnd) read_a_row(); }
function loadSimpleStringGraphFromFile (line 56) | void loadSimpleStringGraphFromFile(SimpleStringGraph &g, const char *f...
function loadSimpleIntGraphFromFile (line 60) | void loadSimpleIntGraphFromFile(SimpleIntGraph &bg, const char *fileNa...
type DegreeTag (line 65) | struct DegreeTag {}
type NameTag (line 66) | struct NameTag {}
function DegreeIncrementer (line 67) | void DegreeIncrementer(pair<N,V> &p) { ++p.second; }
function DegreeDecrementer (line 68) | void DegreeDecrementer(pair<N,V> &p) { --p.second; }
type state_flag (line 70) | enum state_flag { LOADING_NONE, LOADING_NODES, LOADING_DEGREEMAP, LOAD...
type lsdkfj (line 71) | struct lsdkfj {
type state_flag (line 72) | enum state_flag
function sigUSR1_handler (line 75) | void sigUSR1_handler(int) {
function loadBloomGraphMMAP (line 86) | static void loadBloomGraphMMAP(bloomGraph<Name> &bg, const char *fileN...
function loadBloomGraphMMAPFastButFussy (line 273) | void loadBloomGraphMMAPFastButFussy(SimpleIntGraph &bg, const char *fi...
function findDistinctVertices (line 321) | void findDistinctVertices(RangeOfEdges<SimpleIntGraph::Name> roe, Simp...
function countDegrees (line 390) | void countDegrees(RangeOfEdges<SimpleIntGraph::Name> roe, SimpleIntGra...
function convertDegreesToOffsets (line 401) | void convertDegreesToOffsets(SimpleIntGraph &bg) {
function populateNameToIDHash (line 422) | static void populateNameToIDHash(SimpleIntGraph &bg) {
function populateNameToIDHash (line 436) | static void populateNameToIDHash(SimpleStringGraph &bg) {
function addNeighbour (line 452) | static void addNeighbour(VertexIDType edge_source, VertexIDType edge_t...
function loadEdges (line 479) | void loadEdges(RangeOfEdges<SimpleIntGraph::Name> roe, SimpleIntGraph ...
function mmapFile (line 499) | pair<const char *, const char *> mmapFile(const char *fileName) {
FILE: Algorithms/2011-MOSES/src-original/graph_loading.hpp
type graph_loading (line 5) | namespace graph_loading {
FILE: Algorithms/2011-MOSES/src-original/graph_representation.cpp
function V (line 7) | V bloomGraph<int>::key_for_vertexName(int v) const {
function V (line 24) | V bloomGraph<string>::key_for_vertexName(string v) const {
function string (line 42) | string VertexNameToString (const int &l) {
FILE: Algorithms/2011-MOSES/src-original/graph_representation.hpp
type bloomGraph (line 16) | struct bloomGraph
method bloomGraph (line 77) | explicit bloomGraph() : GraphWithoutNames() {}
method VertexNameType (line 83) | VertexNameType name_of_one_node(V v) const { return vertex_mappings.at...
method VertexNameType (line 84) | VertexNameType name(V v) const { assert(v>=0); assert(v<vcount()); ass...
method string (line 85) | string name_of_one_node_asString(V v) const { return VertexNameToStrin...
function H (line 21) | H hash_integer( // This is used in populateHash and key_for_vertexName f...
function H (line 28) | H hash_integer( // This is used in populateHash and key_for_vertexName f...
type GraphWithoutNames (line 40) | struct GraphWithoutNames { // this is useful because it doesn't need the...
method V (line 41) | V vcount(void) const { return vertex_count ; }
method V (line 42) | V ecount(void) const { return edge_count / 2; }
method V (line 43) | inline V degree(V v) const { return degrees.at(v); }
method neighbours (line 44) | pair<const VertexIDType*,const VertexIDType*> neighbours(VertexIDType ...
method neighbours (line 50) | pair<VertexIDType*,VertexIDType*> neighbours(VertexIDType i) {
method are_connected (line 56) | bool are_connected(const V &v, const V &v2) const { return are_connect...
method are_connected (line 57) | bool are_connected(const EdgeType &e) const {
method GraphWithoutNames (line 64) | GraphWithoutNames(void) : vertex_count(0), edge_count(0) {}
type bloomGraph (line 74) | struct bloomGraph : public GraphWithoutNames {
method bloomGraph (line 77) | explicit bloomGraph() : GraphWithoutNames() {}
method VertexNameType (line 83) | VertexNameType name_of_one_node(V v) const { return vertex_mappings.at...
method VertexNameType (line 84) | VertexNameType name(V v) const { assert(v>=0); assert(v<vcount()); ass...
method string (line 85) | string name_of_one_node_asString(V v) const { return VertexNameToStrin...
FILE: Algorithms/2011-MOSES/src-original/groupStats.cpp
function main (line 21) | int main(int argc, char **argv) {
FILE: Algorithms/2011-MOSES/src-original/grouping.cpp
type grouping (line 5) | namespace grouping {
function Foreach (line 21) | Foreach(V n, ns) {
function Group (line 46) | Group* Grouping::newG () { return this->newG(false); }
function Group (line 47) | Group* Grouping::newG(bool randomized_p_in) {
function ForeachContainer (line 55) | ForeachContainer (Group *grp, grps) {
function deleteEmptyGroup (line 129) | void deleteEmptyGroup(Grouping *pging, Group *grp) { // TODO: This is ...
FILE: Algorithms/2011-MOSES/src-original/grouping.hpp
type grouping (line 5) | namespace grouping {
class Group (line 7) | class Group
class Grouping (line 8) | class Grouping
type edgeHash (line 34) | struct edgeHash {
type EdgeCountTriple (line 44) | struct EdgeCountTriple { // TODO: make this private
method EdgeCountTriple (line 47) | EdgeCountTriple() : shared_comms(0), other_index(0) {}
type orderGroup (line 10) | struct orderGroup {
class Grouping (line 14) | class Grouping {
type edgeHash (line 34) | struct edgeHash {
type EdgeCountTriple (line 44) | struct EdgeCountTriple { // TODO: make this private
method EdgeCountTriple (line 47) | EdgeCountTriple() : shared_comms(0), other_index(0) {}
class Group (line 58) | class Group {
FILE: Algorithms/2011-MOSES/src-original/iterative.hpp
type iterative (line 3) | namespace iterative {
type OneNode (line 11) | struct OneNode {
type PartitionStats (line 20) | struct PartitionStats {
type Partition (line 33) | struct Partition : public PartitionStats {
FILE: Algorithms/2011-MOSES/src-original/moses.cpp
function main (line 21) | int main(int argc, char **argv) {
FILE: Algorithms/2011-MOSES/src-original/overlapping.cpp
function runMutual (line 66) | static void runMutual(void) {
type overlapping (line 70) | namespace overlapping {
function overlapping (line 74) | void overlapping(SimpleIntGraph &g) { overlappingT(g); }
function overlapping (line 75) | void overlapping(SimpleStringGraph &g) { overlappingT(g); }
function addSeed (line 82) | void addSeed(Grouping &ging, const set<V> &nodes, bool randomized_p_in) {
function overlappingT (line 100) | static void overlappingT(bloomGraph<N> &g) {
function tryAndApplyThisOne (line 237) | static bool tryAndApplyThisOne(Grouping &ging, V e, bool randomized_p_...
function useOneNodeSeeds (line 252) | static void useOneNodeSeeds(Grouping &ging, bloomGraph<N> &g, bool ran...
function groupStats (line 285) | static void groupStats(const Grouping &ging, bloomGraph<N> &g) {
function seedGroupingWithPartition (line 361) | void seedGroupingWithPartition(Grouping &ging, const iterative::Partit...
function count_intersection (line 378) | static size_t count_intersection(It it1b, It it1e, It it2b, It it2e) {
function count_intersection (line 384) | static size_t count_intersection(const Container &container1, const Co...
type DeltaSeed (line 393) | struct DeltaSeed {
method deltadeltaPairEntropy (line 400) | long double deltadeltaPairEntropy() const {
method DeltaSeed (line 403) | explicit DeltaSeed(V v, int group_size_smaller, Grouping &ging) : _v...
method addEdge2 (line 406) | void addEdge2(V n, const V* edgeVN_ptr) { // n is connected to _v
method addEdge (line 410) | void addEdge(V , int sharedCommunities) { // n is connected to _v /...
method redoEdge (line 418) | void redoEdge(V , int previous_sharedCommunities) { // n is connect...
method _deltaZentropy (line 424) | long double _deltaZentropy() const {
method _deltaTotalentropy (line 443) | long double _deltaTotalentropy() const {
type FrontierNode (line 448) | struct FrontierNode {
method FrontierNode (line 449) | FrontierNode(long double &score, V v) : _score(score), _v(v) {}
type Incrementer (line 452) | struct Incrementer {
method Incrementer (line 454) | Incrementer(long double &x) : _x(x) {}
type VertexTag (line 460) | struct VertexTag {}
type Frontier (line 461) | struct Frontier : private multi_index_container < // TODO: Some sort o...
method calcddEE (line 472) | static long double __attribute__ ((noinline)) calcddEE(const Groupin...
method addNode (line 479) | void addNode(const Grouping &ging, V to, const V *edgeFT_ptr) {
method erase_best_node (line 493) | void erase_best_node() {
method erase_this_node (line 497) | int erase_this_node(V to) {
method best_node_score (line 500) | long double best_node_score() const {
method V (line 504) | V best_node_v() const {
method Empty (line 508) | bool Empty() const {
function logNchoose (line 513) | static long double logNchoose(int64 N, int64 n_c) {
function growingSeed (line 543) | pair<long double, set<V> > growingSeed(Grouping &ging, int lookahead
type ThrowingIterator (line 648) | struct ThrowingIterator {
type Dereferenced (line 649) | struct Dereferenced {}
method V (line 650) | V & operator *() { throw Dereferenced(); }
function emptyIntersection (line 653) | bool emptyIntersection(const pair<const V*, const V*> &l, const pair<c...
function growThisEdge (line 668) | static pair<long double, set<V> > growThisEdge(Grouping &ging, const V...
function save (line 730) | static void save(Grouping &ging, bloomGraph<N> &g) {
type hashGroup (line 745) | struct hashGroup {
function louvainStyle (line 752) | static void louvainStyle(Grouping &ging, bloomGraph<N> &g) {
function update_p_out (line 838) | static void update_p_out(Grouping &ging) {
type PairGroupHash (line 846) | struct PairGroupHash {
function tryMerges (line 851) | static void tryMerges(Grouping &ging) {
function tryDeletions (line 991) | static void tryDeletions(Grouping &ging, bool SaveScores /*= true*/) {...
function P_x_given_z (line 1082) | long double P_x_given_z(const Grouping &ging, long double p_o, long do...
function MOSES_objective (line 1096) | long double MOSES_objective(const Grouping &ging) {
function estimate_p_in_and_p_out (line 1141) | static void estimate_p_in_and_p_out(Grouping &ging) {
FILE: Algorithms/2011-MOSES/src-original/overlapping.hpp
type overlapping (line 3) | namespace overlapping {
FILE: Algorithms/2011-MOSES/src-refactor/algorithm/group_status_exec.cpp
function main (line 16) | int main(int argc, char **argv) {
FILE: Algorithms/2011-MOSES/src-refactor/algorithm/grouping.cpp
type grouping (line 7) | namespace grouping {
function Foreach (line 20) | Foreach(V n, ns) {
function Group (line 48) | Group *Grouping::newG() { return this->newG(false); }
function Group (line 50) | Group *Grouping::newG(bool randomized_p_in) {
function ForeachContainer (line 60) | ForeachContainer (Group *grp, grps) {
function deleteEmptyGroup (line 134) | void deleteEmptyGroup(Grouping *pging,
FILE: Algorithms/2011-MOSES/src-refactor/algorithm/grouping.hpp
type grouping (line 7) | namespace grouping {
class Group (line 9) | class Group
class Grouping (line 11) | class Grouping
type edgeHash (line 43) | struct edgeHash {
type EdgeCountTriple (line 55) | struct EdgeCountTriple { // TODO: make this private
method EdgeCountTriple (line 59) | EdgeCountTriple() : shared_comms(0), other_index(0) {}
type orderGroup (line 13) | struct orderGroup {
class Grouping (line 17) | class Grouping {
type edgeHash (line 43) | struct edgeHash {
type EdgeCountTriple (line 55) | struct EdgeCountTriple { // TODO: make this private
method EdgeCountTriple (line 59) | EdgeCountTriple() : shared_comms(0), other_index(0) {}
class Group (line 72) | class Group {
FILE: Algorithms/2011-MOSES/src-refactor/algorithm/moses.cpp
function main (line 18) | int main(int argc, char **argv) {
FILE: Algorithms/2011-MOSES/src-refactor/algorithm/overlapping.cpp
function runMutual (line 69) | static void runMutual(void) {
type overlapping (line 73) | namespace overlapping {
function overlapping (line 80) | void overlapping(SimpleIntGraph &g) { overlappingT(g); }
function overlapping (line 82) | void overlapping(SimpleStringGraph &g) { overlappingT(g); }
function addSeed (line 95) | void addSeed(Grouping &ging, const set<V> &nodes, bool randomized_p_in) {
function overlappingT (line 125) | static void overlappingT(bloomGraph<N> &g) {
function tryAndApplyThisOne (line 264) | static bool tryAndApplyThisOne(Grouping &ging, V e, bool randomized_p_...
function useOneNodeSeeds (line 281) | static void useOneNodeSeeds(Grouping &ging, bloomGraph<N> &g, bool ran...
function groupStats (line 316) | static void groupStats(const Grouping &ging, bloomGraph<N> &g) {
function seedGroupingWithPartition (line 395) | void seedGroupingWithPartition(Grouping &ging, const iterative::Partit...
function count_intersection (line 412) | static size_t count_intersection(It it1b, It it1e, It it2b, It it2e) {
function count_intersection (line 419) | static size_t count_intersection(const Container &container1, const Co...
type DeltaSeed (line 425) | struct DeltaSeed {
method deltadeltaPairEntropy (line 433) | long double deltadeltaPairEntropy() const {
method DeltaSeed (line 438) | explicit DeltaSeed(V v, int group_size_smaller, Grouping &ging) : _v...
method addEdge2 (line 445) | void addEdge2(V n, const V *edgeVN_ptr) { // n is connected to _v
method addEdge (line 450) | void addEdge(V, int sharedCommunities) {
method redoEdge (line 457) | void redoEdge(V,
method _deltaZentropy (line 468) | long double _deltaZentropy() const {
method _deltaTotalentropy (line 476) | long double _deltaTotalentropy() const {
type FrontierNode (line 481) | struct FrontierNode {
method FrontierNode (line 482) | FrontierNode(long double &score, V v) : _score(score), _v(v) {}
type Incrementer (line 487) | struct Incrementer {
method Incrementer (line 490) | Incrementer(long double &x) : _x(x) {}
type VertexTag (line 497) | struct VertexTag {
type Frontier (line 500) | struct Frontier : private multi_index_container< // TODO: Some sort of...
method calcddEE (line 511) | static long double __attribute__ ((noinline)) calcddEE(const Groupin...
method addNode (line 519) | void addNode(const Grouping &ging, V to, const V *edgeFT_ptr) {
method erase_best_node (line 534) | void erase_best_node() {
method erase_this_node (line 539) | int erase_this_node(V to) {
method best_node_score (line 543) | long double best_node_score() const {
method V (line 548) | V best_node_v() const {
method Empty (line 553) | bool Empty() const {
function logNchoose (line 558) | static long double logNchoose(int64 N, int64 n_c) {
function growingSeed (line 588) | pair<long double, set<V> >
type ThrowingIterator (line 684) | struct ThrowingIterator {
type Dereferenced (line 685) | struct Dereferenced {
method V (line 688) | V &operator*() { throw Dereferenced(); }
function emptyIntersection (line 693) | bool emptyIntersection(const pair<const V *, const V *> &l, const pair...
function growThisEdge (line 704) | static pair<long double, set<V> >
function save (line 764) | static void save(Grouping &ging, bloomGraph<N> &g) {
type hashGroup (line 779) | struct hashGroup {
function louvainStyle (line 788) | static void louvainStyle(Grouping &ging, bloomGraph<N> &g) {
function update_p_out (line 876) | static void update_p_out(Grouping &ging) {
type PairGroupHash (line 884) | struct PairGroupHash {
function tryMerges (line 890) | static void tryMerges(Grouping &ging) {
function tryDeletions (line 1038) | static void tryDeletions(Grouping &ging,
function P_x_given_z (line 1128) | long double P_x_given_z(const Grouping &ging, long double p_o, long do...
function MOSES_objective (line 1143) | long double MOSES_objective(const Grouping &ging) {
function estimate_p_in_and_p_out (line 1185) | static void estimate_p_in_and_p_out(Grouping &ging) {
FILE: Algorithms/2011-MOSES/src-refactor/algorithm/overlapping.hpp
type overlapping (line 3) | namespace overlapping {
FILE: Algorithms/2011-MOSES/src-refactor/util/aaron_utils.cpp
function testForError (line 7) | int testForError(FILE *x) { return x == NULL; }
function testForError (line 9) | int testForError(int x) { return x == -1; }
function string (line 11) | string show(int64 x) {
function string (line 17) | string show(const char *x) {
function string (line 23) | string show(const string &s) { return s; }
function string (line 33) | string runningAverage::operator()(void) const {
function DummyOutputStream (line 39) | DummyOutputStream &DummyOutputStream::operator<<(int) { return *this; }
function DummyOutputStream (line 41) | DummyOutputStream &DummyOutputStream::operator<<(const char *) { return ...
function string (line 45) | string thousandsSeparated(uint64 x) {
function istream (line 56) | istream *amd::zcatThis(const char *gzippedFile) {
type stat (line 67) | struct stat
FILE: Algorithms/2011-MOSES/src-refactor/util/aaron_utils.hpp
class runningAverage (line 70) | class runningAverage {
type RefPair (line 84) | struct RefPair {
method RefPair (line 88) | RefPair(T1 &in1, T2 &in2) : e1(in1), e2(in2) {}
function make_refpair (line 97) | RefPair<T1, T2> make_refpair(T1 &e1, T2 &e2) {
type DummyOutputStream (line 102) | struct DummyOutputStream {
type StopWatch (line 110) | struct StopWatch { // TODO: put the stopWatch in another file?
type timeval (line 111) | struct timeval
type timeval (line 112) | struct timeval
method StopWatch (line 114) | StopWatch() {
method laptime (line 119) | void laptime(void) { laptime(""); }
method laptime (line 121) | void laptime(const string &tag) {
class maxOnlymap (line 138) | class maxOnlymap : public map<K, V> {
method insert (line 140) | pair<typename map<K, V>::iterator, bool> insert(const typename map<K, ...
type Timer (line 152) | struct Timer {
type timeval (line 153) | struct timeval
method Timer (line 156) | Timer() {
method Timer (line 160) | Timer(const string &s) : _s(s) {
method age (line 164) | double age() const {
type amd (line 178) | namespace amd {
type DebugCounter (line 184) | struct DebugCounter {
function Histogram (line 195) | void Histogram(T r) {
function TwoWayTable (line 214) | void TwoWayTable(T1 r1, T2 r2) {
function constAt (line 264) | typename C::value_type constAt(const C &c, int i) {
FILE: Algorithms/2011-MOSES/src-refactor/util/graph/graph_loading.cpp
type graph_loading (line 25) | namespace graph_loading {
type readEdgeInvalidLineInDataException (line 27) | struct readEdgeInvalidLineInDataException : public exception {
class RangeOfEdges (line 34) | class RangeOfEdges {
method read_a_row (line 41) | void read_a_row() { updating_p = readEdge(p, l, r); }
method RangeOfEdges (line 44) | RangeOfEdges(const char *b, const char *e) : p(b), fileEnd(e) { if (...
method front (line 46) | pair<Name, Name> front() { return make_pair(l, r); }
method empty (line 48) | bool empty() { return p == fileEnd; }
method popFront (line 50) | void popFront() {
function loadSimpleStringGraphFromFile (line 79) | void loadSimpleStringGraphFromFile(SimpleStringGraph &g, const char *f...
function loadSimpleIntGraphFromFile (line 84) | void loadSimpleIntGraphFromFile(SimpleIntGraph &bg, const char *fileNa...
type DegreeTag (line 89) | struct DegreeTag {
type NameTag (line 91) | struct NameTag {
function DegreeIncrementer (line 95) | void DegreeIncrementer(pair<N, V> &p) { ++p.second; }
function DegreeDecrementer (line 98) | void DegreeDecrementer(pair<N, V> &p) { --p.second; }
type state_flag (line 100) | enum state_flag {
type lsdkfj (line 103) | struct lsdkfj {
type state_flag (line 104) | enum state_flag
function sigUSR1_handler (line 108) | void sigUSR1_handler(int) {
function loadBloomGraphMMAP (line 123) | static void loadBloomGraphMMAP(bloomGraph<Name> &bg, const char *fileN...
function loadBloomGraphMMAPFastButFussy (line 315) | void loadBloomGraphMMAPFastButFussy(SimpleIntGraph &bg, const char *fi...
function findDistinctVertices (line 363) | void findDistinctVertices(RangeOfEdges<SimpleIntGraph::Name> roe, Simp...
function countDegrees (line 438) | void countDegrees(RangeOfEdges<SimpleIntGraph::Name> roe, SimpleIntGra...
function convertDegreesToOffsets (line 449) | void convertDegreesToOffsets(SimpleIntGraph &bg) {
function populateNameToIDHash (line 471) | static void populateNameToIDHash(SimpleIntGraph &bg) {
function populateNameToIDHash (line 487) | static void populateNameToIDHash(SimpleStringGraph &bg) {
function addNeighbour (line 504) | static void
function loadEdges (line 536) | void loadEdges(RangeOfEdges<SimpleIntGraph::Name> roe, SimpleIntGraph ...
function mmapFile (line 557) | pair<const char *, const char *> mmapFile(const char *fileName) {
FILE: Algorithms/2011-MOSES/src-refactor/util/graph/graph_loading.hpp
type graph_loading (line 5) | namespace graph_loading {
FILE: Algorithms/2011-MOSES/src-refactor/util/graph/graph_representation.cpp
function V (line 9) | V bloomGraph<int>::key_for_vertexName(int v) const {
function V (line 28) | V bloomGraph<string>::key_for_vertexName(string v) const {
function string (line 46) | string VertexNameToString(const int &l) {
FILE: Algorithms/2011-MOSES/src-refactor/util/graph/graph_representation.hpp
type bloomGraph (line 17) | struct bloomGraph
method bloomGraph (line 84) | explicit bloomGraph() : GraphWithoutNames() {}
method VertexNameType (line 91) | VertexNameType name_of_one_node(V v) const { return vertex_mappings.at...
method VertexNameType (line 93) | VertexNameType name(V v) const {
method string (line 100) | string name_of_one_node_asString(V v) const { return VertexNameToStrin...
function H (line 22) | H hash_integer( // This is used in populateHash and key_for_vertexName f...
function H (line 31) | H hash_integer( // This is used in populateHash and key_for_vertexName f...
type GraphWithoutNames (line 43) | struct GraphWithoutNames { // this is useful because it doesn't need the...
method V (line 44) | V vcount(void) const { return vertex_count; }
method V (line 46) | V ecount(void) const { return edge_count / 2; }
method V (line 47) | inline V degree(V v) const { return degrees.at(v); }
method neighbours (line 49) | pair<const VertexIDType *, const VertexIDType *>
method neighbours (line 56) | pair<VertexIDType *, VertexIDType *> neighbours(VertexIDType i) {
method are_connected (line 62) | bool are_connected(const V &v, const V &v2) const { return are_connect...
method are_connected (line 64) | bool are_connected(const EdgeType &e) const {
method GraphWithoutNames (line 71) | GraphWithoutNames(void) : vertex_count(0), edge_count(0) {}
type bloomGraph (line 81) | struct bloomGraph : public GraphWithoutNames {
method bloomGraph (line 84) | explicit bloomGraph() : GraphWithoutNames() {}
method VertexNameType (line 91) | VertexNameType name_of_one_node(V v) const { return vertex_mappings.at...
method VertexNameType (line 93) | VertexNameType name(V v) const {
method string (line 100) | string name_of_one_node_asString(V v) const { return VertexNameToStrin...
FILE: Algorithms/2011-MOSES/src-refactor/util/graph/iterative.hpp
type iterative (line 3) | namespace iterative {
type OneNode (line 12) | struct OneNode {
type PartitionStats (line 22) | struct PartitionStats {
type Partition (line 36) | struct Partition : public PartitionStats {
FILE: Algorithms/2011-MOSES/src-refactor/util/range.cpp
type amd (line 5) | namespace amd {
function rangeOverStream (line 7) | std::auto_ptr<range<std::string> > rangeOverStream(std::istream &_istr...
FILE: Algorithms/2011-MOSES/src-refactor/util/range.hpp
class IteratorRange (line 23) | class IteratorRange {
method IteratorRange (line 31) | IteratorRange(const Iterator &_begin, const Iterator &_end) : current(...
method IteratorRange (line 33) | IteratorRange(std::pair<Iterator, Iterator> be) : current(be.first), e...
method empty (line 35) | bool empty() const { return current == end; }
method Iterated (line 37) | Iterated &front() const { return *current; }
method Iterator (line 39) | Iterator frontIterator() const { return current; }
method popFront (line 41) | void popFront() { ++current; }
class ContainerProperties (line 45) | class ContainerProperties {
class ContainerRange (line 53) | class ContainerRange : public IteratorRange<typename ContainerProperties...
method ContainerRange (line 55) | ContainerRange(Container &c) : IteratorRange<typename ContainerPropert...
class RangeTypes (line 61) | class RangeTypes {
class ChainedRange (line 68) | class ChainedRange { // Chain Two together
method ChainedRange (line 72) | ChainedRange(const Range &_first, const Range &_second) : first(_first...
method empty (line 74) | bool empty() const { return first.empty() && second.empty(); }
method firstEmpty (line 76) | bool firstEmpty() const { return first.empty(); }
method front (line 78) | typename RangeTypes<Range>::ElementType front() const { return first.e...
method popFront (line 80) | void popFront() { if (first.empty()) second.popFront(); else first.pop...
type range (line 84) | struct range {
type RangeContainer (line 98) | struct RangeContainer
method RangeContainer (line 103) | explicit RangeContainer(Iterator first, Iterator last) : _current(firs...
method empty (line 106) | virtual bool empty() const { return _current == _last; }
method popFront (line 108) | virtual void popFront() { ++_current; }
method front (line 110) | virtual typename Iterator::reference front() const { return *_current; }
type amd (line 117) | namespace amd {
function mk_range (line 119) | std::auto_ptr<range<typename C::iterator::reference> > mk_range(C &c) {
function mk_range (line 125) | std::auto_ptr<range<typename C::const_iterator::reference> > mk_range(...
function mk_range_c (line 131) | std::auto_ptr<range<typename C::const_iterator::reference> > mk_range_...
function mk_reverse_range (line 137) | std::auto_ptr<range<typename C::reverse_iterator::reference> > mk_reve...
function mk_reverse_range (line 143) | std::auto_ptr<range<typename C::const_reverse_iterator::reference> > m...
class RangeOverStream (line 149) | class RangeOverStream : public range<std::string> {
class RangeMapper (line 170) | class RangeMapper : public range<typename boost::result_of<F(
method RangeMapper (line 179) | RangeMapper(const T &mapped_, F f_) : mapped(mapped_), f(f_) {}
method empty (line 181) | bool empty() const { return mapped.empty(); }
method popFront (line 183) | void popFront() { mapped.popFront(); }
method value_type (line 185) | value_type front() const {
function make_mapper_range (line 191) | RangeMapper<T, F> make_mapper_range(const T &m, F f) {
function map_range (line 197) | RangeMapper<T, F> map_range(const F &f, const T &m) {
class RangeFilter (line 202) | class RangeFilter : public range<typename R::value_type> {
method RangeFilter (line 208) | RangeFilter(const R &_r, const P &_p) : r(_r), p(_p) {
method empty (line 214) | virtual bool empty() const { return r.empty(); }
method popFront (line 216) | virtual void popFront() {
method value_type (line 222) | virtual value_type front() const {
function make_filter_range (line 228) | RangeFilter<R, P> make_filter_range(const R &r, const P &p) {
function filter (line 234) | RangeFilter<R, P> filter(const P &p, const R &r) {
function range_length (line 239) | int range_length(R r) {
class RangeEnum (line 249) | class RangeEnum : public range<I> {
method RangeEnum (line 252) | RangeEnum(I a_) : a(a_) {}
method empty (line 254) | virtual bool empty() const { return false; }
method I (line 256) | virtual I front() const { return a; }
method popFront (line 258) | virtual void popFront() { ++a; }
function make_counter_range (line 262) | RangeEnum<I> make_counter_range(I first) {
class RangeZipper (line 268) | class RangeZipper : public range<std::pair<
method RangeZipper (line 278) | RangeZipper(const L &l_, const R &r_) : l(l_), r(r_) {}
method empty (line 280) | virtual bool empty() const { return l.empty() || r.empty(); }
method value_type (line 282) | virtual value_type front() const { return std::make_pair(l.front(), ...
method popFront (line 284) | virtual void popFront() {
function zip (line 291) | RangeZipper<L, R> zip(const L &l, const R &r) {
class RangeChain (line 297) | class RangeChain : public range<typename L::value_type> {
method RangeChain (line 303) | RangeChain(const L &l_, const R &r_) : l(l_), r(r_) {}
method empty (line 305) | virtual bool empty() const { return l.empty() && r.empty(); }
method value_type (line 307) | virtual value_type front() const {
method popFront (line 314) | virtual void popFront() {
function chain (line 323) | RangeChain<L, R> chain(const L &l, const R &r) {
class auto_ptrWithPairedBool (line 345) | class auto_ptrWithPairedBool : public std::auto_ptr<Type> {
method auto_ptrWithPairedBool (line 347) | auto_ptrWithPairedBool(Type *p) : std::auto_ptr<Type>(p), interrupted(...
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/dir_weighted_tabdeg.h
type multimap (line 5) | typedef multimap<double, pair<int, double> > cup_data_struct;
function compare_r_variables (line 14) | double compare_r_variables(double a, double b, double c, double d) {
function right_error_function (line 47) | double right_error_function(double x) {
function log_together (line 53) | double log_together(double minus_log_total, int number) {
function fitted_exponent (line 86) | double fitted_exponent(int N) {
function order_statistics_left_cumulative (line 115) | inline double order_statistics_left_cumulative(int N, int pos, double x) {
function inverse_order_statistics (line 129) | double inverse_order_statistics(int sample_dim, int pos, const double &...
function pron_min_exp (line 171) | inline double pron_min_exp(int N, double xi) {
function compute_probability_to_stop (line 185) | inline double compute_probability_to_stop(const double & a, const double...
function equivalent_check (line 229) | bool equivalent_check(int pos_first, int pos_last, double & A_average, d...
function equivalent_check_gather (line 272) | bool equivalent_check_gather(cup_data_struct & a, int & until, const dou...
function hyper_table (line 327) | inline double hyper_table(int kin_node, int kout_g, int tm, int degree_n...
function compute_topologic_and_bootstrap_interval (line 332) | inline double compute_topologic_and_bootstrap_interval(int kin_node_out,...
function compute_global_fitness (line 362) | double compute_global_fitness(int kin_node_in, int kout_g_in, int kin_no...
function compute_topologic_step (line 492) | inline double compute_topologic_step(int kin_node_out, int kout_g_in, in...
function compute_global_fitness_step (line 511) | double compute_global_fitness_step(int kin_node_in, int kout_g_in, int k...
function compute_global_fitness_ofive (line 605) | inline double compute_global_fitness_ofive(int kin_node_in, int kout_g_i...
function compute_global_fitness_randomized (line 614) | inline double compute_global_fitness_randomized(int kin_node_in, int kou...
function compute_global_fitness_randomized_short (line 629) | double compute_global_fitness_randomized_short(int kin_node, int kout_g,...
function class (line 659) | class facts {
function class (line 706) | class weighted_tabdeg {
function clear (line 746) | void weighted_tabdeg::clear() {
function edinsert (line 756) | void weighted_tabdeg::edinsert(int a, int kpin, int kpout, int ktin, int...
function erase (line 772) | bool weighted_tabdeg::erase(int a) { // this function erases element a ...
function is_internal (line 793) | bool weighted_tabdeg::is_internal(int a) {
function set_deque (line 808) | void weighted_tabdeg::set_deque(deque<int> & vv) {
function print_nodes (line 818) | void weighted_tabdeg::print_nodes(ostream & outb) {
function worst_node (line 832) | int weighted_tabdeg::worst_node(int & lab, double & worst_fitness, int k...
function best_node (line 900) | int weighted_tabdeg::best_node(int & lab, double & best_fitness, int kou...
function _set_ (line 951) | void weighted_tabdeg::_set_(weighted_tabdeg & one) {
function update_group (line 967) | bool weighted_tabdeg::update_group(int a, int delta_degree_out, int delt...
function update_neighs (line 1030) | bool weighted_tabdeg::update_neighs(int a, int delta_deg_out, int delta_...
function set_and_update_group (line 1080) | void weighted_tabdeg::set_and_update_group(int nstar, int nn, int kout_g...
function set_and_update_neighs (line 1105) | void weighted_tabdeg::set_and_update_neighs(int nstar, int nn, int kout_...
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/directed_network.h
function class (line 13) | class static_network {
function clear (line 249) | void static_network::clear() {
function set_graph (line 272) | void static_network::set_graph(map<int, map<int, pair<int, double> > > &...
function set_oneM_etc (line 322) | void static_network::set_oneM_etc() {
function set_graph (line 370) | bool static_network::set_graph(string file_name) {
function set_graph (line 537) | void static_network::set_graph(deque<deque<int> > & link_per_node, deque...
function static_network (line 614) | int static_network::kin_m (const deque<int> & seq) {
function kin_m (line 678) | int static_network::kin_m(const set <int> &s) {
function draw_consecutive (line 695) | int static_network::draw_consecutive(string file_name1, string file_name...
function draw (line 743) | int static_network::draw(string file_name) {
function draw_with_weight_probability (line 791) | int static_network::draw_with_weight_probability(string file_name) {
function static_network (line 840) | void static_network::get_id_label (map <int, int> &a) {
function deque_id (line 848) | void static_network::deque_id(deque<int> & a) {
function print_id (line 856) | void static_network::print_id(const deque<int> & a, ostream & pout) {
function print_id (line 866) | void static_network::print_id(const set<int> & a, ostream & pout) {
function print_id (line 877) | void static_network::print_id(const deque<deque<int> > & a, ostream & po...
function print_id (line 886) | void static_network::print_id(const deque<set<int> > & a, ostream & pout) {
function translate (line 897) | int static_network::translate(deque<deque<int> > & ten) {
function translate (line 942) | int static_network::translate(deque<int> & ten) {
function set_subgraph (line 976) | void static_network::set_subgraph(deque<int> & group, deque<deque<int> >...
function set_proper_weights (line 1023) | void static_network::set_proper_weights() {
function set_connected_components (line 1079) | void static_network::set_connected_components(deque<deque<int> > & comps) {
function same_component (line 1116) | void static_network::same_component(int source, set<int> & already_gone) {
function propagate_distances (line 1156) | int static_network::propagate_distances(deque<int> & new_shell, set<int>...
function translate_anyway (line 1225) | int static_network::translate_anyway(deque<deque<int> > & ten) {
function set_upper_network (line 1265) | int static_network::set_upper_network(map<int, map<int, pair<int, double...
function print_degree_of_homeless (line 1369) | void static_network::print_degree_of_homeless(DI & homel, ostream & outt) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/directed_oslomnet_evaluate.h
function log_zero (line 4) | inline double log_zero(double a) {
function class (line 16) | class oslomnet_evaluate : public oslomnet_louvain {
function set_changendi_cum (line 86) | void oslomnet_evaluate::set_changendi_cum() {
function set_maxbord (line 117) | int oslomnet_evaluate::set_maxbord() {
function erase_cgroup (line 134) | void oslomnet_evaluate::erase_cgroup(int wnode) {
function erase_the_worst (line 219) | bool oslomnet_evaluate::erase_the_worst(int & wnode) {
function insert_cgroup (line 255) | void oslomnet_evaluate::insert_cgroup(int wnode) {
function set_cgroup_and_neighs (line 360) | void oslomnet_evaluate::set_cgroup_and_neighs(const deque<int> & G) {
function cup_on_list (line 381) | double oslomnet_evaluate::cup_on_list(cup_data_struct & a, deque<int> & ...
function all_external_test (line 523) | double oslomnet_evaluate::all_external_test(int kout_g_in, int tmin, int...
function initialize_for_evaluation (line 540) | void oslomnet_evaluate::initialize_for_evaluation(weighted_tabdeg & prev...
function initialize_for_evaluation (line 565) | void oslomnet_evaluate::initialize_for_evaluation(const deque<int> & _c_...
function partial_CUP (line 588) | double oslomnet_evaluate::partial_CUP(weighted_tabdeg & previous_tab_c, ...
function CUP_runs (line 656) | double oslomnet_evaluate::CUP_runs(weighted_tabdeg & previous_tab_c, wei...
function insert_the_best (line 823) | bool oslomnet_evaluate::insert_the_best() {
function insertion (line 849) | void oslomnet_evaluate::insertion(int changendi) {
function get_external_scores (line 953) | void oslomnet_evaluate::get_external_scores(weighted_tabdeg & neighs, cu...
function try_to_assign_homeless_help (line 1011) | int oslomnet_evaluate::try_to_assign_homeless_help(module_collection & m...
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/egocentric_undir.h
function class (line 5) | class egocentric_net : public oslomnet_louvain {
function collect_ego_groups_once (line 25) | int egocentric_net::collect_ego_groups_once(int_matrix & E) {
function add_this_egomodules (line 44) | int egocentric_net::add_this_egomodules(int node, module_collection & Me...
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/hierarchies.h
function manipulate_string (line 5) | bool manipulate_string(string s, string netfile, string & outs) {
function external_program_to_call (line 53) | void external_program_to_call(string network_file, oslom_net_global & ma...
function translate_covers (line 111) | void translate_covers(string previous_tp, string new_tp, string short_tp...
function no_singletons (line 172) | void no_singletons(char * directory_char, oslom_net_global & luca, modul...
function write_tp_of_this_level (line 218) | bool write_tp_of_this_level(int level, oslom_net_global & luca, char * d...
function oslom_level (line 359) | void oslom_level(oslom_net_global & luca, char * directory_char) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/log_table.h
function class (line 8) | class log_fact_table {
function _set_ (line 58) | void log_fact_table::_set_(int size) {
function cum_hyper_right (line 84) | double log_fact_table::cum_hyper_right(int kin_node, int kout_g, int tm,...
function cum_hyper_left (line 151) | double log_fact_table::cum_hyper_left(int kin_node, int kout_g, int tm, ...
function cum_binomial_right (line 222) | double log_fact_table::cum_binomial_right(int x, int N, double prob) {
function cum_binomial_left (line 281) | double log_fact_table::cum_binomial_left(int x, int N, double prob) {
function slow_symmetric_eq (line 334) | double log_fact_table::slow_symmetric_eq(int k1, int k2, int H, int x) {
function fast_right_cum_symmetric_eq (line 373) | inline double log_fact_table::fast_right_cum_symmetric_eq(int k1, int k2...
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/louvain_oslomnet.h
function class (line 6) | class oslom_module {
type map (line 26) | typedef map<int, pair<int, double> > mapip;
type map (line 27) | typedef map<int, oslom_module> map_int_om;
function prints (line 31) | void prints(map_int_om & M) {
function class (line 45) | class oslomnet_louvain : public static_network {
function module_initializing (line 89) | void oslomnet_louvain::module_initializing() {
function unweighted_favorite_of (line 110) | void oslomnet_louvain::unweighted_favorite_of(const int & node, int & fi...
function weighted_favorite_of (line 167) | void oslomnet_louvain::weighted_favorite_of(const int & node, int & fi, ...
function update_modules (line 241) | inline void oslomnet_louvain::update_modules(const int & i, const int & ...
function single_pass_unweighted (line 275) | void oslomnet_louvain::single_pass_unweighted() {
function single_pass_weighted (line 291) | void oslomnet_louvain::single_pass_weighted() {
function set_partition_collected (line 305) | void oslomnet_louvain::set_partition_collected(deque<deque<int> > & ten2) {
function collect_raw_groups_once (line 361) | int oslomnet_louvain::collect_raw_groups_once(deque<deque<int> > & P) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/louvain_oslomnet_dir.h
function class (line 6) | class oslom_module {
function class (line 25) | class internal_links_weights {
type map (line 45) | typedef map<int, internal_links_weights> mapip;
type map (line 46) | typedef map<int, oslom_module> map_int_om;
function int_histogram (line 50) | void int_histogram(const int & c, mapip & hist, const int & w1, const d...
function prints (line 75) | void prints(map_int_om & M) {
function class (line 89) | class oslomnet_louvain : public static_network {
function module_initializing (line 133) | void oslomnet_louvain::module_initializing() {
function unweighted_favorite_of (line 153) | void oslomnet_louvain::unweighted_favorite_of(const int & node, int & fi...
function weighted_favorite_of (line 224) | void oslomnet_louvain::weighted_favorite_of(const int & node, int & fi, ...
function update_modules (line 294) | inline void oslomnet_louvain::update_modules(const int & i, const int & ...
function single_pass_unweighted (line 343) | void oslomnet_louvain::single_pass_unweighted() {
function single_pass_weighted (line 359) | void oslomnet_louvain::single_pass_weighted() {
function set_partition_collected (line 373) | void oslomnet_louvain::set_partition_collected(deque<deque<int> > & ten2) {
function collect_raw_groups_once (line 428) | int oslomnet_louvain::collect_raw_groups_once(deque<deque<int> > & P) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/main_body.cpp
function main (line 9) | int main(int argc, char * argv[]) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/main_directed.cpp
function program_statement (line 76) | void program_statement(char * b) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/main_undirected.cpp
function program_statement (line 105) | void program_statement(char * b) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/module_collection.h
function class (line 7) | class module_collection {
function _set_ (line 68) | void module_collection::_set_(int dim) {
function insert (line 82) | bool module_collection::insert(deque<int> & c, double bs) {
function insert (line 93) | bool module_collection::insert(deque<int> & c, double bs, int & new_name) {
function erase (line 126) | bool module_collection::erase(int a) {
function print (line 160) | void module_collection::print(ostream & outt, deque<int> & netlabels, bo...
function fill_gaps (line 199) | void module_collection::fill_gaps() {
function put_gaps (line 215) | void module_collection::put_gaps() {
function homeless (line 238) | void module_collection::homeless(deque<int> & h) {
function coverage (line 260) | int module_collection::coverage() {
function effective_groups (line 279) | int module_collection::effective_groups() {
function set_partition (line 298) | void module_collection::set_partition(deque<deque<int> > & A) {
function set_partition (line 307) | void module_collection::set_partition(deque<deque<int> > & A, deque<doub...
function check_already (line 329) | bool module_collection::check_already(const deque<int> & c) {
function compute_inclusions (line 365) | void module_collection::compute_inclusions() {
function erase_included (line 375) | void module_collection::erase_included() {
function erase_first_shell (line 402) | bool module_collection::erase_first_shell(map<int, deque<int> > & erase_...
function almost_equal (line 459) | bool module_collection::almost_equal(int module_id, deque<int> & smaller) {
function compact (line 503) | void module_collection::compact() {
function sort_modules (line 550) | void module_collection::sort_modules(deque<int> & module_order) {
function egomodules_to_merge (line 572) | bool module_collection::egomodules_to_merge(deque<int> & egom, deque<int...
function merge (line 609) | void module_collection::merge(DI & c) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/oslom_net_global.h
function class (line 5) | class oslom_net_global : public oslomnet_evaluate {
function try_to_merge_discarded (line 83) | int oslom_net_global::try_to_merge_discarded(int_matrix & discarded, int...
function get_single_trial_partition (line 152) | void oslom_net_global::get_single_trial_partition(int_matrix & good_modu...
function from_matrix_to_module_collection (line 251) | void oslom_net_global::from_matrix_to_module_collection(int_matrix & goo...
function get_cover (line 271) | void oslom_net_global::get_cover(module_collection & minimal_modules) {
function check_minimality_all (line 296) | void oslom_net_global::check_minimality_all(int_matrix & A, DD & bss, mo...
function check_minimality_matrix (line 344) | void oslom_net_global::check_minimality_matrix(int_matrix & A, DD & bss,...
function check_minimality (line 372) | bool oslom_net_global::check_minimality(deque<int> & group, double & bs_...
function print_modules (line 445) | void oslom_net_global::print_modules(bool not_homeless, string tp, modul...
function print_modules (line 461) | void oslom_net_global::print_modules(bool not_homeless, ostream & out1, ...
function load (line 484) | void oslom_net_global::load(string filename, module_collection & Mall) {
function get_covers (line 515) | void oslom_net_global::get_covers(string cover_file, int & soft_partitio...
function ultimate_cover (line 570) | void oslom_net_global::ultimate_cover(string cover_file, int soft_partit...
function hint (line 614) | void oslom_net_global::hint(module_collection & minimal_modules, string ...
function print_statistics (line 661) | void oslom_net_global::print_statistics(ostream & outt, module_collectio...
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/oslom_net_unions.cpp
function from_int_matrix_and_deque_to_deque (line 3) | void from_int_matrix_and_deque_to_deque(int_matrix & its_submodules, con...
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/set_parameters.h
function general_program_statement (line 13) | void general_program_statement(char * b) {
function error_statement (line 67) | void error_statement(char * b) {
function class (line 81) | class Parameters {
function print (line 161) | void Parameters::print() {
function set_flag_and_number (line 207) | bool Parameters::set_flag_and_number(double & number_to_set, int & argct...
function set_flag_and_number (line 239) | bool Parameters::set_flag_and_number(int & number_to_set, int & argct, i...
function set_flag_and_number_external_program (line 360) | bool Parameters::set_flag_and_number_external_program(string program_nam...
function _set_ (line 410) | bool Parameters::_set_(int argc, char * argv[]) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/cast.cpp
function cast_string_to_double (line 142) | double cast_string_to_double(string &b) {
function cast_int (line 152) | inline int cast_int(double u) {
function cast_string_to_char (line 159) | int cast_string_to_char(string file_name, char *b) {
function cast_string_to_doubles (line 171) | bool cast_string_to_doubles(string &b, deque<double> & v) {
function cast_string_to_doubles (line 218) | bool cast_string_to_doubles(string &b, deque<int> & v) {
function separate_strings (line 235) | bool separate_strings(string &b, deque<string> & v) {
function approx (line 281) | double approx(double a, int digits) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/combinatorics.cpp
function average_func (line 8) | double average_func(Seq &sq) {
function variance_func (line 27) | double variance_func(Seq &sq) {
function average_pf (line 61) | double average_pf(Seq &sq) {
function variance_pf (line 83) | double variance_pf(Seq &sq) {
function log_factorial (line 116) | double log_factorial (int num) {
function log_combination (line 130) | double log_combination (int n, int k) {
function binomial (line 153) | double binomial(int n, int x, double p) { // returns the binomial distr...
function binomial_cumulative (line 193) | int binomial_cumulative(int n, double p, deque<double> &cum) {
function powerlaw (line 217) | int powerlaw (int n, int min, double tau, deque<double> &cumulative) {
function distribution_from_cumulative (line 240) | int distribution_from_cumulative(const deque<double> &cum, deque<double>...
function cumulative_from_distribution (line 257) | int cumulative_from_distribution (deque<double> &cum, const deque<double...
function poisson (line 273) | double poisson (int x, double mu) {
function shuffle_and_set (line 283) | int shuffle_and_set(int *due, int dim) { // it sets due as a random seq...
function shuffle_s (line 304) | int shuffle_s(deque<T> &sq) {
function shuffle_s (line 332) | int shuffle_s(type_ *a, int b) {
function compute_r (line 360) | double compute_r(int x, int k, int kout, int m) {
function add_factors (line 375) | int add_factors (deque<double> & num, deque<double> &den, int n, int k) {
function compute_hypergeometric (line 406) | double compute_hypergeometric(int i, int k, int kout, int m) {
function random_from_set (line 475) | int random_from_set(set<int> & s) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/deque_numeric.cpp
function Euclidean_norm (line 23) | double Euclidean_norm(const deque<double> & a) {
function Euclidean_normalize (line 38) | int Euclidean_normalize(deque<double> & a) {
function scalar_product (line 53) | double scalar_product(deque<double> & a, deque<double> & b) {
function orthogonalize (line 77) | int orthogonalize(deque<double> & a, deque<deque<double> > & M) {
function matrix_time_vector (line 103) | int matrix_time_vector(deque<deque<double> > & Q, deque<double> & v, deq...
function set_to_deque (line 126) | void set_to_deque(const set<int> & s, deque<int> & a) {
function set_to_deque (line 136) | void set_to_deque(const set<double> & s, deque<double> & a) {
function deque_to_set (line 146) | void deque_to_set(const deque<double> & a, set<double> & s) {
function deque_to_set (line 156) | void deque_to_set(const deque<int> & a, set<int> & s) {
function deque_to_set_app (line 168) | void deque_to_set_app(const deque<int> & a, set<int> & s) {
function norm_one (line 180) | double norm_one(const deque<double> & a) {
function normalize_one (line 195) | int normalize_one(deque<double> & a) {
function jaccard (line 210) | double jaccard(set<int> & a1, set<int> & a2) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/histograms.cpp
function intlog_binning (line 14) | int intlog_binning(deque<int> c, int number_of_bins, deque<double> & Xs,...
function xybinning (line 139) | int xybinning(deque<type> &c, deque<type> &d, int number_of_bins, deque<...
function xybinning (line 265) | int xybinning(deque<type> &c, deque<type> &d, int number_of_bins, deque<...
function compute_quantiles (line 275) | void compute_quantiles(double q, deque<double> & y, deque<double> & qs) {
function xybinning_quantiles (line 301) | int xybinning_quantiles(deque<type> &c, deque<type> &d, int number_of_bi...
function log_histogram (line 428) | int log_histogram(deque<type> &c, ostream & out, int number_of_bins) { ...
function log_histogram (line 525) | int log_histogram(deque<double> &c, deque<double> &c2, ostream & out, in...
function histogram (line 620) | int histogram (vector <type> &c, ostream & out, int number_of_bins, doub...
function not_norm_histogram_correlated (line 721) | int not_norm_histogram_correlated (deque<type> &c, deque<type> &d, ostre...
function histogram (line 824) | int histogram (deque <type> &c, ostream & out, int number_of_bins, doubl...
function not_norm_histogram (line 925) | int not_norm_histogram (vector<type> &c, ostream & out, int number_of_bi...
function not_norm_histogram (line 1025) | int not_norm_histogram (deque<type> &c, ostream & out, int number_of_bin...
function histogram (line 1123) | int histogram (deque<double> &c, deque<double> &c2, ostream & out, int n...
function not_norm_histogram (line 1225) | int not_norm_histogram (deque<double> &c, deque<double> &c2, ostream & o...
function int_histogram (line 1326) | void int_histogram (vector <int> &c, ostream & out) {
function int_histogram (line 1355) | void int_histogram (deque <int> &c, ostream & out) {
function int_histogram (line 1384) | void int_histogram(int c, map<int, int> & hist) {
function int_histogram (line 1399) | void int_histogram(int c, map<int, double> & hist, double w) {
function print_cumulative (line 1414) | int print_cumulative (deque<double> & kws, string file, int number_of_st...
function print_cumulative (line 1440) | int print_cumulative (deque<int> & kws, string file, int number_of_step) {
function print_cumulative (line 1466) | int print_cumulative (vector<double> & kws, string file, int number_of_s...
function print_cumulative (line 1493) | int print_cumulative (vector<int> & kws, string file, int number_of_step) {
function int_histogram (line 1523) | void int_histogram(string infile, string outfile) {
function int_histogram (line 1550) | void int_histogram(int c, map<int, int> & hist, int w) {
function int_histogram (line 1567) | void int_histogram(const int & c, map<int, pair<int, double> > & hist, ...
function int_histogram (line 1586) | void int_histogram(int c, map<int, pair<double, double> > & hist, double...
function int_histogram (line 1604) | void int_histogram(int c, map<int, pair<int, int> > & hist, int w1, int ...
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/mutual.cpp
function mutual (line 40) | double mutual (deque<deque<int> > en, deque<deque<int> > ten) {
function H (line 189) | double H(double a) {
function H (line 200) | double H(deque <double> &p) {
function H_x_given_y (line 212) | double H_x_given_y(deque<deque<int> > &en, deque<deque<int> > &ten, int ...
function mutual2 (line 322) | double mutual2(deque<deque<int> > en, deque<deque<int> > ten) {
function H_x_given_y3 (line 413) | double H_x_given_y3(deque<deque<int> > &en, deque<deque<int> > &ten, int...
function mutual3 (line 541) | double mutual3(deque<deque<int> > en, deque<deque<int> > ten) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/pajek.cpp
function number_together (line 4) | int number_together(deque<int> & a) {
function get_partition_from_file_list_pajek (line 36) | int get_partition_from_file_list_pajek(string s, deque<deque<int> > & te...
function set_partition_from_list (line 90) | void set_partition_from_list(deque<int> & mems, deque<deque<int> > & ten) {
function get_partition_from_file_list_pajek_tree (line 129) | int get_partition_from_file_list_pajek_tree(string s, deque<deque<deque<...
function pajek_format (line 228) | int pajek_format(string filename, bool directed) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/partition.cpp
function get_partition_from_file_tp_format_with_homeless (line 51) | int get_partition_from_file_tp_format_with_homeless(string S, deque<dequ...
function get_partition_from_file_tp_format (line 95) | int get_partition_from_file_tp_format(string S, map<int, deque<int> > & ...
function get_partition_from_file_tp_format (line 137) | int get_partition_from_file_tp_format(string S, deque<deque<int> > & M, ...
function get_partition_from_file_tp_format (line 198) | int get_partition_from_file_tp_format(string S, deque<deque<int> > & M, ...
function get_partition_from_file_tp_format (line 236) | int get_partition_from_file_tp_format(string S, deque<deque<int> > & M) {
function get_partition_from_file (line 242) | int get_partition_from_file(string s, deque<deque<int> > & M, int min) {
function get_partition_from_file (line 271) | int get_partition_from_file(string s, deque<deque<int> > & M) {
function get_partition_from_file_list (line 277) | int get_partition_from_file_list(string s, deque<deque<int> > & ten) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/print.cpp
function cherr (line 15) | void cherr(double a) {
function cherr (line 24) | void cherr(double a, double ee) {
function prints (line 38) | void prints(pair <uno, due> &sq, ostream &out) {
function prints (line 46) | void prints(pair <uno, due> &sq) {
function prints (line 54) | void prints(map <uno, due> &sq, ostream &out) {
function prints (line 67) | void prints(multimap <uno, due> &sq, ostream &out) {
function prints (line 82) | void prints(Seq &sq, ostream &out) {
function prints (line 94) | void prints(type_ *a, int b) {
function printm (line 105) | void printm(C<T>& c, ostream &out) {
function prints (line 120) | void prints(map <uno, due> &sq) {
function prints (line 133) | void prints(multimap <uno, due> &sq) {
function prints (line 147) | void prints(deque<uno> & a, deque<due> &b) {
function prints (line 155) | void prints(deque<uno> & a, deque<due> &b, ostream &out) {
function prints (line 164) | void prints(Seq &sq) {
function prints (line 177) | void prints(const deque<type> & sq) {
function prints (line 187) | void prints(const vector<type> & sq) {
function printm (line 200) | void printm(deque<type> & M) {
function printm (line 210) | void printm(vector<type> & M) {
function get_data_from_file (line 223) | void get_data_from_file(string s, deque<type> & a1, int col) {
function get_data_from_file (line 255) | void get_data_from_file(string s, deque<type> & a1) {
function get_data_from_file (line 264) | void get_data_from_file(string s, deque<type> & a1, deque<type> & a2, in...
function get_data_from_file (line 301) | void get_data_from_file(string s, deque<type> & a1, deque<type> & a2) {
function get_data_from_file_string (line 311) | void get_data_from_file_string(string s, deque<string> & a1, int col) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/random.cpp
function ran2 (line 24) | double ran2(long *idum) {
function ran4 (line 60) | double ran4(bool t, long s) {
function ran4 (line 77) | double ran4() {
function srand4 (line 83) | void srand4(void) {
function srand5 (line 92) | void srand5(int rank) {
function irand (line 101) | int irand(int n) {
function srand_file (line 108) | void srand_file(void) {
function configuration_model (line 132) | int configuration_model(deque<set<int> > & en, deque<int> & degrees) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/standard_package/tabdeg.cpp
class tabdeg (line 23) | class tabdeg {
method tabdeg (line 28) | tabdeg(){}
method size (line 35) | int size() {return nodes_indeg.size();}
function main (line 155) | int main() {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/undir_weighted_tabdeg.h
type multimap (line 6) | typedef multimap<double, pair<int, double> > cup_data_struct;
function compare_r_variables (line 15) | double compare_r_variables(double a, double b, double c, double d) {
function right_error_function (line 48) | double right_error_function(double x) {
function log_together (line 56) | double log_together(double minus_log_total, int number) {
function fitted_exponent (line 89) | double fitted_exponent(int N) {
function order_statistics_left_cumulative (line 118) | inline double order_statistics_left_cumulative(int N, int pos, double x) {
function inverse_order_statistics (line 132) | double inverse_order_statistics(int sample_dim, int pos, const double &...
function pron_min_exp (line 174) | inline double pron_min_exp(int N, double xi) {
function compute_probability_to_stop (line 188) | inline double compute_probability_to_stop(const double & a, const double...
function equivalent_check (line 206) | bool equivalent_check(int pos_first, int pos_last, double & A_average, d...
function equivalent_check_gather (line 249) | bool equivalent_check_gather(cup_data_struct & a, int & until, const dou...
function hyper_table (line 302) | inline double hyper_table(int kin_node, int kout_g, int tm, int degree_n...
function topological_05 (line 314) | inline double topological_05(int kin_node, int kout_g, int tm, int degre...
function compute_global_fitness (line 322) | double compute_global_fitness(int kin_node, int kout_g, int tm, int degr...
function compute_global_fitness_step (line 392) | double compute_global_fitness_step(int kin_node, int kout_g, int tm, int...
function compute_global_fitness_ofive (line 416) | inline double compute_global_fitness_ofive(int kin_node, int kout_g, int...
function compute_global_fitness_randomized (line 423) | inline double compute_global_fitness_randomized(int kin_node, int kout_g...
function compute_global_fitness_randomized_short (line 431) | double compute_global_fitness_randomized_short(int kin_node, int kout_g,...
function class (line 461) | class facts {
function class (line 481) | class weighted_tabdeg {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/undirected_network.h
function class (line 13) | class static_network {
function kplus_global_and_quick (line 139) | void static_network::vertex::kplus_global_and_quick(deque<int> & a, int ...
function kplus_m (line 173) | int static_network::vertex::kplus_m(const deque<int> &a) {
function kplus_w (line 192) | double static_network::vertex::kplus_w(const deque<int> &a) {
function kplus_m (line 214) | int static_network::vertex::kplus_m(const set<int> &a) {
function clear (line 242) | void static_network::clear() {
function set_graph (line 265) | void static_network::set_graph(map<int, map<int, pair<int, double> > > &...
function set_graph (line 314) | bool static_network::set_graph(string file_name) {
function set_graph (line 547) | void static_network::set_graph(deque<deque<int> > & link_per_node, deque...
function static_network (line 631) | int static_network::kin_m (const deque<int> & seq) {
function static_network (line 654) | int static_network::ktot_m (const deque<int> &seq) {
function ktot_m (line 664) | int static_network::ktot_m(const set <int> &s) {
function kin_m (line 677) | int static_network::kin_m(const set <int> &s) {
function draw (line 693) | int static_network::draw(string file_name) {
function static_network (line 732) | void static_network::get_id_label (map <int, int> &a) {
function deque_id (line 740) | void static_network::deque_id(deque<int> & a) {
function print_id (line 748) | void static_network::print_id(const deque<int> & a, ostream & pout) {
function print_id (line 758) | void static_network::print_id(const set<int> & a, ostream & pout) {
function print_id (line 769) | void static_network::print_id(const deque<deque<int> > & a, ostream & po...
function print_id (line 778) | void static_network::print_id(const deque<set<int> > & a, ostream & pout) {
function translate_anyway (line 790) | int static_network::translate_anyway(deque<deque<int> > & ten) {
function translate (line 826) | int static_network::translate(deque<deque<int> > & ten) {
function set_subgraph (line 870) | void static_network::set_subgraph(deque<int> & group, deque<deque<int> >...
function set_proper_weights (line 917) | void static_network::set_proper_weights() {
function set_connected_components (line 963) | void static_network::set_connected_components(deque<deque<int> > & comps) {
function same_component (line 999) | void static_network::same_component(int source, set<int> & already_gone) {
function propagate_distances (line 1030) | int static_network::propagate_distances(deque<int> & new_shell, set<int>...
function draw_consecutive (line 1092) | int static_network::draw_consecutive(string file_name1, string file_name...
function set_upper_network (line 1132) | int static_network::set_upper_network(map<int, map<int, pair<int, double...
function draw_with_weight_probability (line 1218) | int static_network::draw_with_weight_probability(string file_name) {
function print_degree_of_homeless (line 1252) | void static_network::print_degree_of_homeless(DI & homel, ostream & outt) {
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/undirected_oslomnet_evaluate.h
function log_zero (line 4) | inline double log_zero(double a) {
function class (line 16) | class oslomnet_evaluate : public oslomnet_louvain {
function set_changendi_cum (line 83) | void oslomnet_evaluate::set_changendi_cum() {
function set_maxbord (line 113) | int oslomnet_evaluate::set_maxbord() {
function erase_cgroup (line 126) | void oslomnet_evaluate::erase_cgroup(int wnode) {
function erase_the_worst (line 169) | bool oslomnet_evaluate::erase_the_worst(int & wnode) {
function insert_cgroup (line 201) | void oslomnet_evaluate::insert_cgroup(int wnode) {
function set_cgroup_and_neighs (line 264) | void oslomnet_evaluate::set_cgroup_and_neighs(const deque<int> & G) {
function cup_on_list (line 285) | double oslomnet_evaluate::cup_on_list(cup_data_struct & a, deque<int> & ...
function all_external_test (line 427) | double oslomnet_evaluate::all_external_test(int kout_g, int tm, int Nsta...
function initialize_for_evaluation (line 443) | void oslomnet_evaluate::initialize_for_evaluation(weighted_tabdeg & prev...
function initialize_for_evaluation (line 462) | void oslomnet_evaluate::initialize_for_evaluation(const deque<int> & _c_...
function partial_CUP (line 481) | double oslomnet_evaluate::partial_CUP(weighted_tabdeg & previous_tab_c, ...
function CUP_runs (line 522) | double oslomnet_evaluate::CUP_runs(weighted_tabdeg & previous_tab_c, wei...
function insert_the_best (line 677) | bool oslomnet_evaluate::insert_the_best() {
function insertion (line 700) | void oslomnet_evaluate::insertion(int changendi) {
function get_external_scores (line 787) | void oslomnet_evaluate::get_external_scores(weighted_tabdeg& neighs, cup...
FILE: Algorithms/2011-OSLOM-v2/Sources_2_5/OSLOM_files/wsarray.h
function class (line 17) | class wsarray {
function find (line 88) | int wsarray::find(int a) {
function push_back (line 128) | void wsarray::push_back(int a, int bb, double b) {
function freeze (line 139) | void wsarray::freeze() {
function prints (line 195) | void prints(wsarray &a) {
function prints (line 207) | void prints(wsarray &a, ostream & pout) {
function prints (line 219) | void prints(wsarray *a, ostream & pout) {
function prints (line
Copy disabled (too large)
Download .json
Condensed preview — 2675 files, each showing path, character count, and a content snippet. Download the .json file for the full structured content (51,690K chars).
[
{
"path": ".gitignore",
"chars": 197,
"preview": "# jetbrains config\n.idea\ncmake-build-debug\n*.iml\n\n*.log\n*.aux\n*.gz\n\n#maven build\ntarget\n\n# src_cpp_matlab-python files\n*"
},
{
"path": ".gitmodules",
"chars": 417,
"preview": "[submodule \"SubModules/igraph\"]\n\tpath = SubModules/igraph\n\turl = git@github.com:igraph/igraph.git\n[submodule \"SubModules"
},
{
"path": "Algorithms/2008-CliquePercolation/ReadMe.md",
"chars": 842,
"preview": "# Clique Percolation\n## Description\n\nThe sequential clique percolation algorithm is method for detecting clique percolat"
},
{
"path": "Algorithms/2008-CliquePercolation/algorithm_example.py",
"chars": 337,
"preview": "import networkx as nx\n\nfrom conradlee_clique_percolation import *\n\nif __name__ == '__main__':\n with open('example_edg"
},
{
"path": "Algorithms/2008-CliquePercolation/conradlee_clique_percolation.py",
"chars": 1352,
"preview": "import networkx as nx\nfrom collections import defaultdict\n\n\ndef get_percolated_cliques(G, k):\n percolation_graph = nx"
},
{
"path": "Algorithms/2008-CliquePercolation/example_edge_list.txt",
"chars": 35,
"preview": "1 2\n1 3\n2 3\n3 4\n4 5\n4 7\n5 7\n5 6\n6 7"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/CMakeLists.txt",
"chars": 727,
"preview": "cmake_minimum_required(VERSION 2.8)\nproject(2008-clique-percolation)\nset(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} -std=c++14 "
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/ReadMe.md",
"chars": 20,
"preview": "## Issues\n\nall fixed"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/cliqueHash.cpp",
"chars": 5756,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/cliqueHash.h",
"chars": 1724,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/communityTracker.cpp",
"chars": 7208,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/communityTracker.h",
"chars": 1750,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/dendrogram.cpp",
"chars": 2778,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/dendrogram.h",
"chars": 2358,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/doc/License.txt",
"chars": 18326,
"preview": "\t\t GNU GENERAL PUBLIC LICENSE\r\n\t\t Version 2, June 1991\r\n\r\n Copyright (C) 1989, 1991 Free Software Foundation, I"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/doc/makefile",
"chars": 139,
"preview": "all:\n\tg++ k_clique.cpp dendrogram.cpp nodeCommunities.cpp weighedClique.cpp cliqueHash.cpp communityTracker.cpp kruskal."
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/k_clique.cpp",
"chars": 18578,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/k_clique.h",
"chars": 3077,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/kruskal.cpp",
"chars": 2676,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/kruskal.h",
"chars": 1717,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/nodeCommunities.cpp",
"chars": 2440,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/nodeCommunities.h",
"chars": 1764,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/script/testScp.py",
"chars": 1824,
"preview": "import os\n\nexecutable = \"../k_clique\"\ntempDir = \"../\"\ntestDataDir = \"../testData/\"\n\n\ndef listComp(l1, l2):\n if len(l1"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/testData/random_1000_005.edg",
"chars": 294026,
"preview": "0\t471\t1.0\n0\t162\t1.0\n0\t306\t1.0\n0\t340\t1.0\n0\t264\t1.0\n0\t374\t1.0\n0\t429\t1.0\n0\t654\t1.0\n0\t290\t1.0\n0\t434\t1.0\n0\t468\t1.0\n0\t874\t1.0\n"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/testData/random_1000_005.edg_files/k=3/communities",
"chars": 4036,
"preview": "0: 0 137 148 162 213 240 264 27 290 297 306 318 329 340 372 374 40 429 434 443 454 467 468 471 477 5 501 585 597 626 630"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/testData/random_1000_005.edg_files/k=4/communities",
"chars": 11065,
"preview": "0: 361 852 358 640 632 \n1: 752 282 724 590 143 \n2: 335 957 665 698 \n3: 112 395 453 941 \n4: 788 809 71 475 \n5: 582 110 96"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/testData/random_1000_005.edg_files/k=5/communities",
"chars": 21,
"preview": "0: 274 964 34 633 4 \n"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/weighedClique.cpp",
"chars": 7687,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_cpp/weighedClique.h",
"chars": 2889,
"preview": "/*\nscp, The sequential clique percolation algorithm.\nCopyright (C) 2011 Aalto University\n\nThis program is free software"
},
{
"path": "Algorithms/2008-CliquePercolation/src_python/seq_clique_percolation.py",
"chars": 26799,
"preview": "\"\"\"\nAn agglomerative k-clique percolation algorithm.\nThis script is divided to parts as follows:\n*networking framework: "
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/.gitignore",
"chars": 21,
"preview": "*.so\n*.o\n.idea/*\ncis\n"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/ReadMe.md",
"chars": 289,
"preview": "# Connected Iterative Scan\n## Source Codes\n\ncontent | detail\n--- | ---\n[src-original](src-original) | original c++ codes"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Files/IOX.cc",
"chars": 2577,
"preview": "#include \"IOX.h\"\n\n/**\n * @fn bool fline_tr(ifstream* fin, vector <string> fields, string delim)\n\n * Retrieve a line from"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Files/IOX.h",
"chars": 412,
"preview": "#ifndef ICE_IOX\n#define ICE_IOX\n\n#include \"StringEx.h\"\n#include <string>\n#include <iostream>\n#include <vector>\n#include "
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Files/StringEx.cc",
"chars": 1568,
"preview": "\n/**\n * @fn const std::string trim (const std::string& pString, const std::string& pWhitespace)\n * Remove beginning and "
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Files/StringEx.h",
"chars": 870,
"preview": "#ifndef ICE_STR\n#define ICE_STR\n\n#include <string>\n#include <cstring>\n#include <sstream>\n\nusing namespace std;\n\nconst st"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Files/files.cc",
"chars": 41,
"preview": "#include \"IOX.cc\"\n#include \"StringEx.cc\"\n"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Files/makefile",
"chars": 121,
"preview": "files: IOX.cc IOX.h StringEx.cc StringEx.h files.cc\n\tg++ -fpic -c files.cc -std=c++11\n\tg++ -shared -o libfiles.so files."
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/Format.cc",
"chars": 3357,
"preview": "#include \"Format.h\"\n\nusing namespace std;\n\n/**\n *@fn void ChangeDelimiter ( const string& filein, const string& fileout,"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/Format.h",
"chars": 1038,
"preview": "#include \"../Files/IOX.h\"\n#include <vector>\n#include <map>\n\nusing namespace std;\n\n/**\n *@fn void ChangeDelimiter ( const"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/LibNetwork.cc",
"chars": 52,
"preview": "#include \"TemporalNetwork.cc\"\n#include \"Network.cc\"\n"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/Network.cc",
"chars": 4617,
"preview": "#include \"Network.h\"\n\n/**\n *@fn void AddEdge( shared_ptr < string > fr, shared_ptr < string > to, const double& weight, "
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/Network.h",
"chars": 1734,
"preview": "#ifndef RPI_NETWORK\n#define RPI_NETWORK\n\n#include <map>\n#include <memory>\n\nusing namespace std;\n\nstruct cmp_str_ptr{\n b"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/RandomNetwork.h",
"chars": 448,
"preview": "#ifndef RNET_RPI\n#define RNET_RPI\n\n#include \"Network.h\"\n#include \"../Random/PowerLaw.h\"\n\nvoid RandomNetwork ( const int&"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/TemporalNetwork.cc",
"chars": 2937,
"preview": "#include \"TemporalNetwork.h\"\n\n/**\n *@fn TemporalNetwork::AddNetwork ( const string& filename, const string& delimiters )"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/TemporalNetwork.h",
"chars": 1392,
"preview": "#ifndef RPI_TEMPORAL_NETWORK\n#define RPI_TEMPORAL_NETWORK\n\n#include <set>\n#include <map>\n#include <iostream>\n#include <v"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Network/makefile",
"chars": 289,
"preview": "all: format network\n\nformat: Format.cc\n\tg++ -fpic -c Format.cc -o Format.o -std=c++11\n\tg++ -shared -o libFormat.so Forma"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Params/Parameters.cc",
"chars": 3133,
"preview": "/**\n* Implementation of the parameters class\n*/\n#include \"Parameters.h\"\n\n/**\n * @fn void Parameters::Read(int argc, char"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Params/Parameters.h",
"chars": 2250,
"preview": "/**\n* Class to help read in multiple command line (flagged) parameters\n*\n*\tTO DO:\n* \t\tError Messages\n*/\n\n#ifndef ICE_PAR"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/Libraries/Params/makefile",
"chars": 141,
"preview": "params: Parameters.h Parameters.cc\n\tg++ -fpic -c Parameters.cc -o Params.o -std=c++11\n\tg++ -shared Params.o ../Files/fil"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/ReadMe.md",
"chars": 1927,
"preview": "#Connected Iterative Scan \nConnected Iterative Scan is also known at times as Locally Optimal Sets.\n\n##Building\nTo make "
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/demo/karate_edges_input_modified.csv",
"chars": 563,
"preview": "2|1|1\n3|1|1\n3|2|1\n4|1|1\n4|2|1\n4|3|1\n5|1|1\n6|1|1\n7|1|1\n7|5|1\n7|6|1\n8|1|1\n8|2|1\n8|3|1\n8|4|1\n9|1|1\n9|3|1\n10|3|1\n11|1|1\n11|5"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/demo/karate_output.csv",
"chars": 217,
"preview": "25|26|29|32\n11|17|5|6|7\n24|25|26|28|29|32\n1|10|12|13|14|18|2|20|22|3|31|4|8|9\n10|15|16|19|21|23|24|27|28|30|31|33|34|9\n1"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/demo/network.cl",
"chars": 14,
"preview": "1|2|3\n3|4|5|6\n"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/demo/network_seeded.cl",
"chars": 8,
"preview": "3|4|5|6\n"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/main.cc",
"chars": 15800,
"preview": "#include <algorithm>\n#include <limits>\n\n#include \"Libraries/Network/TemporalNetwork.h\"\n#include \"Libraries/Params/Parame"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-orginal/makefile",
"chars": 387,
"preview": "all:\n\tcd Libraries/Files; make;\n\tcd Libraries/Params; make;\n\tcd Libraries/Network; make;\n\tmake cis\n\ncis: main.cc \n\tg++ m"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/CMakeLists.txt",
"chars": 750,
"preview": "cmake_minimum_required(VERSION 2.8)\nproject(2009-cis)\nset(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} -std=c++14 -O3 -g\")\n\nfind_"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/ReadMe.md",
"chars": 436,
"preview": "#Connected Iterative Scan \nConnected Iterative Scan is also known at times as Locally Optimal Sets.\n\n\n##File Organizatio"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/dataset/karate_edges_input_modified.csv",
"chars": 563,
"preview": "2|1|1\n3|1|1\n3|2|1\n4|1|1\n4|2|1\n4|3|1\n5|1|1\n6|1|1\n7|1|1\n7|5|1\n7|6|1\n8|1|1\n8|2|1\n8|3|1\n8|4|1\n9|1|1\n9|3|1\n10|3|1\n11|1|1\n11|5"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/dataset/karate_output.csv",
"chars": 217,
"preview": "25|26|29|32\n11|17|5|6|7\n24|25|26|28|29|32\n1|10|12|13|14|18|2|20|22|3|31|4|8|9\n10|15|16|19|21|23|24|27|28|30|31|33|34|9\n1"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/dataset/network.cl",
"chars": 14,
"preview": "1|2|3\n3|4|5|6\n"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/dataset/network_seeded.cl",
"chars": 8,
"preview": "3|4|5|6\n"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/graph/network.cc",
"chars": 4617,
"preview": "#include \"network.h\"\n\n/**\n *@fn void AddEdge( shared_ptr < string > fr, shared_ptr < string > to, const double& weight, "
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/graph/network.h",
"chars": 1746,
"preview": "#ifndef RPI_NETWORK\n#define RPI_NETWORK\n\n#include <map>\n#include <set>\n#include <memory>\n#include <fstream>\n\nusing names"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/graph/temporal_network.cc",
"chars": 2940,
"preview": "#include \"temporal_network.h\"\n\n/**\n *@fn TemporalNetwork::AddNetwork ( const string& filename, const string& delimiters "
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/graph/temporal_network.h",
"chars": 1394,
"preview": "#ifndef RPI_TEMPORAL_NETWORK\n#define RPI_TEMPORAL_NETWORK\n\n#include <set>\n#include <map>\n#include <iostream>\n#include <v"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/main.cc",
"chars": 17610,
"preview": "#include <algorithm>\n\n#include \"graph/temporal_network.h\"\n#include \"util/parameters_helper.h\"\n\nusing namespace std;\n\n/**"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/useless/RandomNetwork.h",
"chars": 459,
"preview": "#ifndef RNET_RPI\n#define RNET_RPI\n\n#include \"../Network/network.h\"\n#include \"../Random/PowerLaw.h\"\n\nvoid RandomNetwork ("
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/graph_io_helper.cc",
"chars": 3602,
"preview": "#include \"graph_io_helper.h\"\n\nusing namespace std;\n\n/**\n *@fn void ChangeDelimiter ( const string& filein, const string&"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/graph_io_helper.h",
"chars": 1062,
"preview": "#include <vector>\n#include <map>\n\n#include \"io_helper.h\"\n\nusing namespace std;\n\n/**\n *@fn void ChangeDelimiter ( const s"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/io_helper.cc",
"chars": 2658,
"preview": "#include \"io_helper.h\"\n\n/**\n * @fn bool fline_tr(ifstream* fin, vector <string> fields, string delim)\n\n * Retrieve a lin"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/io_helper.h",
"chars": 417,
"preview": "#ifndef ICE_IOX\n#define ICE_IOX\n\n#include \"string_helper.h\"\n#include <string>\n#include <iostream>\n#include <vector>\n#inc"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/parameters_helper.cc",
"chars": 3147,
"preview": "/**\n* Implementation of the parameters class\n*/\n#include \"parameters_helper.h\"\n\n/**\n * @fn void Parameters::Read(int arg"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/parameters_helper.h",
"chars": 2250,
"preview": "/**\n* Class to help read in multiple command line (flagged) parameters\n*\n*\tTO DO:\n* \t\tError Messages\n*/\n\n#ifndef ICE_PAR"
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/string_helper.cc",
"chars": 1573,
"preview": "\n/**\n * @fn const std::string trim (const std::string& pString, const std::string& pWhitespace)\n * Remove beginning and "
},
{
"path": "Algorithms/2009-Connected-Iterative-Scan/src-refactor/util/string_helper.h",
"chars": 863,
"preview": "#ifndef ICE_STR\n#define ICE_STR\n\n#include <string>\n#include <cstring>\n#include <sstream>\n\nusing namespace std;\n\nconst st"
},
{
"path": "Algorithms/2009-EAGLE/.gitignore",
"chars": 22,
"preview": "bin \nobj \nsrc/*.so\n*~\n"
},
{
"path": "Algorithms/2009-EAGLE/ReadMe.md",
"chars": 229,
"preview": "# EAGLE\n## Description\n\ncontent | detail\n--- | ---\n[src](src) | refactored successfully built passed version source code"
},
{
"path": "Algorithms/2009-EAGLE/graphs/eagle.edl",
"chars": 324,
"preview": "0\t1\n0\t2\n0\t3\n0\t4\n0\t5\n1\t2\n1\t3\n1\t4\n1\t5\n2\t3\n2\t4\n2\t5\n2\t6\n2\t7\n2\t8\n3\t4\n3\t5\n3\t9\n4\t5\n4\t10\n6\t7\n6\t11\n6\t12\n6\t13\n6\t8\n7\t11\n7\t12\n7\t14\n7"
},
{
"path": "Algorithms/2009-EAGLE/graphs/eagle.graphml",
"chars": 7408,
"preview": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<graphml xmlns=\"http://graphml.graphdrawing.org/xmlns\"\n xmlns:xsi=\"http:/"
},
{
"path": "Algorithms/2009-EAGLE/graphs/generate.sh",
"chars": 169,
"preview": "#!/bin/bash\n\nfor i in `ls originals`; do\n echo Elaboro $i\n python tools/converter.py originals/$i $i.graphml\n python "
},
{
"path": "Algorithms/2009-EAGLE/graphs/originals/eagle",
"chars": 333,
"preview": "1\t2\n1\t3\n1\t4\n1\t5\n1\t6\n2\t3\n2\t4\n2\t5\n2\t6\n3\t4\n3\t5\n3\t6\n3\t7\n3\t8\n3\t13\n4\t5\n4\t6\n4\t23\n5\t6\n5\t22\n7\t8\n7\t9\n7\t10\n7\t12\n7\t13\n8\t9\n8\t10\n8\t11\n"
},
{
"path": "Algorithms/2009-EAGLE/graphs/tools/converter.py",
"chars": 2753,
"preview": "import igraph\nimport progressbar\nimport sys\n\nif len(sys.argv) < 3:\n print \"Synopsis: %s graph.edl output [gz|edl|gml] ["
},
{
"path": "Algorithms/2009-EAGLE/graphs/tools/examples.py",
"chars": 2827,
"preview": "import sys\nimport time\n\nfrom progressbar import ProgressBar, Percentage, Bar, ETA, FileTransferSpeed, \\\n RotatingMar"
},
{
"path": "Algorithms/2009-EAGLE/graphs/tools/progressbar.py",
"chars": 14017,
"preview": "#!/usr/bin/python\n# -*- coding: iso-8859-1 -*-\n#\n# progressbar - Text progressbar library for python.\n# Copyright (c) 2"
},
{
"path": "Algorithms/2009-EAGLE/graphs/tools/utils.pyx",
"chars": 0,
"preview": ""
},
{
"path": "Algorithms/2009-EAGLE/relazione/Makefile",
"chars": 595,
"preview": "CC=g++\nCFLAGS=-c -Wall -I/usr/local/include/igraph -O3 -pipe -I./include -ffast-math -ftree-vectorize -fopenmp\nLDFLAGS="
},
{
"path": "Algorithms/2009-EAGLE/relazione/relazione.lyx",
"chars": 32976,
"preview": "#LyX 2.0 created this file. For more info see http://www.lyx.org/\n\\lyxformat 413\n\\begin_document\n\\begin_header\n\\textclas"
},
{
"path": "Algorithms/2009-EAGLE/src/CMakeLists.txt",
"chars": 736,
"preview": "cmake_minimum_required(VERSION 2.8)\nproject(2009-eagle)\nset(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} -std=c++14 -O3 -g\")\n\nfin"
},
{
"path": "Algorithms/2009-EAGLE/src/ReadMe.md",
"chars": 325,
"preview": "#Attention\n##Current Status\n\nBuild successfully.\n\nFix interface-changing-bug due to change of igraph library. In [commun"
},
{
"path": "Algorithms/2009-EAGLE/src/communities.cpp",
"chars": 12418,
"preview": "\n#include <algorithm>\n#include <fstream>\n#include <sstream>\n#include <iostream>\n\n#include <boost/foreach.hpp>\n#include <"
},
{
"path": "Algorithms/2009-EAGLE/src/communities.h",
"chars": 19732,
"preview": "#ifndef __COMMUNITIES_H\n#define __COMMUNITIES_H\n\n#include <omp.h>\n\n#include <string>\n#include <set>\n\n#include <iostream>"
},
{
"path": "Algorithms/2009-EAGLE/src/eagle.cpp",
"chars": 7016,
"preview": "\n#include <fstream>\n\n#include <boost/archive/text_oarchive.hpp>\n\n#include \"eagle.h\"\n#include \"max_cache.h\"\n\n\nusing names"
},
{
"path": "Algorithms/2009-EAGLE/src/eagle.h",
"chars": 495,
"preview": "#ifndef __EAGLE_H\n#define __EAGLE_H\n\n#include <string>\n\n#include \"communities.h\"\n\nclass MaxCache;\n\nclass EAGLE {\nprivate"
},
{
"path": "Algorithms/2009-EAGLE/src/main.cpp",
"chars": 1565,
"preview": "#include <fstream>\n#include \"eagle.h\"\n\nusing namespace std;\n\nint main(int argc, char *argv[]) {\n int mode;\n const "
},
{
"path": "Algorithms/2009-EAGLE/src/max_cache.cpp",
"chars": 2337,
"preview": "#include <cmath>\n\n#include \"max_cache.h\"\n\nusing namespace std;\n\nbool MaxCache::isEmpty() {\n int s = cache.size();\n\n "
},
{
"path": "Algorithms/2009-EAGLE/src/max_cache.h",
"chars": 2705,
"preview": "#ifndef __MAXCACHE_H\n#define __MAXCACHE_H\n\n#include <list>\n#include <set>\n\n/** Elemento della cache\n Un massimo è identi"
},
{
"path": "Algorithms/2009-LineGraph/altix/axlgc.sh",
"chars": 892,
"preview": "#!/bin/bash\n#PBS -l walltime=24:00:00 \n#PBS -l mem=60Gb \n#PBS -l ncpus=4 \n#PBS -m abe\n# Script to run linegraphcreator ("
},
{
"path": "Algorithms/2009-LineGraph/altix/axmakelgc.sh",
"chars": 103,
"preview": "module load intel-suite\r\nicpc -xP -mcmodel=large -i-dynamic -o linegraphcreator TseGraph.cpp main.cpp\r\n"
},
{
"path": "Algorithms/2009-LineGraph/deprecated/LineGraphCreator.html",
"chars": 9284,
"preview": "<html>\r\n <head>\r\n <title>LineGraphCreator</title>\r\n <meta http-equiv=\"Content-Type\" content=\"text/html;"
},
{
"path": "Algorithms/2009-LineGraph/deprecated/lgc.bat",
"chars": 76,
"preview": "dist\\Release\\MinGW-Windows\\linegraphcreator.exe %1 %2 %3 %4 %5 %6 %7 %8 %9\r\n"
},
{
"path": "Algorithms/2009-LineGraph/deprecated/makefileClever",
"chars": 311,
"preview": "# taken from http://mrbook.org/tutorials/make/\r\nCC=g++\r\nCFLAGS=-c -Wall\r\nLDFLAGS=-O2\r\nSOURCES=main.cpp TseGraph.cpp\r\nOBJ"
},
{
"path": "Algorithms/2009-LineGraph/deprecated/makefileTSE",
"chars": 352,
"preview": "# taken from http://mrbook.org/tutorials/make/ CC=g++ CFLAGS=-c\r\n-Wall LDFLAGS=-O2\r\n\r\nall: linegraphcreator\r\n\r\nlinegraph"
},
{
"path": "Algorithms/2009-LineGraph/deprecated/makelgc.bat",
"chars": 569,
"preview": "@echo off\r\nif defined PRGDIR goto :runtg\r\ncall c:\\bin\\setenv\r\n:runtg\r\n@echo --- Compiling LineGraphCreator in C++ from m"
},
{
"path": "Algorithms/2009-LineGraph/readme.txt",
"chars": 777,
"preview": "readme.txt file for LineGraphCreator Version 091222\r\n\r\nLook at the LineGraphCreator.html file for more information.\r\n\r\nT"
},
{
"path": "Algorithms/2009-LineGraph/src/TseGraph.cpp",
"chars": 6835,
"preview": "/*\r\n * File: TseGraph.cpp\r\n * Author: T.S.Evans, Physics Dept., Imperial College London\r\n * TseGraph is for weighted o"
},
{
"path": "Algorithms/2009-LineGraph/src/TseGraph.h",
"chars": 3241,
"preview": "#include <stdlib.h>\r\n#include <stdio.h>\r\n#include <iostream>\r\n#include <iomanip>\r\n#include <fstream>\r\n#include <vector>\r"
},
{
"path": "Algorithms/2009-LineGraph/src/main.cpp",
"chars": 11637,
"preview": "/* \n * File: main.cpp\n * Author: T.S.Evans, Physics Dept., Imperial College London\n * These line graphs are defined in"
},
{
"path": "Algorithms/2010-CONGA/ReadMe.md",
"chars": 291,
"preview": "# 2010-CONGA\n## Three Available Jar Files\n\ncontent | detail\n--- | ---\n[copra](conga_src/src/main/resources/copra.jar) | "
},
{
"path": "Algorithms/2010-CONGA/conga_src/ReadMe.md",
"chars": 1262,
"preview": "#Info\n##Author \n\nhttp://gregory.org/research/networks/\n\n\n##Usage of CM (clique_modularity), 2009\n\n> This page provides t"
},
{
"path": "Algorithms/2010-CONGA/conga_src/dataset/dolphins_edges.txt",
"chars": 903,
"preview": "29\t43\n29\t52\n29\t35\n29\t51\n29\t45\n0\t10\n0\t42\n0\t15\n0\t40\n0\t47\n0\t14\n39\t57\n24\t29\n24\t51\n24\t45\n50\t51\n23\t51\n23\t36\n23\t45\n34\t37\n34\t44\n"
},
{
"path": "Algorithms/2010-CONGA/conga_src/dataset/karate.txt",
"chars": 967,
"preview": "28\n-- 3\n-- 24\n-- 25\n-- 34\n3\n-- 28\n-- 10\n-- 29\n-- 2\n-- 33\n-- 9\n-- 4\n-- 14\n-- 8\n-- 1\n29\n-- 32\n-- 3\n-- 34\n27\n-- 30\n-- 34\n14"
},
{
"path": "Algorithms/2010-CONGA/conga_src/pom.xml",
"chars": 1758,
"preview": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<project xmlns=\"http://maven.apache.org/POM/4.0.0\"\n xmlns:xsi=\"http://www"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/CM.java",
"chars": 8531,
"preview": "package clique_modularity;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower deco"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/algorithm/BK/BK.java",
"chars": 4283,
"preview": "package clique_modularity.algorithm.BK;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fe"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/algorithm/BK/BronKerboschCFFast.java",
"chars": 4809,
"preview": "package clique_modularity.algorithm.BK;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fe"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/algorithm/KJ/KJ.java",
"chars": 5111,
"preview": "package clique_modularity.algorithm.KJ;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fe"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/algorithm/MaxClique.java",
"chars": 9223,
"preview": "package clique_modularity.algorithm;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernf"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/input_output/ReadEdges.java",
"chars": 1603,
"preview": "package clique_modularity.input_output;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fe"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/input_output/WriteCliques.java",
"chars": 1082,
"preview": "package clique_modularity.input_output;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fe"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/ARRAY2.java",
"chars": 222,
"preview": "package clique_modularity.util;\n\nimport clique_modularity.util.graph.ELEMENT;\n\n/**\n * Created by cheyulin on 2/27/17.\n *"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/ARRAY_FIX.java",
"chars": 222,
"preview": "package clique_modularity.util;\n\n/**\n * Created by cheyulin on 2/27/17.\n */\n\n\npublic class ARRAY_FIX {\n public int[] "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/Pair.java",
"chars": 392,
"preview": "package clique_modularity.util;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/Tree.java",
"chars": 773,
"preview": "package clique_modularity.util;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/benchmark/GG.java",
"chars": 56090,
"preview": "package clique_modularity.util.benchmark;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/benchmark/GGResult.java",
"chars": 538,
"preview": "package clique_modularity.util.benchmark;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CPP.java",
"chars": 10087,
"preview": "package clique_modularity.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CommPair.java",
"chars": 387,
"preview": "package clique_modularity.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CommPairSet.java",
"chars": 1907,
"preview": "package clique_modularity.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CompleteCliques.java",
"chars": 3153,
"preview": "package clique_modularity.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/CompleteCliques1.java",
"chars": 2089,
"preview": "package clique_modularity.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/RebuildCommunities.java",
"chars": 11891,
"preview": "package clique_modularity.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/community/RemoveCliques.java",
"chars": 3073,
"preview": "package clique_modularity.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by "
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/graph/ELEMENT.java",
"chars": 348,
"preview": "package clique_modularity.util.graph;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fern"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/metric/Modularity.java",
"chars": 4324,
"preview": "package clique_modularity.util.metric;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fer"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/clique_modularity/util/metric/Omega.java",
"chars": 5210,
"preview": "package clique_modularity.util.metric;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fer"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/CONGA.java",
"chars": 84824,
"preview": "package conga;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)\n//\n\n"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/algorithm/Between.java",
"chars": 15006,
"preview": "package conga.algorithm;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decomp"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/algorithm/CPP.java",
"chars": 30436,
"preview": "package conga.algorithm;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decomp"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/algorithm/PB.java",
"chars": 3059,
"preview": "package conga.algorithm;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decomp"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/Pair.java",
"chars": 380,
"preview": "package conga.util;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/StrPair.java",
"chars": 398,
"preview": "package conga.util;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/Tree.java",
"chars": 542,
"preview": "package conga.util;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/benchmark/GResult.java",
"chars": 427,
"preview": "package conga.util.benchmark;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower d"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/community/BP.java",
"chars": 300,
"preview": "package conga.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower d"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/community/ClusterInfo.java",
"chars": 424,
"preview": "package conga.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower d"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/community/Stats.java",
"chars": 2590,
"preview": "package conga.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower d"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/graph/Edge.java",
"chars": 628,
"preview": "package conga.util.graph;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decom"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/graph/LabelledEdge.java",
"chars": 379,
"preview": "package conga.util.graph;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decom"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/graph/Split.java",
"chars": 381,
"preview": "package conga.util.graph;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decom"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/graph/Vertex.java",
"chars": 809,
"preview": "package conga.util.graph;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decom"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/conga/util/metric/ModOverlap.java",
"chars": 11148,
"preview": "package conga.util.metric;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower deco"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/copra/Project.java",
"chars": 5680,
"preview": "package copra;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)\n//\n\n"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/copra/algorithm/COPRA.java",
"chars": 46129,
"preview": "package copra.algorithm;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decomp"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/LabelPair.java",
"chars": 382,
"preview": "package copra.util;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/SetPair.java",
"chars": 556,
"preview": "package copra.util;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/VecPair.java",
"chars": 364,
"preview": "package copra.util;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/Vert.java",
"chars": 495,
"preview": "package copra.util;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/community/ClusterLabel.java",
"chars": 6322,
"preview": "package copra.util.community;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower d"
},
{
"path": "Algorithms/2010-CONGA/conga_src/src/main/java/copra/util/metric/ModOverlap.java",
"chars": 11090,
"preview": "package copra.util.metric;//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower deco"
},
{
"path": "Algorithms/2010-LinkCommunity/README.markdown",
"chars": 850,
"preview": "About\n=====\n\nHere is the code for finding link communities [1] in complex networks.\nCurrently, we have two implementatio"
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/COPYING",
"chars": 35146,
"preview": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free "
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/README",
"chars": 2759,
"preview": "Link Communities C++\n\nThis directory contains C++ code and helper files to perform link clustering for very\nlarge networ"
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/calcAndWrite_Jaccards.cpp",
"chars": 5497,
"preview": "// calcAndWrite_Jaccards.cpp\n// Jim Bagrow\n// Last Modified: 2008-12-30\n\n/*\nCopyright 2008,2009,2010 James Bagrow\n\n\nThis"
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/clusterJaccsFile.cpp",
"chars": 6711,
"preview": "// clusterJaccsFile.cpp\n// Jim Bagrow\n// Last Modified: 2009-03-10\n\n/*\nCopyright 2008,2009,2010 James Bagrow\n\n\nThis prog"
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/edgelist2pairs.py",
"chars": 5446,
"preview": "#!/usr/bin/env python\n# encoding: utf-8\n\n# edgelist2pairs.py\n# Jim Bagrow\n# Last Modified: 2008-12-29\n\n\"\"\"\nCopyright 200"
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/karate.pairs",
"chars": 404,
"preview": "0 1\n0 2\n0 3\n0 4\n0 5\n0 6\n0 7\n0 8\n0 9\n0 10\n0 11\n0 12\n0 13\n0 14\n0 15\n0 16\n1 2\n1 3\n1 7\n12 1\n13 1\n1 14\n1 15\n1 17\n2 3\n2 7\n2 8\n"
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/lesmis.pairs",
"chars": 1507,
"preview": "0 1\n2 0\n3 0\n4 0\n5 0\n6 0\n7 0\n8 0\n0 9\n0 10\n2 3\n2 10\n3 10\n11 10\n12 10\n13 10\n14 10\n15 10\n16 10\n17 10\n18 10\n19 10\n20 10\n10 21"
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/link_clustering.sh",
"chars": 3125,
"preview": "#!/usr/bin/env bash\n\n# link_clustering.sh\n# Jim Bagrow\n# Last Modified: 2010-02-16\n\n# Copyright 2009,2010 James Bagrow\n#"
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/loop_thresholds.sh",
"chars": 1119,
"preview": "#!/usr/bin/env bash\n\n# loop_thresholds.sh\n# Jim Bagrow\n# Last Modified: 2009-03-10\n\n\n# Copyright 2009,2010 James Bagrow\n"
},
{
"path": "Algorithms/2010-LinkCommunity/cpp/partition_density.py",
"chars": 2377,
"preview": "#!/usr/bin/env python\n# encoding: utf-8\n\n# partition_density.py\n# Jim Bagrow\n# Last Modified: 2010-02-16\n\n# Copyright 20"
},
{
"path": "Algorithms/2010-LinkCommunity/python/karate.pairs",
"chars": 404,
"preview": "0 1\n0 2\n0 3\n0 4\n0 5\n0 6\n0 7\n0 8\n0 9\n0 10\n0 11\n0 12\n0 13\n0 14\n0 15\n0 16\n1 2\n1 3\n1 7\n12 1\n13 1\n1 14\n1 15\n1 17\n2 3\n2 7\n2 8\n"
},
{
"path": "Algorithms/2010-LinkCommunity/python/link_clustering.py",
"chars": 15668,
"preview": "#!/usr/bin/env python\n# encoding: utf-8\n\n# link_clustering.py\n# Jim Bagrow, Yong-Yeol Ahn\n# Last Modified: 2010-08-27\n\n#"
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/ReadMe.md",
"chars": 1417,
"preview": "#LinkComm\n##Current Status\nOnly support undirected graph(weighted or unweighted are all supported), which could be found"
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/example_edge_list.txt",
"chars": 53,
"preview": "1 2\n1 3\n2 3\n3 4\n4 5\n4 7\n5 7\n5 6\n6 7"
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/graph_io_helper.py",
"chars": 2944,
"preview": "#!/usr/bin/env python\n# encoding: utf-8\n\n\nfrom operator import itemgetter\nfrom collections import defaultdict\n\n\ndef get_"
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/link_clustering.py",
"chars": 2436,
"preview": "#!/usr/bin/env python\n# encoding: utf-8\n\nimport os\nfrom optparse import OptionParser\nfrom graph_io_helper import *\nfrom "
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/link_clustering_algo.py",
"chars": 6940,
"preview": "#!/usr/bin/env python\n# encoding: utf-8\n\nfrom copy import copy\nfrom heapq import heappush, heappop\nfrom itertools import"
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/play_ground.py",
"chars": 67,
"preview": "import itertools\n\nprint list(itertools.combinations([1, 2, 3], 2))\n"
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/results_sample/example_edge_list_maxS0.166667_maxD0.703704.comm2edges.txt",
"chars": 42,
"preview": "1\t4,7\t5,6\t4,5\t6,7\t5,7\n2\t2,3\t1,3\t1,2\n3\t3,4\n"
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/results_sample/example_edge_list_maxS0.166667_maxD0.703704.comm2nodes.txt",
"chars": 24,
"preview": "1\t5\t4\t7\t6\n2\t1\t3\t2\n3\t3\t4\n"
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/results_sample/example_edge_list_maxS0.166667_maxD0.703704.edge2comm.txt",
"chars": 54,
"preview": "5\t6\t1\n4\t5\t1\n5\t7\t1\n4\t7\t1\n6\t7\t1\n2\t3\t2\n1\t3\t2\n1\t2\t2\n3\t4\t3\n"
},
{
"path": "Algorithms/2010-LinkCommunity/python_yche_refactor/results_sample/example_edge_list_thr_D.txt",
"chars": 131,
"preview": "1.0 0.0\n1.0 0.0\n0.75 0.0\n0.6 0.666666666667\n0.4 0.703703703704\n0.166666666667 0.703703703704\n0.142857142857 0.5185185185"
},
{
"path": "Algorithms/2010-TopGC/ReadMe.md",
"chars": 128,
"preview": "# TopGC\n## Links\n- [related github repo](https://github.com/akhiljain93/rampaging-elephant/tree/master/private/clusterin"
},
{
"path": "Algorithms/2010-TopGC/src_original/Graphs/graph.sample.clusters_directed",
"chars": 2137,
"preview": "112\t113\t1140\t1493\t196\t198\t248\t422\t478\t483\t484\t500\t501\t669\t740\t762\t932\t\n1027\t1098\t1196\t1286\t1462\t1663\t1728\t1792\t1883\t1982"
},
{
"path": "Algorithms/2010-TopGC/src_original/Graphs/original/graph.raw",
"chars": 5399638,
"preview": "0\t1\t4.30086159319852\n0\t40\t3.5028596081151\n0\t41\t0.940829346722639\n0\t56\t1.99662652712411\n0\t78\t1.05279766076136\n0\t93\t3.5163"
},
{
"path": "Algorithms/2010-TopGC/src_original/Graphs/original/graph1.raw",
"chars": 192063,
"preview": "0\t1\t430086159319852\n0\t40\t35028596081151\n0\t41\t0940829346722639\n0\t56\t199662652712411\n0\t78\t105279766076136\n0\t93\t35163543304"
},
{
"path": "Algorithms/2010-TopGC/src_original/Graphs/original/graph_temp.raw",
"chars": 21,
"preview": "0\t1\t34\n0\t2\t20\n3\t1\t20\n"
},
{
"path": "Algorithms/2010-TopGC/src_original/Graphs/original/graph_temp2.raw",
"chars": 14,
"preview": "0\t1\t34\n0\t2\t20\n"
},
{
"path": "Algorithms/2010-TopGC/src_original/Graphs/original/mkidx.c",
"chars": 2227,
"preview": "#include <stdio.h>\n#include <stdlib.h>\n#include <getopt.h>\n\n#define NDATA 10000\n\nstruct list {\n\tstruct list *next;\n\tint "
},
{
"path": "Algorithms/2010-TopGC/src_original/README",
"chars": 3481,
"preview": "\nTopGC\n-----\nTopGC is a Graph Clustering program that probabilistically finds the top\nclusterings of nodes within large "
},
{
"path": "Algorithms/2010-TopGC/src_original/edgew.txt",
"chars": 684764,
"preview": "0 7\r\n0 15\r\n0 74\r\n0 75\r\n0 85\r\n0 98\r\n0 100\r\n0 101\r\n0 112\r\n0 117\r\n0 140\r\n0 143\r\n0 145\r\n0 159\r\n0 2019\r\n0 2380\r\n1 1\r\n1 5\r\n1 1"
},
{
"path": "Algorithms/2010-TopGC/src_original/mkidx.c",
"chars": 2685,
"preview": "#include <stdio.h>\n#include <stdlib.h>\n#include <getopt.h>\n\n#define NDATA 10000\n\nstruct list\n{\n struct list *next;\n in"
},
{
"path": "Algorithms/2010-TopGC/src_refactor/pom.xml",
"chars": 1163,
"preview": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<project xmlns=\"http://maven.apache.org/POM/4.0.0\"\n xmlns:xsi=\"http://www"
},
{
"path": "Algorithms/2010-TopGC/src_refactor/src/main/java/FindMostProm.java",
"chars": 22827,
"preview": "//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)\n//\n\nimport java.ut"
},
{
"path": "Algorithms/2010-TopGC/src_refactor/src/main/java/HoldBucket.java",
"chars": 1286,
"preview": "//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)\n//\n\nimport java.ut"
},
{
"path": "Algorithms/2010-TopGC/src_refactor/src/main/java/HoldInt.java",
"chars": 201,
"preview": "//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)\n//\n\npublic class H"
},
{
"path": "Algorithms/2010-TopGC/src_refactor/src/main/java/IntAndDouble.java",
"chars": 519,
"preview": "//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)\n//\n\npublic class I"
},
{
"path": "Algorithms/2010-TopGC/src_refactor/src/main/java/LSH.java",
"chars": 15906,
"preview": "//\n// Source code recreated from a .class file by IntelliJ IDEA\n// (powered by Fernflower decompiler)\n//\n\nimport java.ut"
}
]
// ... and 2475 more files (download for full content)
About this extraction
This page contains the full source code of the RapidsAtHKUST/CommunityDetectionCodes GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 2675 files (87.2 MB), approximately 11.7M tokens, and a symbol index with 9797 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.