edu.iu.cnets.klatsch.model
Interface Graph

All Known Implementing Classes:
BasicGraph, GephiGraph

public interface Graph

This is the interface for working with a graph built from a feed of social media events. The rest of the Klatsch interpreter operates ONLY in terms of this interface.


Method Summary
 Graph actorGraph()
           
 Graph actorMemeGraph()
           
 void add(Edge e)
           
 Graph component(int n)
           
 int componentCount()
           
 int[] componentSize()
           
 int dstCount()
           
 java.lang.Iterable<java.lang.Integer> dstK()
           
 int dstK(Node n)
           
 java.lang.Iterable<java.lang.Double> dstS()
           
 double dstS(Node n)
           
 int edgeCount()
           
 java.lang.Iterable<Edge> edges()
           
 java.lang.Iterable<Edge> edgesIn(Node n)
           
 java.lang.Iterable<Edge> edgesOut(Node n)
           
 boolean export(java.lang.String path, java.lang.String format)
           
 Edge getEdge(Edge e)
           
 Node getNode(Node n)
           
 boolean hasEdge(Edge e)
           
 boolean hasNode(Node n)
           
 void layout(VDictionary config)
           
 Graph memeGraph()
           
 int nodeCount()
           
 java.lang.Iterable<Node> nodes()
           
 int srcCount()
           
 java.lang.Iterable<java.lang.Integer> srcK()
           
 int srcK(Node n)
           
 java.lang.Iterable<java.lang.Double> srcS()
           
 double srcS(Node n)
           
 double statClustering()
           
 double statDiameter()
           
 double statDstKPower()
           
 double statModularity()
           
 double statPathLength()
           
 double statSrcKPower()
           
 Graph trustedGraph()
           
 double weight(Edge e)
           
 

Method Detail

actorGraph

Graph actorGraph()

actorMemeGraph

Graph actorMemeGraph()

add

void add(Edge e)

component

Graph component(int n)

componentCount

int componentCount()

componentSize

int[] componentSize()

dstCount

int dstCount()

dstK

java.lang.Iterable<java.lang.Integer> dstK()

dstK

int dstK(Node n)

dstS

java.lang.Iterable<java.lang.Double> dstS()

dstS

double dstS(Node n)

edgeCount

int edgeCount()

edges

java.lang.Iterable<Edge> edges()

edgesIn

java.lang.Iterable<Edge> edgesIn(Node n)

edgesOut

java.lang.Iterable<Edge> edgesOut(Node n)

export

boolean export(java.lang.String path,
               java.lang.String format)

getEdge

Edge getEdge(Edge e)

getNode

Node getNode(Node n)

hasEdge

boolean hasEdge(Edge e)

hasNode

boolean hasNode(Node n)

layout

void layout(VDictionary config)

memeGraph

Graph memeGraph()

nodeCount

int nodeCount()

nodes

java.lang.Iterable<Node> nodes()

srcCount

int srcCount()

srcK

java.lang.Iterable<java.lang.Integer> srcK()

srcK

int srcK(Node n)

srcS

java.lang.Iterable<java.lang.Double> srcS()

srcS

double srcS(Node n)

statClustering

double statClustering()

statDiameter

double statDiameter()

statDstKPower

double statDstKPower()

statModularity

double statModularity()

statPathLength

double statPathLength()

statSrcKPower

double statSrcKPower()

trustedGraph

Graph trustedGraph()

weight

double weight(Edge e)