E1                      An edge matrix representing a similarity graph
E2                      An edge matrix representing a similarity graph
E3                      An edge matrix representing a similarity graph
counts1                 A matrix representing counts in the distinct
                        values for the two samples
counts2                 A matrix representing counts in the distinct
                        values for the two samples
counts3                 A matrix representing counts in the distinct
                        values for the two samples
dfs                     Depth-first search
ds1                     A distance matrix on the distinct values
ds2                     A distance matrix on the distinct values
ds3                     A distance matrix on the distinct values
g.tests                 Graph-based two-sample tests
g.tests_discrete        Graph-based two-sample tests for discrete data
gTests                  Graph-Based Two-Sample Tests
getComdist              Get distance between two components
getGraph                Construct similarity graph
getMV_discrete          Get intermediate results for g.tests_discrete
                        function
getR1R2                 Get intermediate results for g.tests function
getR1R2_discrete        Get intermediate results for g.tests_discrete
                        function
nnlink                  Construct similarity graph by 1-NNL
nnlink_Com              Get components by nearest neighbor link
                        algorithm
nnlink_K                Construct similarity graph by k-NNL
permute_discrete        Generate a permutation for two discrete data
                        groups
