Package | Description |
---|---|
edu.uci.ics.jung.algorithms.importance |
Provides a set of algorithms for computing the importance of each node (or edge)
in a graph relative to all others (or, for the algorithms that inherit from
RelativeAuthorityRanker , relative to a specified subset of elements). |
edu.uci.ics.jung.algorithms.metrics | |
edu.uci.ics.jung.graph.decorators |
Provides mechanisms for annotating nodes consistently with useful information.
|
edu.uci.ics.jung.io |
Provides a set of graph file format interpreters for loading graphs from disk.
|
edu.uci.ics.jung.utils |
Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application.
|
scratch.danyel.triads |
Modifier and Type | Method and Description |
---|---|
protected Indexer |
RandomWalkSTBetweenness.getIndexer() |
Modifier and Type | Method and Description |
---|---|
protected static boolean |
TriadicCensus.shouldCount(Indexer id,
Vertex u,
Vertex v,
Vertex w)
Make sure we have a canonical ordering: Returns true if u < w, or v < w <
u and v doesn't link to w
|
Modifier and Type | Method and Description |
---|---|
static Indexer |
Indexer.getAndUpdateIndexer(ArchetypeGraph g)
Gets the indexer associated with this graph.
|
static Indexer |
Indexer.getAndUpdateIndexer(ArchetypeGraph g,
java.lang.Object key)
Gets the indexer associated with this graph.
|
static Indexer |
Indexer.getIndexer(ArchetypeGraph g)
Gets the indexer associated with this graph.
|
static Indexer |
Indexer.getIndexer(ArchetypeGraph g,
java.lang.Object key)
* Gets an indexer associated with this graph at this key
|
static Indexer |
Indexer.newIndexer(ArchetypeGraph g,
int offset)
Creates a new indexer associated with this graph.
|
Modifier and Type | Method and Description |
---|---|
protected Edge |
PajekNetReader.createAddEdge(java.util.StringTokenizer st,
Vertex v1,
boolean directed,
Graph g,
Indexer id,
boolean parallel_ok) |
Modifier and Type | Method and Description |
---|---|
static cern.colt.list.DoubleArrayList |
GraphUtils.vertexMapToDAL(java.util.Map vertex_values,
Indexer indexer)
Converts
vertex_values (a Map of vertex to Number values)
to a DoubleArrayList, using indexer to determine the location
of each vertex's value in the DAL. |
Modifier and Type | Method and Description |
---|---|
protected static boolean |
TriadicCensus.shouldCount(Indexer id,
Vertex u,
Vertex v,
Vertex w)
Make sure we have a canonical ordering: Returns true if u < w, or v < w <
u and v doesn't link to w
|