| Package | Description |
|---|---|
| org.spectrumauctions.sats.core.model.cats | |
| org.spectrumauctions.sats.core.model.cats.graphalgorithms |
| Modifier and Type | Method and Description |
|---|---|
Graph |
CATSWorld.getGrid() |
| Modifier and Type | Class and Description |
|---|---|
class |
Mesh2D |
class |
SpectralGraph |
| Modifier and Type | Method and Description |
|---|---|
Graph |
Graph.buildResidualNetwork()
The method builds the residual network for this graph
|
Graph |
SpectralGraph.contractIt(double wMin) |
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
|
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.
|
| Modifier and Type | Method and Description |
|---|---|
List<Graph> |
Graph.lowStretchTree(Vertex center,
double betta,
List<Edge> bridges)
The method generate a Low Stretch Spanning Tree for the graph
|
Copyright © 2017. All rights reserved.