Index (graph 2.7.0.2 API)

A B C D E F G H I L M N O P R S T U W

A

abortableBreadthFirstSearch(int, boolean, IntPredicate) - Method in interface com.mastfrog.graph.IntGraph: Do a breadth-first search which takes a predicate that will abort the search the first time the predicate returns false.
abortableDepthFirstSearch(int, boolean, IntPredicate) - Method in interface com.mastfrog.graph.IntGraph: Do a depth-first search which takes a predicate that will abort the search the first time the predicate returns false.
add(int, int) - Method in class com.mastfrog.graph.PairSet
addEdge(T, T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Ad an edge from one node to another.
addEdge(int, int) - Method in class com.mastfrog.graph.IntGraphBuilder
addEdges(int[][]) - Method in class com.mastfrog.graph.IntGraphBuilder
addOrphan(int) - Method in class com.mastfrog.graph.IntGraphBuilder
Algorithm<R,A extends Algorithm> - Class in com.mastfrog.graph.algorithm
Algorithm() - Constructor for class com.mastfrog.graph.algorithm.Algorithm
Algorithm.BooleanParameter<A extends Algorithm> - Class in com.mastfrog.graph.algorithm
Algorithm.DoubleParameter<A extends Algorithm> - Class in com.mastfrog.graph.algorithm
Algorithm.IntParameter<A extends Algorithm> - Class in com.mastfrog.graph.algorithm
allEdges() - Method in interface com.mastfrog.graph.IntGraph: Get all edges in the graph.
appending(int) - Method in class com.mastfrog.graph.IntPath: Create a new path appending the passed value.
appending(T) - Method in class com.mastfrog.graph.ObjectPath: Create a new path appending the passed object.
apply(IntGraph) - Method in class com.mastfrog.graph.algorithm.Algorithm
apply(IntGraph) - Method in class com.mastfrog.graph.algorithm.EigenvectorCentrality
apply(IntGraph) - Method in class com.mastfrog.graph.algorithm.PageRank
apply(IntGraph, IntFunction<T>) - Method in class com.mastfrog.graph.algorithm.RankingAlgorithm
apply(RankingAlgorithm<?>) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
apply(RankingAlgorithm<?>) - Method in interface com.mastfrog.graph.ObjectGraph

B

BitSetUtils - Class in com.mastfrog.graph
bottomLevelNodes() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
bottomLevelNodes() - Method in interface com.mastfrog.graph.IntGraph: Get the set of nodes which have no outbound edges.
bottomLevelNodes() - Method in interface com.mastfrog.graph.ObjectGraph: Get the set of nodes which have no outbound edges.
breadthFirstSearch(int, boolean, IntConsumer) - Method in interface com.mastfrog.graph.IntGraph: Do a breadth-first search from the starting node, visiting all nodes in its closure or reverse-closure depending on the value of up, visiting each node in some order at least once.
build() - Method in class com.mastfrog.graph.IntGraphBuilder
builder() - Static method in interface com.mastfrog.graph.IntGraph
builder(int) - Static method in interface com.mastfrog.graph.IntGraph
byClosureSize() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
byClosureSize() - Method in interface com.mastfrog.graph.IntGraph: Return an array of all nodes in the graph, sorted by the size of their closure (the number of distinct descendant nodes they have).
byClosureSize() - Method in interface com.mastfrog.graph.ObjectGraph: Get a list of the nodes in the graph sorted by the size of their closure.
byReverseClosureSize() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
byReverseClosureSize() - Method in interface com.mastfrog.graph.IntGraph: Return an array of all nodes in the graph, sorted by the size of their reverse closure (the number of distinct ancestor nodes they have).
byReverseClosureSize() - Method in interface com.mastfrog.graph.ObjectGraph: Get a list of the nodes in the graph sorted by the size of their reverse closure (all paths to the top of the graph from this node).

C

childPath() - Method in class com.mastfrog.graph.IntPath: Create a new path, lopping off the first element.
childPath() - Method in class com.mastfrog.graph.ObjectPath: Get a copy of this path, lopping off the first element.
children(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
children(int) - Method in interface com.mastfrog.graph.IntGraph: Get the set of nodes which have inbound edges from the passed node.
children(T) - Method in interface com.mastfrog.graph.ObjectGraph: Get the set of string node names which are immediate child nodes of a given one (if the graph is cyclic, this may include the node name passed).
clear() - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Clear the contents of the graph.
closureDisjunction(int, int) - Method in interface com.mastfrog.graph.IntGraph: Get the disjunction of the closure of two nodes.
closureDisjunction(int...) - Method in interface com.mastfrog.graph.IntGraph: Get the set of those nodes which exist in the closure of only one of the passed list of nodes.
closureDisjunction(Bits) - Method in interface com.mastfrog.graph.IntGraph: Get the set of those nodes which exist in the closure of only one of the passed list of nodes.
closureOf(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
closureOf(int) - Method in interface com.mastfrog.graph.IntGraph: Get the closure of this node - the set of all nodes which have this node as an ancestor.
closureOf(T) - Method in interface com.mastfrog.graph.ObjectGraph: Get the closure of this node in the graph - all nodes which are reachable following outbound edges from this node and its descendants.
closureSize(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
closureSize(int) - Method in interface com.mastfrog.graph.IntGraph: Get the count of nodes which have the passed node as an ancestor.
closureSize(T) - Method in interface com.mastfrog.graph.ObjectGraph: Determine the size of the closure of this node, following outbound edges to the bottom of the graph, traversing each node once.
closureUnion(int, int) - Method in interface com.mastfrog.graph.IntGraph: Get the union of the closure of two nodes.
com.mastfrog.graph - package com.mastfrog.graph
com.mastfrog.graph.algorithm - package com.mastfrog.graph.algorithm
com.mastfrog.graph.dynamic - package com.mastfrog.graph.dynamic
compareTo(Score<?>) - Method in interface com.mastfrog.graph.algorithm.Score: Compares scores, sorting higher scores to the top.
compareTo(IntPath) - Method in class com.mastfrog.graph.IntPath
compareTo(ObjectPath) - Method in class com.mastfrog.graph.ObjectPath
connectors() - Method in interface com.mastfrog.graph.IntGraph: Return the set of nodes in the graph which have both inbound and outbound references.
contains(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Determine if this graph contains the item passed.
contains(IntPath) - Method in class com.mastfrog.graph.IntPath: Determine if this path contains the subsequence in the passed path, or is equal to it.
contains(int) - Method in class com.mastfrog.graph.IntPath: Determine if this path contains the passed value.
contains(T) - Method in class com.mastfrog.graph.ObjectPath: Determine if this path contains the passed item.
contains(int, int) - Method in class com.mastfrog.graph.PairSet
contains(T, T) - Method in class com.mastfrog.graph.PairSet.ObjectPairSet
containsEdge(int, int) - Method in interface com.mastfrog.graph.IntGraph: Determine if an edge from a to b exists.
containsPath(ObjectPath<T>) - Method in class com.mastfrog.graph.ObjectPath: Determine if this path contains the sequence of elements in another path.
contents() - Method in class com.mastfrog.graph.ObjectPath: Get all of the contained objects as a set.
copy() - Method in class com.mastfrog.graph.PairSet
copyOf(BitSet) - Static method in class com.mastfrog.graph.BitSetUtils
create(BitSet[], BitSet[]) - Static method in interface com.mastfrog.graph.IntGraph
create(Bits[]) - Static method in interface com.mastfrog.graph.IntGraph
create(BitSet[]) - Static method in interface com.mastfrog.graph.IntGraph
create(Bits[], Bits[]) - Static method in interface com.mastfrog.graph.IntGraph
create(IntGraph, String[]) - Static method in interface com.mastfrog.graph.StringGraph: Create a graph from the passed bit set graph, and a pre-sorted array of unique strings where integer nodes in the passed graph correspond to offsets within the array.
createBooleanParameter(Class<A>, String) - Static method in class com.mastfrog.graph.algorithm.Algorithm
createDoubleParameter(Class<A>, String) - Static method in class com.mastfrog.graph.algorithm.Algorithm
createIntegerParameter(Class<A>, String) - Static method in class com.mastfrog.graph.algorithm.Algorithm

D

DAMPING_FACTOR - Static variable in class com.mastfrog.graph.algorithm.PageRank
depthFirstSearch(int, boolean, IntConsumer) - Method in interface com.mastfrog.graph.IntGraph: Perform a depth-first search, traversing the closure or reverse-closure of the starting node depth-first.
diff(IntGraph, BiConsumer<IntGraph, IntGraph>) - Method in interface com.mastfrog.graph.IntGraph: Compare this graph and another; it is assumed that they have the same size.
disjointNodes() - Method in interface com.mastfrog.graph.IntGraph: Get the set of nodes in the graph whose closure is not shared by any other nodes.
disjunctionOfClosureOfHighestRankedNodes() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
disjunctionOfClosureOfHighestRankedNodes() - Method in interface com.mastfrog.graph.ObjectGraph: This requires some explaining - it is used to pick the initial set of colorings that are active - attempting to find nodes that are likely to be ones someone would want flagged.
distance(T, T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
distance(int, int) - Method in interface com.mastfrog.graph.IntGraph: Get the minimum distance between two nodes.
distance(T, T) - Method in interface com.mastfrog.graph.ObjectGraph: Get the distance along the shortest path between two node.
DynamicGraph<T> - Class in com.mastfrog.graph.dynamic: Implements ObjectGraph over a snapshot which can be recomputed when updated - useful for implementing dynamic graphs whose contents change occasionally but rarely.
DynamicGraph() - Constructor for class com.mastfrog.graph.dynamic.DynamicGraph: Create a graph with the default initial capacity of 128.
DynamicGraph(int) - Constructor for class com.mastfrog.graph.dynamic.DynamicGraph: Create a graph with the passed initial capacity.

E

edges(IntBiConsumer) - Method in interface com.mastfrog.graph.IntGraph: Visit all edges in the graph.
edgeStrings() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
edgeStrings() - Method in interface com.mastfrog.graph.ObjectGraph: For logging convenience, get a list of strings that identify the edges present in this graph.
eigenvectorCentrality() - Static method in class com.mastfrog.graph.algorithm.Algorithm
EigenvectorCentrality - Class in com.mastfrog.graph.algorithm
eigenvectorCentrality() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
eigenvectorCentrality(int, double, boolean, boolean, boolean) - Method in interface com.mastfrog.graph.IntGraph: Compute the eigenvector centrality of each node in the graph - an importance measure that could loosely be phrased as most likely to be connected through - meaning, unlike page rank, this emphasizes "connector" nodes rather than most-linked nodes - those nodes which, if removed, would break the most paths in the graph.
eigenvectorCentrality() - Method in interface com.mastfrog.graph.ObjectGraph: Compute the eigenvector centrality - "most likely to be connected *through*" - score for each node.
end() - Method in class com.mastfrog.graph.IntPath
end() - Method in class com.mastfrog.graph.ObjectPath
enterNode(int, int) - Method in interface com.mastfrog.graph.IntGraphVisitor
enterNode(T, int) - Method in interface com.mastfrog.graph.ObjectGraphVisitor: Enter a node; subsequent calls to enterNode before a call to exitNode means the subsequent nodes are referenced by the previous one.
equals(Object) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
equals(Object) - Method in class com.mastfrog.graph.IntPath
equals(Object) - Method in class com.mastfrog.graph.ObjectPath
equals(Object) - Method in class com.mastfrog.graph.PairSet
exitNode(int, int) - Method in interface com.mastfrog.graph.IntGraphVisitor
exitNode(T, int) - Method in interface com.mastfrog.graph.ObjectGraphVisitor: Called when the last child of a node has been visited.

F

first() - Method in class com.mastfrog.graph.IntPath: Get the first path element
first() - Method in class com.mastfrog.graph.ObjectPath: Returns the first element.
forEach(BitSet, IntConsumer) - Static method in class com.mastfrog.graph.BitSetUtils
forEach(IntBiConsumer) - Method in class com.mastfrog.graph.PairSet
forEachInt(IntConsumer) - Method in class com.mastfrog.graph.IntPath: Iterate all elements of the path, passing them to the passed consumer.
forEachIntReversed(IntConsumer) - Method in class com.mastfrog.graph.IntPath: Iterate all elements of the path in reverse order, passing them to the passed consumer.
fromIntArray(int[][]) - Static method in class com.mastfrog.graph.PairSet

G

get(int) - Method in class com.mastfrog.graph.IntPath: Get the path element at the specified index.
get(int) - Method in class com.mastfrog.graph.ObjectPath: Get the path element at index i.

H

hasEdge(T, T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Determine if an outbound edge is present from depender to dependee.
hashCode() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
hashCode() - Method in class com.mastfrog.graph.IntPath
hashCode() - Method in class com.mastfrog.graph.ObjectPath
hashCode() - Method in class com.mastfrog.graph.PairSet
hasInboundEdge(int, int) - Method in interface com.mastfrog.graph.IntGraph: Determine if a direct inbound edge exits from one node to another.
hasOutboundEdge(int, int) - Method in interface com.mastfrog.graph.IntGraph: Determine if a direct outbound edge exits from one node to another.

I

IGNORE_SELF_EDGES - Static variable in class com.mastfrog.graph.algorithm.EigenvectorCentrality
inboundReferenceCount(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
inboundReferenceCount(int) - Method in interface com.mastfrog.graph.IntGraph: Returns the number of inbound edges a node has.
inboundReferenceCount(T) - Method in interface com.mastfrog.graph.ObjectGraph: Count the number of nodes that have outbound edges to the passed node.
indexOf(int) - Method in class com.mastfrog.graph.IntPath: Get the first occurrence of the passed value in this path.
indexOf(T) - Method in class com.mastfrog.graph.ObjectPath: Get the (first) index of an item in this path.
intersects(PairSet) - Method in class com.mastfrog.graph.PairSet
IntGraph - Interface in com.mastfrog.graph
IntGraphBuilder - Class in com.mastfrog.graph: Builder for graphs.
IntGraphVisitor - Interface in com.mastfrog.graph: Visitor interface for BitSetGraph, a graph which maps integer nodes to other integer nodes.
IntPath - Class in com.mastfrog.graph: A finite path between two elements in a graph.
inverse() - Method in class com.mastfrog.graph.PairSet
invert(BitSet) - Static method in class com.mastfrog.graph.BitSetUtils
invert(BitSet, int) - Static method in class com.mastfrog.graph.BitSetUtils
isEmpty() - Method in class com.mastfrog.graph.IntPath: Determine if this path is empty.
isEmpty() - Method in class com.mastfrog.graph.ObjectPath: Determine if this path is empty.
isEmpty() - Method in class com.mastfrog.graph.PairSet
isIndirectlyRecursive(int) - Method in interface com.mastfrog.graph.IntGraph: Determine if a node is indirectly recursive - if the closure of it contains a cycle back to it, not counting cycles to itself.
isNotAPath() - Method in class com.mastfrog.graph.IntPath: Determine if this path does not represent an actual path - if it has one element or less.
isNotAPath() - Method in class com.mastfrog.graph.ObjectPath: Determine if this path does not represent an actual path - if it has one element or less.
isReachableFrom(int, int) - Method in interface com.mastfrog.graph.IntGraph: Determine if node b is contained in the closure of node a.
isRecursive(int) - Method in interface com.mastfrog.graph.IntGraph: Determine if the passed node or a descendant of it has a cycle back to itself.
isReverseReachableFrom(int, int) - Method in interface com.mastfrog.graph.IntGraph: Determine if the closure of a includes b.
isUnreferenced(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
isUnreferenced(int) - Method in interface com.mastfrog.graph.IntGraph: Determine if a node has no inbound edges - no ancestors.
isUnreferenced(T) - Method in interface com.mastfrog.graph.ObjectGraph: Returns true if this node has no inbound edges.
items() - Method in class com.mastfrog.graph.IntPath: Get the contents of this path as an int[].
iterate(IntConsumer) - Method in class com.mastfrog.graph.IntPath: Deprecated.
use the better-named forEachInt()
iterator() - Method in class com.mastfrog.graph.IntPath
iterator() - Method in class com.mastfrog.graph.ObjectPath
iterator() - Method in class com.mastfrog.graph.PairSet
iterator() - Method in class com.mastfrog.graph.PairSet.ObjectPairSet

L

last() - Method in class com.mastfrog.graph.IntPath: Get the last path element
last() - Method in class com.mastfrog.graph.ObjectPath: Returns the last element.
lastIndexOf(int) - Method in class com.mastfrog.graph.IntPath: Get the first occurrence of the passed value in this path.
lastIndexOf(T) - Method in class com.mastfrog.graph.ObjectPath: Get the (first) index of an item in this path.
load(C, IOFunction<ByteBuffer, T>) - Static method in class com.mastfrog.graph.dynamic.DynamicGraph: Load a graph from a FileChannel or similar.
load(ObjectInputStream) - Static method in interface com.mastfrog.graph.IntGraph
load(ObjectInput) - Static method in interface com.mastfrog.graph.StringGraph

M

MAXIMUM_ITERATIONS - Static variable in class com.mastfrog.graph.algorithm.EigenvectorCentrality
MAXIMUM_ITERATIONS - Static variable in class com.mastfrog.graph.algorithm.PageRank
MINIMUM_DIFFERENCE - Static variable in class com.mastfrog.graph.algorithm.EigenvectorCentrality
MINIMUM_DIFFERENCE - Static variable in class com.mastfrog.graph.algorithm.PageRank

N

neighbors(int) - Method in interface com.mastfrog.graph.IntGraph: Get the set of parent and child nodes for a node.
node() - Method in interface com.mastfrog.graph.algorithm.Score: The name of graph node
nodeId() - Method in interface com.mastfrog.graph.algorithm.Score: The integer index of the node in the underlying graph.
NORMALIZE - Static variable in class com.mastfrog.graph.algorithm.EigenvectorCentrality
NORMALIZE - Static variable in class com.mastfrog.graph.algorithm.PageRank

O

ObjectGraph<T> - Interface in com.mastfrog.graph
ObjectGraphVisitor<T> - Interface in com.mastfrog.graph: Visitor interface for traversing graphs.
ObjectPath<T> - Class in com.mastfrog.graph: One path in an object graph.
omitting(Set<T>) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
omitting(int...) - Method in interface com.mastfrog.graph.IntGraph: Create a new graph, sans the passed array of items - the resulting graph will be smaller and if mapped to objects, have different indices than the original.
omitting(Set<T>) - Method in interface com.mastfrog.graph.ObjectGraph: Create a copy of this graph, omitting the passed set of items.
orphans() - Method in interface com.mastfrog.graph.IntGraph: Return the set of nodes which have no edges in or out.
outboundReferenceCount(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
outboundReferenceCount(int) - Method in interface com.mastfrog.graph.IntGraph: Returns the number of outbound edges a node has.
outboundReferenceCount(T) - Method in interface com.mastfrog.graph.ObjectGraph: Count the number of nodes this node has outbound edges to.

P

pageRank() - Static method in class com.mastfrog.graph.algorithm.Algorithm
PageRank - Class in com.mastfrog.graph.algorithm
pageRank() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
pageRank(double, double, int, boolean) - Method in interface com.mastfrog.graph.IntGraph: Rank the nodes in this graph according to the page rank algorithm, which detects most-linked-to nodes in the graph.
pageRank() - Method in interface com.mastfrog.graph.ObjectGraph: Compute the pagerank score of every node in the graph.
pairCount() - Method in class com.mastfrog.graph.PairSet
PairSet - Class in com.mastfrog.graph: Tracks a set of pairs of coordinates in a coordinate space that have been visited.
PairSet.ObjectPairSet<T> - Class in com.mastfrog.graph
parentPath() - Method in class com.mastfrog.graph.IntPath: Create a new path, lopping off the last element.
parentPath() - Method in class com.mastfrog.graph.ObjectPath: Get a copy of this path, lopping off the last element.
parents(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
parents(int) - Method in interface com.mastfrog.graph.IntGraph: Get the set of nodes which reference the passed node.
parents(T) - Method in interface com.mastfrog.graph.ObjectGraph: Get the set of strings which are immediate parent nodes to a given one (if the graph is cyclic, this may include the node name passed).
pathsBetween(T, T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
pathsBetween(int, int) - Method in interface com.mastfrog.graph.IntGraph: Get a list of all paths between the source and target node, sorted low to high by length.
pathsBetween(T, T) - Method in interface com.mastfrog.graph.ObjectGraph: Get the set of paths that exist between two nodes.
prepending(int) - Method in class com.mastfrog.graph.IntPath: Create a new path prepending the passed value.
prepending(T) - Method in class com.mastfrog.graph.ObjectPath: Create a new path prepending the passed object.

R

RankingAlgorithm<A extends RankingAlgorithm> - Class in com.mastfrog.graph.algorithm
readBitSet(ByteBuffer, int) - Static method in class com.mastfrog.graph.dynamic.DynamicGraph
remove(int, int) - Method in class com.mastfrog.graph.PairSet
removeAllReferencesTo(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Remove an item and all edges connected to it from the graph.
removeEdge(T, T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Remove an edge between two items.
removingAll(PairSet) - Method in class com.mastfrog.graph.PairSet
retainAll(PairSet) - Method in class com.mastfrog.graph.PairSet
reverseClosureOf(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
reverseClosureOf(int) - Method in interface com.mastfrog.graph.IntGraph: Collect the reverse closure of a node - the set of all nodes which have an outbound edge to this one or an ancestor of those nodes.
reverseClosureOf(T) - Method in interface com.mastfrog.graph.ObjectGraph: Get the reverse closure of a node in the graph - all nodes which have an outbound edge to this node, and all nodes which have an outbound edge to one of those, and so forth, to the top of the graph.
reverseClosureSize(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
reverseClosureSize(int) - Method in interface com.mastfrog.graph.IntGraph: Get the count of nodes which have the passed node as a descendant.
reverseClosureSize(T) - Method in interface com.mastfrog.graph.ObjectGraph: Determine the size of the inverse closure of this node, following inbound edges to the top of the graph, traversing each node once.
reversed() - Method in class com.mastfrog.graph.IntPath: Create a new path whose elements are this one's in reverse order.
reversed() - Method in class com.mastfrog.graph.ObjectPath: Create a new path whose elements are this one's in reverse order.
revision() - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Get the number of changes that have been made to this graph since its creation; typically used to determine if the graph has changed since some computation was performed.

S

save(ObjectOutput) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
save(ObjectOutput) - Method in interface com.mastfrog.graph.IntGraph: Serialize this graph.
save(ObjectOutput) - Method in interface com.mastfrog.graph.ObjectGraph: Optimized serialization support.
save(ObjectOutput) - Method in interface com.mastfrog.graph.StringGraph: Optimized serialization support.
Score<T> - Interface in com.mastfrog.graph.algorithm: Implementation over strings of the scores as returned by page rank and eigenvector centrality algorithms.
score() - Method in interface com.mastfrog.graph.algorithm.Score: The score of the graph node, relative to others.
setOutboundEdges(T, Set<T>) - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Set the outbound edges from an item, removing any edges that previously existed which are not present in the passed set.
setParameter(Algorithm.IntParameter<A>, int) - Method in class com.mastfrog.graph.algorithm.Algorithm
setParameter(Algorithm.DoubleParameter<A>, double) - Method in class com.mastfrog.graph.algorithm.Algorithm
setParameter(Algorithm.BooleanParameter<A>, boolean) - Method in class com.mastfrog.graph.algorithm.Algorithm
setParameter(Algorithm.DoubleParameter<EigenvectorCentrality>, double) - Method in class com.mastfrog.graph.algorithm.EigenvectorCentrality
setParameter(Algorithm.IntParameter<EigenvectorCentrality>, int) - Method in class com.mastfrog.graph.algorithm.EigenvectorCentrality
setParameter(Algorithm.BooleanParameter<EigenvectorCentrality>, boolean) - Method in class com.mastfrog.graph.algorithm.EigenvectorCentrality
setParameter(Algorithm.BooleanParameter<PageRank>, boolean) - Method in class com.mastfrog.graph.algorithm.PageRank
setParameter(Algorithm.DoubleParameter<PageRank>, double) - Method in class com.mastfrog.graph.algorithm.PageRank
setParameter(Algorithm.IntParameter<PageRank>, int) - Method in class com.mastfrog.graph.algorithm.PageRank
shortestPathBetween(int, int) - Method in interface com.mastfrog.graph.IntGraph: Get the shortest path between two nodes in the graph.
shortestUndirectedPathBetween(int, int) - Method in interface com.mastfrog.graph.IntGraph: Get the shortest undirected path between two nodes.
size() - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Returns the number of items belonging to this graph.
size() - Method in interface com.mastfrog.graph.IntGraph: Get the maximum node id + 1 of this graph, or the number of logical nodes.
size() - Method in class com.mastfrog.graph.IntPath: Get the number of elements in this path.
size() - Method in interface com.mastfrog.graph.ObjectGraph: Get the number of elements in this graph.
size() - Method in class com.mastfrog.graph.ObjectPath: Get the number of elements in this path.
size() - Method in class com.mastfrog.graph.PairSet.ObjectPairSet
size() - Method in class com.mastfrog.graph.PairSet
start() - Method in class com.mastfrog.graph.IntPath
start() - Method in class com.mastfrog.graph.ObjectPath
store(C, IOToIntBiFunction<T, C>) - Method in class com.mastfrog.graph.dynamic.DynamicGraph: Store this graph to a FileChannel or similar.
StringGraph - Interface in com.mastfrog.graph

T

toGraph() - Method in class com.mastfrog.graph.PairSet
toIntGraph(BiConsumer<IndexedResolvable<? extends T>, IntGraph>) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
toIntGraph(BiConsumer<IndexedResolvable<? extends T>, IntGraph>) - Method in interface com.mastfrog.graph.ObjectGraph: Convert this graph to its (usually internal) IntGraph, needed for serialization.
toNode(int) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
toNode(int) - Method in interface com.mastfrog.graph.ObjectGraph: Get the node for an index.
toNodeId(T) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
toNodeId(T) - Method in interface com.mastfrog.graph.ObjectGraph: Get the integer id used internally for a node.
toObjectGraph(List<T>) - Method in interface com.mastfrog.graph.IntGraph
toObjectPairSet(IndexedResolvable<T>) - Method in class com.mastfrog.graph.PairSet
toObjectPath(IndexedResolvable<T>) - Method in class com.mastfrog.graph.IntPath
toPairSet() - Method in interface com.mastfrog.graph.IntGraph: Convert this graph to a PairSet, which internally uses a single Bits of size * size bits to represent the matrix of all edges.
topLevelOrOrphanNodes() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
topLevelOrOrphanNodes() - Method in interface com.mastfrog.graph.IntGraph: Get the set of nodes which have no inbound edges - no ancestors.
topLevelOrOrphanNodes() - Method in interface com.mastfrog.graph.ObjectGraph: Get the set of nodes which have no inbound edges.
toString() - Method in class com.mastfrog.graph.algorithm.Algorithm
toString() - Method in class com.mastfrog.graph.dynamic.DynamicGraph
toString() - Method in class com.mastfrog.graph.IntPath
toString() - Method in class com.mastfrog.graph.ObjectPath
toString() - Method in class com.mastfrog.graph.PairSet
toStringGraph(String[]) - Method in interface com.mastfrog.graph.IntGraph
totalCardinality() - Method in interface com.mastfrog.graph.IntGraph: Get the combined cardinality of all nodes in this graph - the total number of edges.

U

undirectedPathsBetween(int, int) - Method in interface com.mastfrog.graph.IntGraph: Get a list of all inbound and outbound paths between two nodes.
USE_IN_EDGES - Static variable in class com.mastfrog.graph.algorithm.EigenvectorCentrality

W

walk(ObjectGraphVisitor<? super T>) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
walk(T, ObjectGraphVisitor<? super T>) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
walk(IntGraphVisitor) - Method in interface com.mastfrog.graph.IntGraph: Walk the closure of the graph from top level nodes.
walk(int, IntGraphVisitor) - Method in interface com.mastfrog.graph.IntGraph: Walk the closure of a node.
walk(ObjectGraphVisitor<? super T>) - Method in interface com.mastfrog.graph.ObjectGraph: Walk the tree of nodes in some order, such that each node is only visited once.
walk(T, ObjectGraphVisitor<? super T>) - Method in interface com.mastfrog.graph.ObjectGraph: Walk the tree of node definitions and node references in some order, starting from the passed starting node.
walkUpwards(T, ObjectGraphVisitor<? super T>) - Method in class com.mastfrog.graph.dynamic.DynamicGraph
walkUpwards(IntGraphVisitor) - Method in interface com.mastfrog.graph.IntGraph: Walk the inverse closure of the bottom-most nodes in the graph.
walkUpwards(int, IntGraphVisitor) - Method in interface com.mastfrog.graph.IntGraph: Walk the inverse closure of one node, visiting each ancestor exactly once.
walkUpwards(T, ObjectGraphVisitor<? super T>) - Method in interface com.mastfrog.graph.ObjectGraph: Walk the antecedents of a node.
writeBitSet(BitSet, C, ByteBuffer) - Static method in class com.mastfrog.graph.dynamic.DynamicGraph

A B C D E F G H I L M N O P R S T U W