|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.iu.cnets.klatsch.model.basic.BasicGraph
public class BasicGraph
Field Summary | |
---|---|
(package private) java.util.SortedSet<Edge> |
backEdges
the set of all backward edges in the graph |
(package private) java.util.SortedSet<Edge> |
edges
the set of all forward edges in the graph |
(package private) java.util.SortedSet<Node> |
nodes
the set of all nodes in the graph |
(package private) static BasicNode |
zero
|
Constructor Summary | |
---|---|
BasicGraph()
Basic constructor for an empty graph. |
Method Summary | |
---|---|
Graph |
actorGraph()
Returns the subgraph containing only actor-actor edges. |
Graph |
actorMemeGraph()
Returns the subgraph containing only actor-meme and meme-actor edges. |
void |
add(Edge e)
Adds the given edge to the graph. |
Graph |
component(int n)
|
int |
componentCount()
These methods are not yet implemented for the basic graph because its development has stagnated since the creation of GephiGraph. |
int[] |
componentSize()
|
int |
dstCount()
Returns the number of destination nodes in the graph. |
java.lang.Iterable<java.lang.Integer> |
dstK()
Returns an iterable over the in-degrees of the nodes in the graph. |
int |
dstK(Node n)
Returns the in-degree of the given node. |
java.lang.Iterable<java.lang.Double> |
dstS()
Returns an iterable over the in-strengths of the nodes in the graph. |
double |
dstS(Node n)
Returns the in-strength of the given node. |
int |
edgeCount()
Returns the total number of edges. |
java.lang.Iterable<Edge> |
edges()
Returns an iterable over the edges. |
java.lang.Iterable<Edge> |
edgesIn(Node n)
Returns an iterable over the edges with this node as a destination. |
java.lang.Iterable<Edge> |
edgesOut(Node n)
Returns an iterable over the edges with this node as a source. |
boolean |
export(java.lang.String path,
java.lang.String format)
Exports the graph in the given format. |
Edge |
getEdge(Edge e)
Returns the given edge. |
Node |
getNode(Node n)
Returns the given node. |
boolean |
hasEdge(Edge e)
Returns true if the given edge is part of the graph. |
boolean |
hasNode(Node n)
Returns true if the given node is part of the graph. |
void |
layout(VDictionary config)
|
Graph |
memeGraph()
Returns the subgraph containing only meme-meme edges. |
int |
nodeCount()
Returns the number of nodes in the graph. |
java.lang.Iterable<Node> |
nodes()
Returns an iterable over the nodes. |
int |
srcCount()
Returns the number of source nodes in the graph. |
java.lang.Iterable<java.lang.Integer> |
srcK()
Returns an iterable over the out-degrees of the nodes in the graph. |
int |
srcK(Node n)
Returns the out-degree of the given node. |
java.lang.Iterable<java.lang.Double> |
srcS()
Returns an iterable over the out-strengths of the nodes in the graph. |
double |
srcS(Node n)
Returns the out-strength of the given node. |
double |
statClustering()
|
double |
statDiameter()
|
double |
statDstKPower()
|
double |
statModularity()
|
double |
statPathLength()
|
double |
statSrcKPower()
|
Graph |
trustedGraph()
|
double |
weight(Edge e)
Returns the total weight of this edge. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
static BasicNode zero
java.util.SortedSet<Node> nodes
java.util.SortedSet<Edge> edges
java.util.SortedSet<Edge> backEdges
Constructor Detail |
---|
public BasicGraph()
Method Detail |
---|
public Graph actorGraph()
actorGraph
in interface Graph
public Graph actorMemeGraph()
actorMemeGraph
in interface Graph
public void add(Edge e)
add
in interface Graph
public int dstCount()
dstCount
in interface Graph
public java.lang.Iterable<java.lang.Integer> dstK()
dstK
in interface Graph
public int dstK(Node n)
dstK
in interface Graph
public java.lang.Iterable<java.lang.Double> dstS()
dstS
in interface Graph
public double dstS(Node n)
dstS
in interface Graph
public int edgeCount()
edgeCount
in interface Graph
public java.lang.Iterable<Edge> edges()
edges
in interface Graph
public java.lang.Iterable<Edge> edgesIn(Node n)
edgesIn
in interface Graph
public java.lang.Iterable<Edge> edgesOut(Node n)
edgesOut
in interface Graph
public boolean export(java.lang.String path, java.lang.String format)
export
in interface Graph
public Edge getEdge(Edge e)
getEdge
in interface Graph
public Node getNode(Node n)
getNode
in interface Graph
public boolean hasEdge(Edge e)
hasEdge
in interface Graph
public boolean hasNode(Node n)
hasNode
in interface Graph
public Graph memeGraph()
memeGraph
in interface Graph
public int nodeCount()
nodeCount
in interface Graph
public java.lang.Iterable<Node> nodes()
nodes
in interface Graph
public int srcCount()
srcCount
in interface Graph
public java.lang.Iterable<java.lang.Integer> srcK()
srcK
in interface Graph
public int srcK(Node n)
srcK
in interface Graph
public java.lang.Iterable<java.lang.Double> srcS()
srcS
in interface Graph
public double srcS(Node n)
srcS
in interface Graph
public int componentCount()
componentCount
in interface Graph
public int[] componentSize()
componentSize
in interface Graph
public Graph component(int n)
component
in interface Graph
public void layout(VDictionary config)
layout
in interface Graph
public double statClustering()
statClustering
in interface Graph
public double statDiameter()
statDiameter
in interface Graph
public double statDstKPower()
statDstKPower
in interface Graph
public double statModularity()
statModularity
in interface Graph
public double statPathLength()
statPathLength
in interface Graph
public double statSrcKPower()
statSrcKPower
in interface Graph
public Graph trustedGraph()
trustedGraph
in interface Graph
public double weight(Edge e)
weight
in interface Graph
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |