This interface declares advanced methods for directed graphs such as
motif mining that are not mandatory for basic implementations of
DirectedGraph classes.
This interface declares advanced methods for undirected graphs such as
motif mining that are not mandatory for basic implementations of
UndirectedGraph classes.
This class represents the IO unit for a simple comma-delimited format
that assumes a directed or undirected, simple or multi graph with no
edge attributes.
CSVIO() -
Constructor for class org.gersteinlab.tyna.core.io.CSVIO
Get the betweenness of a node n, which is defined as the number
of node pairs (n1, n2) where the shortest path from n1 to n2
passes through n, with the following two requirements:
.
Get the clustering coefficient of a node n, which is defined as
follows: let E(n) be the set of nodes n'<>n such that (n, n1) is
in the set of all edges of the graph, E.
Get the eccentricity of a node n, which is deinfed as follows:
A maximum shortest path of node n is a shortest path from n to a
node reachable from it that has the largest length among all
shortest paths from n to its reachable nodes.
This class represents the IO unit for a simple tab-delimited format that
assumes a directed or undirected, simple or multi graph with no edge
attributes.
TDIO() -
Constructor for class org.gersteinlab.tyna.core.io.TDIO