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

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

addAll(int...) - Method in class com.mastfrog.graph.IntPath

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.

apply(RankingAlgorithm<?>) - Method in interface com.mastfrog.graph.ObjectGraph

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

arraysEquals(int[], int, int, int[], int, int) - Static method in class com.mastfrog.graph.IntPath

B

BitSetUtils - Class in com.mastfrog.graph

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 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 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

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).

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(int, int) - Method in interface com.mastfrog.graph.IntGraph

Get the disjunction of the closure of two 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(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(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

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(int) - Method in class com.mastfrog.graph.IntPath

contains(int, int) - Method in class com.mastfrog.graph.PairSet

contains(IntPath) - Method in class com.mastfrog.graph.IntPath

contains(T) - Method in class com.mastfrog.graph.ObjectPath

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

copy() - Method in class com.mastfrog.graph.PairSet

copyOf(BitSet) - Static method in class com.mastfrog.graph.BitSetUtils

create(Bits[]) - 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.

create(BitSet[]) - Static method in interface com.mastfrog.graph.IntGraph

create(BitSet[], BitSet[]) - Static method in interface com.mastfrog.graph.IntGraph

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.

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 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(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.

E

edges(IntBiConsumer) - Method in interface com.mastfrog.graph.IntGraph

Visit all edges in the graph.

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() - Method in interface com.mastfrog.graph.ObjectGraph

Compute the eigenvector centrality - "most likely to be connected *through*" - score for each node.

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 - Class in com.mastfrog.graph.algorithm

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.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

first() - Method in class com.mastfrog.graph.ObjectPath

forEach(IntBiConsumer) - Method in class com.mastfrog.graph.PairSet

forEach(BitSet, IntConsumer) - Static method in class com.mastfrog.graph.BitSetUtils

fromIntArray(int[][]) - Static method in class com.mastfrog.graph.PairSet

G

get(int) - Method in class com.mastfrog.graph.IntPath

get(int) - Method in class com.mastfrog.graph.ObjectPath

H

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(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

indexOf(T) - Method in class com.mastfrog.graph.ObjectPath

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 path through 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

isEmpty() - Method in class com.mastfrog.graph.ObjectPath

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.

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(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

iterate(IntConsumer) - Method in class com.mastfrog.graph.IntPath

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

last() - Method in class com.mastfrog.graph.ObjectPath

load(ObjectInput) - Static method in interface com.mastfrog.graph.StringGraph

load(ObjectInputStream) - Static method in interface com.mastfrog.graph.IntGraph

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.

orphans() - Method in interface com.mastfrog.graph.IntGraph

Return the set of nodes which have no edges in or out.

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() - Method in interface com.mastfrog.graph.ObjectGraph

Compute the pagerank score of every node in the graph.

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 - Class in com.mastfrog.graph.algorithm

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

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(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

R

RankingAlgorithm<A extends RankingAlgorithm> - Class in com.mastfrog.graph.algorithm

remove(int, int) - Method in class com.mastfrog.graph.PairSet

removingAll(PairSet) - Method in class com.mastfrog.graph.PairSet

retainAll(PairSet) - Method in class com.mastfrog.graph.PairSet

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(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

S

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() - Method in interface com.mastfrog.graph.algorithm.Score

The score of the graph node, relative to others.

Score<T> - Interface in com.mastfrog.graph.algorithm

Implementation over strings of the scores as returned by page rank and eigenvector centrality algorithms.

setParameter(Algorithm.BooleanParameter<A>, boolean) - Method in class com.mastfrog.graph.algorithm.Algorithm

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<A>, double) - Method in class com.mastfrog.graph.algorithm.Algorithm

setParameter(Algorithm.DoubleParameter<EigenvectorCentrality>, double) - Method in class com.mastfrog.graph.algorithm.EigenvectorCentrality

setParameter(Algorithm.DoubleParameter<PageRank>, double) - Method in class com.mastfrog.graph.algorithm.PageRank

setParameter(Algorithm.IntParameter<A>, int) - Method in class com.mastfrog.graph.algorithm.Algorithm

setParameter(Algorithm.IntParameter<EigenvectorCentrality>, int) - Method in class com.mastfrog.graph.algorithm.EigenvectorCentrality

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

size() - Method in interface com.mastfrog.graph.IntGraph

Get the maximum node id + 1 of this graph, or the number of nodes.

size() - Method in class com.mastfrog.graph.IntPath

size() - Method in class com.mastfrog.graph.ObjectPath

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

StringGraph - Interface in com.mastfrog.graph

T

toGraph() - Method in class com.mastfrog.graph.PairSet

toNode(int) - Method in interface com.mastfrog.graph.ObjectGraph

toNodeId(T) - Method in interface com.mastfrog.graph.ObjectGraph

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 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.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

USE_IN_EDGES - Static variable in class com.mastfrog.graph.algorithm.EigenvectorCentrality

W

walk(int, IntGraphVisitor) - Method in interface com.mastfrog.graph.IntGraph

Walk the closure of a node.

walk(IntGraphVisitor) - Method in interface com.mastfrog.graph.IntGraph

Walk the closure of the graph from top level nodes.

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(int, IntGraphVisitor) - Method in interface com.mastfrog.graph.IntGraph

Walk the inverse closure of one node, visiting each ancestor exactly once.

walkUpwards(IntGraphVisitor) - Method in interface com.mastfrog.graph.IntGraph

Walk the inverse closure of the bottom-most nodes in the graph.

walkUpwards(T, ObjectGraphVisitor<? super T>) - Method in interface com.mastfrog.graph.ObjectGraph

Walk the antecedents of a node.

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