Java Code to extract a network from Stanford Autonomous systems dataset by utilizing GraphStream library
Description
* Purpose: Stanford Network Analysis Project provides different networks that consist of a large number of nodes. Examples of those networks are the “as20000102” dataset (https://snap.stanford.edu/data/as-733.html) and the “oregon1_010407” dataset (https://snap.stanford.edu/data/Oregon-1.html). This might not be adequate for researchers who want to experiment with subsets of those networks. In addition, the original datasets are not stored in a format readable by GraphStream library (https://graphstream-project.org/ ). Therefore, we provide Java code based on GraphStream library that extracts a completely connected subgraph from a given original dataset and stores it in a GraphStream-friendly format. * as20000102.txt: contains the graph that is provided by the as20000102 dataset provided by Stanford Network Analysis Project (https://snap.stanford.edu/data/as-733.html). The file is provided here for convenience, but it can also be downloaded from the previous link. If you download the original dataset from the previous link, then please make sure to remove the comments that start with “#” symbol at the beginning of the file. * oregon1_010407.txt: contains the graph that is provided by the oregon1_010407 dataset provided by Stanford Network Analysis Project (https://snap.stanford.edu/data/Oregon-1.html). The file is provided here for convenience, but it can also be downloaded from the previous link. If you download the original dataset from the previous link, then please make sure to remove the comments that start with “#” symbol at the beginning of the file. * GraphGenerator.java: Our code that extracts nodes from the original dataset. Then, delay and bandwidth values are added to network edges. After that, the extracted graph is stored in a GraphStream-readable format. However, the result is a graph that contains isolated subgraphs. The code utilizes GraphStream library (https://graphstream-project.org/ ) * ConnectedGraphs.java: Our code that uses the graph extracted by the "GraphGenerator", then extracts the largest completely connected subgraph from it. The result is also stored in a GraphStream-readable format. The code utilizes GraphStream library (https://graphstream-project.org/ ) * Note 1: If you use this code in your research accompanied by the previous dataset, then, in addition to the citation provided by Mendeley, please add proper citations to the original dataset by Stanford Network Analysis Project and add a proper citation to the GraphStream library. * Note 2: If you use this code in your research without using any of the datasets, then please provide a proper citation as provided by Mendeley. In addition, please add a proper citation to GraphStream library.