Uses of Interface
org.goplanit.utils.graph.directed.DirectedSubGraph

Packages that use DirectedSubGraph

Package	Description
org.goplanit.graph.directed.acyclic
org.goplanit.utils.graph.directed
org.goplanit.utils.graph.directed.acyclic

Uses of DirectedSubGraph in org.goplanit.graph.directed.acyclic

Classes in org.goplanit.graph.directed.acyclic that implement DirectedSubGraph

Modifier and Type	Class	Description
class	ACyclicSubGraphImpl	An acyclic sub graph contains a subset of the full graph without cycles.
class	ConjugateACyclicSubGraphImpl	An acyclic sub graph contains a subset of the full graph without cycles.
class	UntypedACyclicSubGraphImpl<V extends DirectedVertex,E extends EdgeSegment>	An acyclic sub graph contains a subset of the full graph without cycles.

Uses of DirectedSubGraph in org.goplanit.utils.graph.directed

Subinterfaces of DirectedSubGraph in org.goplanit.utils.graph.directed

Modifier and Type	Interface	Description
interface	ConjugateDirectedSubGraph	A conjugate directed subgraph interface for a given parent graph by registering conjugate edge segments on it (and therefore conjugate vertices and edges)

Methods in org.goplanit.utils.graph.directed that return DirectedSubGraph

Modifier and Type	Method	Description
DirectedSubGraph<V,E>	DirectedSubGraph.deepClone()	An id entity should always support a deep copy, i.e., all "owned" members will be deep copied when a clone of this instance is created via this call.
DirectedSubGraph<V,E>	DirectedSubGraph.shallowClone()	Create a shallow copy of this entity

Uses of DirectedSubGraph in org.goplanit.utils.graph.directed.acyclic

Subinterfaces of DirectedSubGraph in org.goplanit.utils.graph.directed.acyclic

Modifier and Type	Interface	Description
interface	ACyclicSubGraph	An acyclic sub graph contains a subset of the full graph without cycles.
interface	ConjugateACyclicSubGraph	An conjugate acyclic sub graph contains a subset of a graph without cycles.
interface	UntypedACyclicSubGraph<V extends DirectedVertex,E extends EdgeSegment>	An untyped acyclic sub graph contains a subset of a full graph, with generics regarding vertices and edges, without cycles.