Package y.algo

Provides classes and interfaces for efficient graph analysis.

See:
Description

Interface Summary

Groups.Distances	An interface that determines the distance between two nodes of a graph.
NodeSequencer	This is a generic interface for classes that provide an ordering for the nodes of a graph.

Class Summary

AbortHandler	This class provides a means for early termination of graph algorithms.
AggregationInfo	The result of a NodeAggregation.aggregate(Graph, NodeMap) run is a hierarchical nested clustering structure.
Bfs	This class provides services that center around breadth first search (BFS).
Bipartitions	This class provides methods to determine whether a graph is bipartite and to obtain the corresponding partitions.
Centrality	This class provides methods to determine various centrality indices of nodes or edges of a graph.
Cycles	This class is responsible for finding cycles within a graph that have certain properties.
Dfs	Framework class for implementing depth first search (DFS) based algorithms.
GraphChecker	This class provides methods that check structural properties of a given graph.
GraphConnectivity	This class provides algorithms for determining certain connectivity components within a graph.
Groups	This class provides methods for automatically partitioning nodes of a graph into groups.
Groups.Dendrogram	This class provides the result of hierarchical clustering algorithms by means of a binary tree structure.
IndependentSets	This class provides methods for calculating independent sets.
NetworkFlows	This class provides sophisticated algorithms for solving classical network flow problems.
NodeAggregation	This class realizes an algorithm that aggregates nodes and creates a hierarchical clustering structure subject to user-specified constraints like the type of nodes as well as the preferred minimum and maximum size of a cluster.
NodeOrders	This class provides algorithms that order the nodes of a graph using specific criteria.
ParallelEdges	This class provides methods for finding the parallel edges in a graph, also called multiple edges or multi-edges.
Paths	This class provides methods for finding paths within a graph that have certain properties.
RankAssignments	This class provides algorithms for solving the rank assignment problem.
ShortestPaths	This class provides diverse algorithms and helper methods for solving the shortest path problem on weighted graphs.
Sorting	This class provides methods for efficiently sorting graph elements in graph structures.
SpanningTrees	This class provides (minimum) spanning tree algorithms for graphs.
Substructure	Represents a substructure of a graph, like a tree, chain, star, clique or tree.
Substructures	This class allows to detect different substructures within the input graph, for example, tree, star, chain and cycle structures.
Transitivity	This class provides algorithms to compute reachability information for directed, acyclic graphs.
Trees	This class provides diverse algorithms and services for tree-structured graphs or subgraphs.

Exception Summary

AlgorithmAbortedException

Exception thrown by an algorithm to indicate that an immediate termination request was detected.

Package y.algo Description

Provides classes and interfaces for efficient graph analysis.

Included are popular graph traversal algorithms like breadth-first and depth-first search and sophisticated algorithms to solve path, connectivity and reachability problems.

This package also provides algorithms for computing minimum spanning trees, network flows, or checking structural aspects of graphs.

Related Documentation

See the yFiles Developer's Guide section on Analyzing Graphs for examples and descriptions of the yFiles graph analysis services.