/*
* (C) Copyright 2016-2017, by Dimitrios Michail and Contributors.
*
* JGraphT : a free Java graph-theory library
*
* This program and the accompanying materials are dual-licensed under
* either
*
* (a) the terms of the GNU Lesser General Public License version 2.1
* as published by the Free Software Foundation, or (at your option) any
* later version.
*
* or (per the licensee's choosing)
*
* (b) the terms of the Eclipse Public License v1.0 as published by
* the Eclipse Foundation.
*/
package org.jgrapht.alg.interfaces;
import org.jgrapht.*;
/**
* Computes an Eulerian cycle of an Eulerian graph. An
* Eulerian graph is a graph
* containing an Eulerian cycle.
*
*
* @param the graph vertex type
* @param the graph edge type
*
* @author Dimitrios Michail
* @since October 2016
*/
public interface EulerianCycleAlgorithm
{
/**
* Compute an Eulerian cycle of a graph.
*
* @param graph the input graph
* @return an Eulerian cycle
* @throws IllegalArgumentException in case the graph is not Eulerian
*/
GraphPath getEulerianCycle(Graph graph);
}
Ads help maintain this website.