Uses of Interface
fr.inria.opengve.bridge.interfaces.Edge

Packages that use Edge

fr.inria.opengve.bridge.algorithms.undirected	This package contains all algorithms specific to undirected graph.
fr.inria.opengve.bridge.algorithms.undirected.minCut

Uses of Edge in fr.inria.opengve.bridge.algorithms.undirected

Classes in fr.inria.opengve.bridge.algorithms.undirected with type parameters of type Edge

class	Kruskal<V,E extends Edge<V>,G extends Graph<V,E>> This class implement the Kruskal algorithms to compute minimum spanning tree, it work only on non directed graph.
class	PrimST<V,E extends Edge<V>> This class computes the Minimum Spanning Tree of a graph G with the Prim's algorithm.

Uses of Edge in fr.inria.opengve.bridge.algorithms.undirected.minCut

Classes in fr.inria.opengve.bridge.algorithms.undirected.minCut with type parameters of type Edge

class	NagamochiMinCut<V,E extends Edge<V>,G extends Graph<V,E>> Compute the minimum cut of a graph.
class	StoerWagnerMinCut<V,E extends Edge<V>> This algorithm is based on: A simple min-cut algorithm Source Journal of the ACM (JACM) archive Volume 44 , Issue 4 (July 1997) table of contents Pages: 585 - 591 Year of Publication: 1997 ISSN:0004-5411 Authors Mechthild Stoer Televerkets Forskningsinstitutt, Kjeller, Norway Frank Wagner Freie Univ.