operations.graphoperations.algorithms.feedbackvertexset

Class FeedbackVertexSetGRASP<VertexType,EdgeType>

java.lang.Object

operations.graphoperations.algorithms.feedbackvertexset.FeedbackVertexSetGRASP<VertexType,EdgeType>

All Implemented Interfaces:

java.lang.Iterable<StdVertex>

public class FeedbackVertexSetGRASP<VertexType,EdgeType>
extends java.lang.Object
implements java.lang.Iterable<StdVertex>

Computes the feedback vertex set using the GRASP algorithm from "A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR THE FEEDBACK VERTEX SET PROBLEM" by Pardalos et al.

Constructor Summary

Constructors

Constructor and Description
FeedbackVertexSetGRASP(int iterations, float alpha, GreedyFunction greedyFunction)

Method Summary

Modifier and Type	Method and Description
void	evaluate(GraphLibrary<VertexType,EdgeType> graph)
java.util.Iterator<StdVertex>	iterator()
static boolean	reduceGraph(edu.uci.ics.jung.graph.Graph<StdVertex,StdEdge> graph, boolean oneStepOnly)
static GreedyFunction	stringToGreedyFunction(java.lang.String key)

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

FeedbackVertexSetGRASP

public FeedbackVertexSetGRASP(int iterations,
                              float alpha,
                              GreedyFunction greedyFunction)

Method Detail

stringToGreedyFunction

public static GreedyFunction stringToGreedyFunction(java.lang.String key)

reduceGraph

public static boolean reduceGraph(edu.uci.ics.jung.graph.Graph<StdVertex,StdEdge> graph,
                                  boolean oneStepOnly)

evaluate

public void evaluate(GraphLibrary<VertexType,EdgeType> graph)

iterator

public java.util.Iterator<StdVertex> iterator()

Specified by:

iterator in interface java.lang.Iterable<StdVertex>