All Classes and Interfaces
Class
Description
Abstract class for finding the isomorphism between two graphs.
Abstract class for the state of the search algorithm.
Abstract class for the Ullman's algorithm: exact isomorphism and subgraph isomorphism.
Abstract class for the VF2(Vento Foggia) algorithm.
An acyclic orientation of an undirected graph is an assignment of a
direction to each edge (an orientation) that does not form any directed cycle
and therefore makes it into a directed acyclic graph.
This exception is thrown by
Base58, and the hierarchy of
classes when you try to decode data and a character isn't valid.This exception is thrown by
Base58, and the hierarchy of
classes when you try to decode data and the checksum isn't valid.This exception is thrown by
Base58, {} and the hierarchy of
classes when you try to decode data and the data isn't of the right size.This exception is thrown by the hierarchy of classes when you try and decode an
address or private key with an invalid prefix (version header or human-readable part).
This exception is thrown by the hierarchy of classes when you try and decode an
address with a prefix (version header or human-readable part) that used by another network (usually: mainnet vs
testnet).
xxxxx.
AES for support SkyLogicSystem security.
Encrypts data and files using AES CBC/CFB - 128/192/256 bits.
xxx class.
A contract for all-pairs shortest path algorithms.
The general Annotation utility for use in SkyLogicSystem.
A* algorithm finds the shortest path from a specified source vertex to a
specified target vertex.
Estimates the cost of the shortest path from a vertex to the target.
Euclidean distance.
Manhattan distance.
A class that contains all the methods to generate a QR code and validate the code
The Cache utility class for use in Service gate support class.
xxx class.
Attempts at finding an optimum bandwith coloring of a graph using a
systematic exploration of the search space.
Attempts at finding the optimum coloring of a graph using a systematic
exploration of the search space.
Attempts at finding the optimum coloring of a graph using a systematic
exploration of the search space.
Attempts at finding an optimum equitable coloring of the vertices of a graph
using a systematic exploration of the search space.
Backtracking algorithm for determining the longest path in a graph (directed
or not).
WORK IN PROGRESS.
The Barabási–Albert (BA) model generates random scale-free networks using a
preferential attachment mechanism.
xxx class.
XXX Utility.
Bellman-Ford-Moore's algorithm finds the shortest paths between a source
vertex and all the other vertices in a graph.
Determines the shortest paths between all pairs of vertices, in an unweighted
graph, using breadth-first traversals.
Iterates over all cliques in a graph in a BFS manner.
A breadth first search (BFS) iterator over the vertices of the graph.
Determines the path with the fewest edges connecting two vertices.
Determines the shortest paths from a source vertex to all other vertices, in
an unweighted graph, using a breadth-first traversal.
A breadth first search (BFS) traverser of the graph.
A breadth first search (BFS) visitor of a graph.
Determines the shortest path between two vertices.
Support class for bipartite graphs.
The bipartite graph realization problem is to determine whether
there exists a bipartite graph having a specified sequence of degrees for
vertices in each partition set.
A block of a graph is a maximal 2-connected subgraph (it has no cut
vertex).
Base class for Boruvka's minimum spanning tree implementations.
Boruvka algorithm for finding a minimum spanning tree.
Parallel implementation of the Boruvka algorithm for finding a minimum
spanning tree.
Deprecated.
A bridge in an undirected graph is defined as an edge which, when removed,
increases the number of connected components in the graph).
Deprecated.
Iterates over all the maximal cliques of a graph.
The Cache utility class for use in Service gate support class.
The Cache utility class for use in Service gate support class.
This provides static methods to convert comma delimited text into a
JSONArray, and to covert a JSONArray into comma delimited text.
Support class for chordal graphs.
A circuit is a trail whose last vertex is connected to the first one.
A clique is a set of vertices of a graph such that any two of them
are adjacent.
Iterates over all cliques of a graph.
A coloring of the vertices of a graph.
Generator for complete bipartite graphs.
Generates complete graphs or digraphs.
Generator for complete multipartite graphs.
Generates complete trees.
CompressUtil.
Determines the connected components of a graph.
Convert a web browser cookie specification to a JSONObject and back.
Convert a web browser cookie list string to a JSONObject and back.
Creates key pair in the specified file.
Shows how to create license.
The xxx utility class for use in xxx class.
XXX Utility.
A cycle is a closed path, meaning that the last vertex of the path is
connected to the first one.
Algorithms for finding cycles in a directed or undirected graph.
A cycle graph consists of a single cycle.
The general datetime utility for use in SkyLogicSystem.
The general string utility for use in SkyLogicSystem.
Database SkyLogicSyste.
Debug Utility.
Iterates over all cliques in a graph in a DFS manner.
A depth first search (DFS) iterator over the vertices of the graph.
A depth first search (DFS) traverser of the graph.
A depth first search (DFS) visitor of a graph.
Class containing the diff, match and patch methods.
Class representing one diff operation.
Internal class for returning results from diff_linesToChars().
The data structure representing a diff is a Linked list of Diff objects:
{Diff(Operation.DELETE, "Hello"), Diff(Operation.INSERT, "Goodbye"),
Diff(Operation.EQUAL, " world.")} which means: delete "Hello", add
"Goodbye" and keep " world."
Class representing one patch operation.
Represents a directed graph.
The digraph realization problem is to determine whether there exists
a directed graph having a specified sequence of in-degrees and out-degrees
for each vertex.
Dijkstra's algorithm finds the minimum cost paths between a vertex (called
source) and all the other vertices in a graph, with the condition that there
are no negative weighted edges.
Implementation of Dijkstra's algorithm that iterates through the unsolved
vertices in order to select the optimal vertex at each step.
Implementation of Dijkstra's algorithm that uses a heap in order to select
the optimal vertex at each step.
c comments
p edge number-of-nodes number-of-edges
e edge-source1 edge-target1 weight
e edge-source2 edge-target2 weight
http://prolland.free.fr/works/research/dsat/dimacs.html
https://www.diag.uniroma1.it//challenge9/format.shtml#graph
/**
Implements the Dinic algorithm for finding the maximum flow in a network.
DiNOQ KEY.
Abstract class for algorithms that accept only directed graphs as input.
Multiple (parallel) edges are allowed.
Multiple (parallel) edges are allowed.
A domain of available non-negative values for a vertex.
An edge is a pair of vertices.
Deprecated.
Determines a maximum size set of edge disjoint paths between two vertices, a
minimum size set of edges whose removal disconnects two vertices, the minimum
cardinality edge cut and the edge connectivity number.
Utility class for representing an edge cut.
Generates costs for the edges of a network.
An iterator over all the edges of a graph.
A set of edges in a graph.
Generates weights for the edges of a graph.
The Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method
for computing the maximum flow in a network.
TODO
Goldberg, p.95
The Cache utility class for use in Service gate support class.
An Eulerian circuit is an Eulerian trail (a trail that contains all
the edges of the graph) that has its endpoints connected.
Before running this Java V2 code example, set up your development
environment, including your credentials.
Base class for exact vertex coloring algorithms.
A Reader that provides some additional functionality, such as peek().
Generates fan graphs.
How to create an FDF file.
FileUtil.
Utility class for representing the flow of a network.
Floyd-Warshall's algorithm finds the shortest paths between all pairs of
vertices in an edge-weighted directed graph.
Algorithm for testing isomorphism of undirected forests.
The Cache utility class for use in Service gate support class.
An example of using the Unified Gen AI Java SDK to do operations on cached content.
An example of asynchronously using the Unified Gen AI Java SDK to do operations on cached
content.
An example of how to use the Files module to upload, retrieve, list, and delete files.
xxx class.
GMail Utility.
...
...
Simple class for creating, reading and modifying text blobs on Google Cloud
...
xxx class.
xxx class.
...
The base data type for all graphs: directed or not, weighted or not, labeled
or not, allowing self loops and multiple edges or not.
Represents an algorithm that accepts any graph as input, directed or not.
Support class for creating a graph of any type.
Static methods for generating various standard graphs.
Interface class for graph isomorphism.
Various sizes related to graphs.
Various distances related to a graph.
The graph realization problem is to determine whether a given degree
sequence can be represented by a simple, undirected graph.
Static utility methods that operate on or return graphs, either directed or
undirected.
Greedy coloring is a simple heuristic algorithm that assigns colors to the
vertices of a graph in a greedy manner, that is, by selecting the smallest
possible color that has not yet been used by any of the neighboring vertices.
Creates an equitable coloring in a greedy manner.
Greedy algorithm to create a weighted matching.
A two-dimensional m x n grid graph is the Cartesian product of the path
graphs Pm and Pn (m is the number of rows, n is the number of columns).
A Hamiltonian (or spanning) cycle is a cycle that contains all
vertices of the graph.
A Hamiltonian path is a path that contains all vertices of the
graph.
This class provides a method to generate a bipartite graph from a given
sequence of degrees, using an adaptation of the Havel-Hakimi algorithm.
This class provides a method to generate a graph from a given degree
sequence, using the Havel-Hakimi algorithm.
An Eulerian trail is a trail visits every edge exactly once.
HMAC Encryption utility.
Computes the maximum cardinality matching in a bipartite graph.
HTML to JSON.
HTML to SS.
HTML to SS.
* HTML filtering utility for protecting against XSS (Cross Site Scripting).
Created by saksit on 3/10/2016 AD.
Convert an HTTP header to a JSONObject and back.
XXX Utility.
The HTTPTokener extends the JSONTokener to provide additional methods
for the parsing of HTTP headers.
Used for transform XML to java object and java object to XML.
ImageUtility.
Utility class for working with arrays of integers.
Adapted after the implementation of IntHashMap in Apache Commons Collection.
An iterator over a collection of primitive integers.
The general IpAddress Utility for use in SkyLogicSystem.
An immutable one-to-one correspondence (bijection) between the vertices of two
graphs that preserves the edge connections.
Interface for graph isomorphism algorithms.
SkyLogic Charset Filter
SkyLogic Security Context
The servlet listener for add and remove object map when client access.
The Cache utility class for use in Service gate support class.
Johnson's algorithm finds the shortest paths between all pairs of vertices in
an edge-weighted directed graph.
JavaScript to SS.
...
A JSONArray is an ordered sequence of values.
The JSONException is thrown by the JSON.org classes when things are amiss.
This provides static methods to convert an XML text into a JSONArray or
JSONObject, and to covert a JSONArray or JSONObject into an XML text using
the JsonML transform.
A JSONObject is an unordered collection of name/value pairs.
The
JSONString interface allows a toJSONString()
method so that a class can change the behavior of
JSONObject.toString(), JSONArray.toString(),
and JSONWriter.value(Object).JSONStringer provides a quick and convenient way of producing JSON text.
A JSONTokener takes a source string and extracts characters and tokens from
it.
....
JSONWriter provides a quick and convenient way of producing JSON text.
...
...
Key Manager for support SkyLogicSystem security.
Key Principal Creator.
This class provides a method to generate a directed graph from a given
sequence of in-degrees and out-degrees, using the Kleitman-Wang algorithm.
Kruskal's algorithm for finding a minimum spanning tree.
A Lexicographic Breadth-First Search (Lex-BFS) is an algorithm for ordering
the vertices of a graph.
Deprecated.
xxx.
xxx.
xxx.
xxx.
XXX Utility.
XXX Utility.
...
Load properties of SkyLogicSyste.
A location has a name and some neighbors, that is another locations it is
connected to.
Mail Profile.
A matching or independent edge set is a set of edges
without common vertices.
The contract for matching algorithms.
Creates a maximal cardinality matching either randomly or using a
simple heuristic.
Consider a social network formed by persons (instances of the class
Person), each person being friends with other persons (the
relationship is symmetrical).Computes a maximal clique.
Iterates over all maximal cliques of a graph.
Implements an iterator that performs Maximum Cardinality Search (MCS)
algorithm on an undirected graph.
Contract for algorithms that computeMaximumFlow a maximum flow in a transportation
network.
Computes the maximum induced path.
The Cache utility class for use in Service gate support class.
xxx
A minimum spanning tree (MST) is an acyclic subgraph of an
edge-weighted undirected graph, that connects all the vertices, with the
minimum possible total edge weight.
Base class for minimum spanning tree algorithms.
Iterates over the minimum spanning trees of a weighted graph.
The Cache utility class for use in Service gate support class.
Multiple (parallel) edges are allowed.
Support Multi-Part Form in HTTP Post.
Generates Mycielski graphs.
Enables iteration over the edges incident with a source vertex, returning one
by one the neighbors of the source along with information regarding the
corresponding edge.
Represents a single commodity transportation (flow) network.
Support class for creating transportation (flow) networks.
The Cache utility class for use in Service gate support class.
A node in the backtrack coloring search tree.
The general string utility for use in SkyLogicSystem.
XXX Utility.
Class that orders the vertices of a digraph according to their degree.
Utility class describing a generic pair of values.
The algorithm finds a Hamiltonian cycle in an undirected simple graph that
satisfies Ore's condition:
deg(v) + deg(u) >= |V(G)|, for
every pair of distinct non-adjacent vertices v and u.Parallel implementation of the Filter-Kruskal algorithm for finding a minimum
spanning tree.
Password Encryption utility.
Password generator utility.
A path is a trail with no duplicate vertices.
Algorithms for finding paths in unweighted directed or undirected graph.
A path graph consists of a single path.
...
Comparison and conversion of various map API coordinate systems;
WGS84 coordinate system: the earth coordinate system, the international coordinate system.
XXX Utility.
Enables iteration over the edges incident to a target vertex, returning
one by one the predecessors of the target along with information regarding
the corresponding edge.
Implementation of Prim's algorithm that uses a binary heap.
ProcessTimeControl class - used for stopping a thread that is taking too long
Decodes a Prufer sequence to a tree.
Encodes a tree to its Prufer sequence.
Self loops and multiple (parallel) edges are allowed.
The Push-Relabel algorithm maintains a preflow (where flow into a node can
exceed flow out of it) and repeatedly pushes excess flow from overflowing
vertices to neighboring vertices or relabels the height of the overflowing
vertices to find new paths.
xxx class.
The xxx utility class for use in xxx class.
The Cache utility class for use in Service gate support class.
Radix sort is a non-comparative integer sorting algorithm that sorts data
with integer keys by grouping keys by the individual digits which share the
same significant position and value.
RandomAlphaNum generator utility.
Generates a random chordal graph.
Generates a random directed acyclic graph (DAG).
Generates a random forest.
Random bipartite graph generator using Erdős–Rényi G(n,m) model.
Erdős–Rényi G(n,m) model.
Random bipartite graph generator using Erdős–Rényi G(n,p) model.
Generator for Erdős–Rényi G(n,p) model.
Creates a random Hamiltonian graph or digraph.
Generates a random k-Nearest Neighbor Graph (KNNG).
Generates a random layered graph.
Generator for random multipartite graphs.
Generates a random simple undirected graph that satisfies Ore's condition:
deg(v) + deg(u) >= |V(G)|, for every pair of distinct
non-adjacent vertices v and u.Generates a random tree or arborescence.
Generates random unit disk graphs.
The Cache utility class for use in Service gate support class.
Generates a regular graph.
Algorithm for testing isomorphism of forests with specified roots.
Utility class representing a tree with a node designated as root.
Algorithm for testing isomorphism of rooted trees.
...
...
SecurityContext for support SkyLogicSystem security.
A node of the BFS or DFS tree created while traversing a graph.
SecurityContext for support SkyLogicSystem security.
Mail Profile.
We assume that there are locations described by the
class
Location.Abstract class for algorithms that accept only simple graphs as
input.
Contract for single-pair shortest path algorithms, that is finding a shortest
path from s to t, for given vertices s and t.
Contract for single-source shortest path algorithms.
xxx class.
Web Cryption Manager for support SkyLogicSystem security.
Web Cryption Manager for support SkyLogicSystem security.
Web Cryption Manager for support SkyLogicSystem security.
Web Cryption Manager for support SkyLogicSystem security.
Web Cryption Manager for support SkyLogicSystem security.
The skydata utility for use in SkyLogicSystem.
...
SkyLogicByteClassLoader
SkyLogic Charset Filter
SkyLogicClassLoader
Servlet Filter implementation class CORSFilter
SkyLogic Security Context
SkyLogicSystem Application exception
SkyLogicSystem Authentication exception
SkyLogicSystem Error Code
Online session map class use for keep object map of user web client access.
SkyLogicSystemScriptClassLoader
The servlet listener for add and remove object map when client access.
SkyMail Utility.
xxx class.
SkySMS Utility.
xxx class.
The general SkyUUID utility for use in SkyLogicSystem.
Computes the vertex ordering from the end to the beginning.
Iterates over all spanning trees of a graph.
A stable set is a set of vertices of a graph, no two of which are
adjacent.
A star is a graph formed by connecting a single universal vertex,
called center, to an independent set of vertices.
Interface for the state of the search algorithm.
Provides a method to find the minimum weighted cut of an undirected graph
using the Stoer-Wagner algorithm.
Provides a method to find the minimum weighted cut of an undirected graph
using the Stoer-Wagner algorithm.
Provides a method to find the minimum weighted cut of an undirected graph
using the Stoer-Wagner algorithm.
Provides a method to find the minimum weighted cut of an undirected graph
using the Stoer-Wagner algorithm.
The Cache utility class for use in Service gate support class.
The general string utility for use in SkyLogicSystem.
Iterates over all subsets of the set {0,1,...,n-1}.
Enables iteration over the edges incident from a source vertex, returning one
by one the successors of the source along with information regarding the
corresponding edge.
The algorithm for computing biconnected components in a connected undirected
graph is due to John Hopcroft and Robert Tarjan (1973).
Tarjan's strongly connected components algorithm is an algorithm in graph
theory for finding the strongly connected components (SCCs) of a directed
graph.
Test class.
The xxx utility class for use in xxx class.
xxx.
XXX Utility.
A snippet for Google Natural Language API showing how to convert houman speech from an audio file
into a text form.
Google Cloud TextToSpeech API sample application.
The xxx utility class for use in xxx class.
The general string utility for use in SkyLogicSystem.
XXX Utility.
The xxx utility class for use in xxx class.
XXX Utility.
XXX Utility.
XXX Utility.
Created by saksit on 3/18/2016 AD.
Created by saksit on 3/18/2016 AD.
The xxx utility class for use in xxx class.
...
xxx
Utility methods.
Computes an ordering of a directed graph vertices such that for every
directed edge (u,v) from vertex u to vertex v, u comes before v in the
ordering.
A topological order iterator for a directed acyclic graph (DAG).
Generates a tournament graph.
Support class for tournament graphs.
A trail is a walk with no repeated edge.
The Translater for use in SkyLogicSystem.
Determines the diameter, radius, center and periphery for unweighted,
undirected trees.
Algorithm for testing isomorphism of undirected trees.
Various distances related to a tree.
Counts the number of triangles in an undirected graph.
...
Class for the Ullman algorithm for exact graph isomorphism.
Class for the Ullman algorithm for exact graph isomorphism.
Class for the Ullman algorithm for subgraph isomorphism.
Class for the Ullman algorithm for exact graph isomorphism.
Abstract class for algorithms that accept only undirected graphs as input.
A union-find data structure (also called disjoint-set or
merge–find) stores a collection of disjoint (non-overlapping) sets.
...
Shows how to validate license.
The general validation utility for use in SkyLogicSystem.
Utility class for performing various checks related to graphs.
A collection of vertices in a graph.
Determines a maximum size set of vertex disjoint paths between two vertices,
a minimum size set of vertices whose removal disconnects two vertices, the
vertex connectivity number.
Implementation of a binary min heap using arrays.
An iterator over all the vertices of a graph.
A list of vertices of a graph.
Contains static methods that create various vertex orderings.
Deprecated.
A queue of vertices of a graph.
Utility class for representing a vertex separator set.
The vertex separator problem (VSP) is to find a partition of V into nonempty
three classes A, B, C such that there is no edge between A and B,
max(|A|,|B|) <= f(n) and |C| is minimum.A set of vertices of a graph.
A stack of vertices in a graph.
Generates weights for the vertices of a graph.
Class for the VF2 algorithm for exact graph isomorphism.
Class for the VF2 algorithm for exact graph isomorphism.
Class for the VF2 algorithm for exact graph isomorphism.
Class for the VF2 algorithm for subgraph isomorphism.
The general string utility for use in SkyLogicSystem.
A walk is a sequence of graph vertices such that any two consecutive
vertices form an edge of the graph.
The Watts–Strogatz model produces graphs with small-world properties,
including short average path lengths and high clustering.
Web Cryption Manager for support SkyLogicSystem security.
Used at Swing, JSF or other client for call SkyLogicSystem's service.
For HttpClient 3.1
Used at Swing, JSF or other client for call SkyLogicSystem's service.
For HttpClient 5
Used at Swing, JSF or other client for call SkyLogicSystem's service.
....
XXX Utility.
Iterates over all spanning trees of a graph, in ascending or descending order
by their weight.
Generator for wheel graphs.
This provides static methods to convert an XML text into a JSONObject,
and to covert a JSONObject into an XML text.
The XMLTokener extends the JSONTokener to provide additional methods
for the parsing of XML texts.
...