Uses of Class
org.spectrumauctions.sats.core.model.cats.graphalgorithms.Vertex

Packages that use Vertex

Package	Description
org.spectrumauctions.sats.core.model.cats
org.spectrumauctions.sats.core.model.cats.graphalgorithms

Uses of Vertex in org.spectrumauctions.sats.core.model.cats

Methods in org.spectrumauctions.sats.core.model.cats that return Vertex

Modifier and Type	Method and Description
Vertex	CATSLicense.getVertex()

Uses of Vertex in org.spectrumauctions.sats.core.model.cats.graphalgorithms

Fields in org.spectrumauctions.sats.core.model.cats.graphalgorithms declared as Vertex

Modifier and Type	Field and Description
Vertex	VertexCell._v

Fields in org.spectrumauctions.sats.core.model.cats.graphalgorithms with type parameters of type Vertex

Modifier and Type	Field and Description
protected List<Vertex>	Graph._vertices

Methods in org.spectrumauctions.sats.core.model.cats.graphalgorithms that return Vertex

Modifier and Type	Method and Description
Vertex	Vertex.cloneIt() The method returns a deep copy of the object.
Vertex	Vertex.getChildVertex(int i)
Vertex	Edge.getSink()
Vertex	Edge.getSource()

Methods in org.spectrumauctions.sats.core.model.cats.graphalgorithms that return types with arguments of type Vertex

Modifier and Type	Method and Description
List<List<Vertex>>	Graph.coneDecomp(List<Vertex> S, double delta, List<Vertex> coneVertices) The method implements the cone decomposition of the graph.
Set<Set<Vertex>>	Graph.findAllPaths(Vertex source, Vertex destination) The method implements the dfs algorithm to find all paths between two vertices.
List<Vertex>	Graph.getBallShell(Vertex center, double radius, boolean recompute) The method returns a ball shell of a graph with a center in 'center' and with the given radius
List<Vertex>	Graph.getCone(Vertex center, double radius, List<Vertex> S) The method returns the cone with a vertex in 'center' and a given radius in respect to the set of vertices S
List<Vertex>	Graph.getVertices() The method returns the list of vertices of the graph
List<List<Vertex>>	Graph.starDecomp(Vertex x0, double delta, double epsilon, List<Vertex> y, List<Vertex> coneVertices) The method returns the Star-decomposition of the graph

Methods in org.spectrumauctions.sats.core.model.cats.graphalgorithms with parameters of type Vertex

Modifier and Type	Method and Description
void	Vertex.addChildVertex(Vertex child)
double	Graph.BallCut(Vertex x, double rad, double delta)
boolean	Graph.BellmanFord(Vertex sourceID, int idx) The method implements the Bellman-Ford graph search algorithm (the complexity is O(V*E) )
void	Graph.BFS(Vertex s) The method implements the Breadth-First-Search in the graph given the source vertex
double	Graph.ConeCut(Vertex center, double lambda, double lambda1, List<Vertex> S)
void	Graph.Dijkstra(Vertex source, int idx)
Set<Set<Vertex>>	Graph.findAllPaths(Vertex source, Vertex destination) The method implements the dfs algorithm to find all paths between two vertices.
void	Graph.FordFulkerson(Vertex s, Vertex t) The method implements Ford-Fulkerson maximum flow search method given the source vertex and the sink vertex
Graph	Graph.getBall(Vertex center, double radius, boolean recompute) The method returns a subgraph induced by a subset of vertices that are at most at distance=radius from the center vertex
List<Vertex>	Graph.getBallShell(Vertex center, double radius, boolean recompute) The method returns a ball shell of a graph with a center in 'center' and with the given radius
List<Vertex>	Graph.getCone(Vertex center, double radius, List<Vertex> S) The method returns the cone with a vertex in 'center' and a given radius in respect to the set of vertices S
List<VertexCell>	Graph.getPath(Vertex v, Vertex u) The method returns a path between two vertices i.e.
double	Graph.getRadius(Vertex v, boolean recompute) The method returns the radius of the graph i.e.
void	Edge.init(Vertex source, Vertex sink, double capacity, int numberOfFlows)
boolean	Graph.isAdjacent(Vertex u, Vertex v) The method returns true if there is an edge from the vertex U to the vertex V and false otherwise
List<Graph>	Graph.lowStretchTree(Vertex center, double betta, List<Edge> bridges) The method generate a Low Stretch Spanning Tree for the graph
List<List<Vertex>>	Graph.starDecomp(Vertex x0, double delta, double epsilon, List<Vertex> y, List<Vertex> coneVertices) The method returns the Star-decomposition of the graph

Method parameters in org.spectrumauctions.sats.core.model.cats.graphalgorithms with type arguments of type Vertex

Modifier and Type	Method and Description
void	Graph.addListOfVertices(List<Vertex> vrts) The method updates the list of vertices of the graph
double	Graph.ConeCut(Vertex center, double lambda, double lambda1, List<Vertex> S)
List<List<Vertex>>	Graph.coneDecomp(List<Vertex> S, double delta, List<Vertex> coneVertices) The method implements the cone decomposition of the graph.
List<List<Vertex>>	Graph.coneDecomp(List<Vertex> S, double delta, List<Vertex> coneVertices) The method implements the cone decomposition of the graph.
List<Edge>	Graph.getBoundary(List<Vertex> vertices)
List<Vertex>	Graph.getCone(Vertex center, double radius, List<Vertex> S) The method returns the cone with a vertex in 'center' and a given radius in respect to the set of vertices S
Graph	Graph.induceGraph(List<Vertex> vertices) The method returns the graph induced from the current one by a set of vertices Complexity O(n*m) because of adjacency lists.
List<List<Vertex>>	Graph.starDecomp(Vertex x0, double delta, double epsilon, List<Vertex> y, List<Vertex> coneVertices) The method returns the Star-decomposition of the graph
List<List<Vertex>>	Graph.starDecomp(Vertex x0, double delta, double epsilon, List<Vertex> y, List<Vertex> coneVertices) The method returns the Star-decomposition of the graph

Constructors in org.spectrumauctions.sats.core.model.cats.graphalgorithms with parameters of type Vertex

Constructor and Description
Edge(Vertex source, Vertex sink, double capacity, int numberOfFlows)
Edge(Vertex source, Vertex sink, int numberOfFlows)
VertexCell(Vertex v, double w)
VertexCell(Vertex v, double w, double f)

Constructor parameters in org.spectrumauctions.sats.core.model.cats.graphalgorithms with type arguments of type Vertex

Constructor and Description
Graph(List<Vertex> vertices) The method constructs
Graph(List<Vertex> vertices, List<List<VertexCell>> adjLsts)
Graph(List<Vertex> vertices, List<VertexCell>... adjLst) Constructor
SpectralGraph(List<Vertex> vertices, List<VertexCell>... adjLst)