Package org.graph4j

Class SimpleGraphAlgorithm

java.lang.Object

org.graph4j.SimpleGraphAlgorithm

Direct Known Subclasses:

AcyclicOrientation, BFSCliqueIterator, BipartiteGraphSupport, BoundedCliqueIterator, BridgeDetectionAlgorithm, BronKerboschCliqueFinder, BronKerboschCliqueIterator, ConnectivityAlgorithm, DFSCliqueIterator, EdmondsMaximumMatching, ExactColoringBase, GreedyColoringBase, GreedyEquitableColoring, HopcroftKarpMaximumMatching, MaximalCliqueFinder, PalmerHamiltonianCycle, PruferTreeEncoder, RecursiveLargestFirstColoring, StoerWagnerMinimumCut, StoerWagnerMinimumCut1, StoerWagnerMinimumCut2, StoerWagnerMinimumCut3, TarjanBiconnectivity, VertexSeparatorBase

public abstract class SimpleGraphAlgorithm
extends Object

Abstract class for algorithms that accept only simple graphs as input. A simple graph is undirected and does not allow multiple edges or self loops.

Author:

Cristian Frăsinaru

Field Summary

Fields

Modifier and Type	Field	Description
protected final Graph	graph

Constructor Summary

Constructors

Constructor	Description
SimpleGraphAlgorithm(Graph graph)	Creates a new instance of the algorithm.

Method Summary

Modifier and Type	Method	Description
Graph	getGraph()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

graph

protected final Graph graph

Constructor Details

SimpleGraphAlgorithm

public SimpleGraphAlgorithm(Graph graph)

Creates a new instance of the algorithm.

Parameters:

graph - the input simple graph

Throws:

NullPointerException - if the graph is null.

IllegalArgumentException - if the graph is not simple.

Method Details

getGraph

public Graph getGraph()

Returns:

the input graph.