文件列表:

Assignment_nbd_latex.pdf (144430, 2016-05-13)
Assignment_nbd_latex.tex (8461, 2016-05-13)
BFS.py (5126, 2016-05-13)
fatTree.py (6689, 2016-05-13)
fatTree.txt (2441, 2016-05-13)
images (0, 2016-05-13)
images\16-FatTree.png (64021, 2016-05-13)
images\4-FatTree.png (25334, 2016-05-13)
images\8-FatTree.png (63700, 2016-05-13)
library.py (12228, 2016-05-13)
library_NEW.py (10884, 2016-05-13)
main.py (2469, 2016-05-13)
main_NEW.py (2664, 2016-05-13)
part1 (2334, 2016-05-13)
part_1_ 2 _3.py (5643, 2016-05-13)

# cenda Some graph models and algorithms to be applied on Data Center topology #### Contents * PART 1 : generate Erdos-Renyi graph with - G(n,m) model : a graph is chosen uniformly at random from the collection of all graphs which have n nodes and m edges; - G(n,p) model : a graph is constructed by connecting nodes randomly. Each edge is included in the graph with probability p independent from every other edge. * PART 2 : BFS.py - Implement the breadth-first search for all nodes of the graph; - Define the function to create a different graph for each different node choosen as root; - Draw the graph related to a specific root. * PART 3 : Connectivity - algebraic method 1 (irreducibility); - algebraic method 2 (eigenvalue of the Laplacianmatrix); - breadth-first based algorithm. * PART 4 : Fat Tree - Generate a fat tree topology graph - Find all paths connecting a given source ToR and a given destination ToR. - Find all disjoint paths connecting a given source ToR and a given destination ToR. #### To run the code Once you are located in the folder you download: * type: python main_NEW.py to run the entire code. #### To inspect the code * library.py : is the code related to Part 1,2 and 3; * fatTree.py : is the code related to Part 4; * main_NEW.py : is the code to run to perform the algorithms.

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：