Package | Description |
---|---|
<Unnamed> | |
jdg.graph |
Modifier and Type | Field and Description |
---|---|
Node |
SpringDrawing.selectedNode
node selected with mouse click (to show)
|
Modifier and Type | Method and Description |
---|---|
Node |
SpringDrawing.selectNode(int i,
int j)
Select the vertex whose 2d projection is the closest to pixel (i, j)
|
Modifier and Type | Method and Description |
---|---|
Jcg.geometry.Vector_2 |
FR91Layout.computeAttractiveForce(Node u) |
Jcg.geometry.Vector_2 |
FR91Layout.computeRepulsiveForce(Node u) |
void |
SpringDrawing.drawVertex(Node u,
double distortion,
double maxDistortion)
Draw a vertex u on the canvas
|
void |
SpringDrawing.drawVertexLabel(Node u)
Draw a vertex label on the canvas (close to the node location)
|
java.lang.String |
SpringDrawing.getVertexLabel(Node u)
Compute the label of a vertex, from its index, spectral distortion and vertex age
|
void |
FR91Layout.repulsiveForce(Node u,
Jcg.geometry.Vector_2[] disp) |
Jcg.geometry.Vector_2 |
FR91Layout.slowRepulsiveForce(Node u) |
Modifier and Type | Field and Description |
---|---|
Node |
Edge.first
extremities of the edge
|
Node |
Edge.second
extremities of the edge
|
Modifier and Type | Field and Description |
---|---|
java.util.ArrayList<Node> |
Node.neighbors
list of neighbors of the current node
|
java.util.ArrayList<Node> |
AdjacencyListGraph.neighbors
for each node, store the list of neighbors
|
Modifier and Type | Method and Description |
---|---|
Node |
AdjacencyListGraph.getNode(int index)
Return the node given its index (between [0..n-1])
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Node> |
AdjacencyListGraph.findConnectedComponent(Node v)
Compute and return the connected component containing the vertex v
It performs a DFS visit of the graph starting from vertex v
|
java.util.Collection<Node> |
AdjacencyListGraph.getNeighbors(Node v) |
java.util.List<Node> |
Node.neighborsList()
Return the list of neighboring nodes
|
Modifier and Type | Method and Description |
---|---|
void |
AdjacencyListGraph.addEdge(Node a,
Node b)
Add an edge between two nodes
|
void |
Node.addNeighbor(Node v) |
void |
AdjacencyListGraph.addNode(Node v)
Add a new node to the graph.
|
boolean |
Node.adjacent(Node v) |
boolean |
AdjacencyListGraph.adjacent(Node a,
Node b)
Check whether two nodes are adjacent (slow implementation, without hash maps)
|
int |
AdjacencyListGraph.degree(Node v)
Return the degree of a node
|
java.util.List<Node> |
AdjacencyListGraph.findConnectedComponent(Node v)
Compute and return the connected component containing the vertex v
It performs a DFS visit of the graph starting from vertex v
|
int |
AdjacencyListGraph.getEdgeIndex(Node a,
Node b)
Return the index of the edge having extremities (a, b) if any.
|
java.util.Collection<Node> |
AdjacencyListGraph.getNeighbors(Node v) |
void |
AdjacencyListGraph.removeEdge(Node a,
Node b)
Remove the edge between two nodes
|
void |
Node.removeNeighbor(Node v) |
void |
AdjacencyListGraph.removeNode(Node v) |
Constructor and Description |
---|
Edge(Node a,
Node b,
int index)
Initialize an edge (a, b)
|