Uses of Class org.spectrumauctions.sats.core.model.cats.graphalgorithms.Vertex (org.spectrumauctions:sats 0.7.0 API)

Packages that use Vertex
Package	Description
org.spectrumauctions.sats.core.model.cats
org.spectrumauctions.sats.core.model.cats.graphalgorithms
org.spectrumauctions.sats.opt.model.lsvm

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 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	Description
`Vertex`	VertexCell.`_v`

Fields in org.spectrumauctions.sats.core.model.cats.graphalgorithms with type parameters of type Vertex
Modifier and Type	Field	Description
`protected java.util.List<Vertex>`	Graph.`_vertices`

Methods in org.spectrumauctions.sats.core.model.cats.graphalgorithms that return Vertex
Modifier and Type	Method	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	Description
`java.util.List<java.util.List<Vertex>>`	Graph.`coneDecomp(java.util.List<Vertex> S, double delta, java.util.List<Vertex> coneVertices)`	The method implements the cone decomposition of the graph.
`java.util.Set<java.util.Set<Vertex>>`	Graph.`findAllPaths(Vertex source, Vertex destination)`	The method implements the dfs algorithm to find all paths between two vertices.
`java.util.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
`java.util.List<Vertex>`	Graph.`getCone(Vertex center, double radius, java.util.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
`java.util.List<Vertex>`	Graph.`getVertices()`	The method returns the list of vertices of the graph
`java.util.List<java.util.List<Vertex>>`	Graph.`starDecomp(Vertex x0, double delta, double epsilon, java.util.List<Vertex> y, java.util.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	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, java.util.List<Vertex> S)`
`void`	Graph.`Dijkstra(Vertex source, int idx)`
`java.util.Set<java.util.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
`java.util.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
`java.util.List<Vertex>`	Graph.`getCone(Vertex center, double radius, java.util.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
`java.util.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
`java.util.List<Graph>`	Graph.`lowStretchTree(Vertex center, double betta, java.util.List<Edge> bridges)`	The method generate a Low Stretch Spanning Tree for the graph
`java.util.List<java.util.List<Vertex>>`	Graph.`starDecomp(Vertex x0, double delta, double epsilon, java.util.List<Vertex> y, java.util.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	Description
`void`	Graph.`addListOfVertices(java.util.List<Vertex> vrts)`	The method updates the list of vertices of the graph
`double`	Graph.`ConeCut(Vertex center, double lambda, double lambda1, java.util.List<Vertex> S)`
`java.util.List<java.util.List<Vertex>>`	Graph.`coneDecomp(java.util.List<Vertex> S, double delta, java.util.List<Vertex> coneVertices)`	The method implements the cone decomposition of the graph.
`java.util.List<Edge>`	Graph.`getBoundary(java.util.List<Vertex> vertices)`
`java.util.List<Vertex>`	Graph.`getCone(Vertex center, double radius, java.util.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(java.util.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.
`java.util.List<java.util.List<Vertex>>`	Graph.`starDecomp(Vertex x0, double delta, double epsilon, java.util.List<Vertex> y, java.util.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	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	Description
`Graph(java.util.List<Vertex> vertices)`	The method constructs
`Graph(java.util.List<Vertex> vertices, java.util.List<java.util.List<VertexCell>> adjLsts)`
`Graph(java.util.List<Vertex> vertices, java.util.List<VertexCell>... adjLst)`	Constructor
`SpectralGraph(java.util.List<Vertex> vertices, java.util.List<VertexCell>... adjLst)`

Uses of Vertex in org.spectrumauctions.sats.opt.model.lsvm

Methods in org.spectrumauctions.sats.opt.model.lsvm that return Vertex
Modifier and Type Method Description

Vertex LSVMGridGraph.getVertex(LSVMLicense license)