com.salesforce.jgrapht.alg.connectivity.package-info Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of AptSpringProcessor Show documentation

This project contains the apt processor that implements all the checks enumerated in @Verify. It is a self contained, and shaded jar.

The newest version!

/**
 * Algorithms dealing with various connectivity aspects of a graph.
 *
 * A graph is connected when there is a path between every pair of vertices. In a connected graph,
 * there are no unreachable vertices. A graph that is not connected is disconnected. A connected
 * component is a maximal connected subgraph of $G$. Each vertex belongs to exactly one connected
 * component, as does each edge.
 * 
 * A directed graph is called weakly connected if replacing all of its directed edges with
 * undirected edges produces a connected (undirected) graph. It is strongly connected if it contains
 * a directed path from $u$ to $v$ and a directed path from $v$ to $u$ for every pair of vertices
 * $u$, $v$. The strong components are the maximal strongly connected subgraphs.
 *
 */
package com.salesforce.jgrapht.alg.connectivity;