Interface DirectedSubGraph
-
- All Superinterfaces:
Cloneable,Comparable<IdAble>,IdAble
- All Known Subinterfaces:
ACyclicSubGraph
- All Known Implementing Classes:
ACyclicSubGraphImpl
public interface DirectedSubGraph extends IdAble
A directed subgraph interface for a given parent graph by registering edge segments on it (and therefore vertices and edges)- Author:
- markr
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description voidaddEdgeSegment(EdgeSegment edgeSegment)Register an edge segment on the subgraphDirectedSubGraphclone()Create a shallow copy of this entitybooleancontainsEdgeSegment(EdgeSegment edgeSegment)Verify if given edge segment is registered on this subgraphlonggetNumberOfVertices()Based on the registered edge segments, the number of vertices is automatically determined.voidremoveEdgeSegment(EdgeSegment edgeSegment)Remove an edge segment on the subgraph-
Methods inherited from interface org.goplanit.utils.id.IdAble
compareTo, getId, idEquals, idHashCode
-
-
-
-
Method Detail
-
addEdgeSegment
void addEdgeSegment(EdgeSegment edgeSegment)
Register an edge segment on the subgraph- Parameters:
edgeSegment- to add
-
removeEdgeSegment
void removeEdgeSegment(EdgeSegment edgeSegment)
Remove an edge segment on the subgraph- Parameters:
edgeSegment- to remove
-
containsEdgeSegment
boolean containsEdgeSegment(EdgeSegment edgeSegment)
Verify if given edge segment is registered on this subgraph- Parameters:
edgeSegment- to verify- Returns:
- true when registered, false otherwise
-
getNumberOfVertices
long getNumberOfVertices()
Based on the registered edge segments, the number of vertices is automatically determined. This method provides the number of vertices corresponding to these registered edge segments- Returns:
- number of vertices
-
clone
DirectedSubGraph clone()
Create a shallow copy of this entity
-
-