Differences

This shows you the differences between two versions of the page.

--- mdg_generator [2009/06/20 21:53] – mark
+++ mdg_generator [2010/03/21 20:53] (current) – mark
@@ Line 1: / Line 1: @@
-======  Random Dependency Graph Generation  ======
+======  Simulated Dependency Graph Generation  ======
-Random dependency graph generator creates a random graph that imitates a module dependency graph.  The generator produces  a power-law graph due to empirical studies suggest that  degrees of the nodes in a typical Module Dependency Graph (MDG) of a software system follow a [[http://en.wikipedia.org/wiki/Power_law|power law distribution]].
+Simulated dependency graph generator creates a random graph that imitates a module dependency graph.  The generator produces  a power-law graph due to empirical studies suggest that  degrees of the nodes in a typical Module Dependency Graph (MDG) of a software system follow a [[http://en.wikipedia.org/wiki/Power_law|power law distribution]].
 ====== History ======
@@ Line 23: / Line 23: @@
     * Connectivity: The produced graph needs to be connected. If that is not the case, our algorithm identifies the connected components and modifies as many edges as required in order to connect them (without violating other constraints).
     * Low Clustering Coefficient: The clustering coefficient of an undirected graph is a measure of the number of triangles in the graph.
 ====== Implementation ======
+Random dependency graph generator uses some classes from other  Java libraries.
+===== Dependency =====
+The [[JRET]], developed at the York University , is a large library that provides a wide range of facilities for  reverse engineering   in Java.
+===== Download =====
-{{:sample.tar.gz|}}
+{{:src_samples.jar|}}