- *
• -1 if {@code graph.getEdge(j)} is directed and - * {@code graph.getNode(i)} is its source.
• - *
• 1 if {@code graph.getEdge(j)} is undirected and - * {@code graph.getNode(i)} is its source.
• - *
• 1 if {@code graph.getNode(i)} is the target of - * {@code graph.getEdge(j)}.
• + *
• -1 if {@code graph.getEdge(j)} is directed and {@code + * graph.getNode(i)} is its source.
• + *
• 1 if {@code graph.getEdge(j)} is undirected and {@code + * graph.getNode(i)} is its source.
• + *
• 1 if {@code graph.getNode(i)} is the target of {@code + * graph.getEdge(j)}.
• *
• 0 otherwise. *
* In the special case when the j-th edge is a loop connecting the i-th node @@ -1449,12 +1447,12 @@ public class Toolkit extends * number of edges of the graph. The coefficients {@code a[i][j]} of this * matrix have the following values: *
- *
• -1 if {@code graph.getEdge(j)} is directed and - * {@code graph.getNode(i)} is its source.
• - *
• 1 if {@code graph.getEdge(j)} is undirected and - * {@code graph.getNode(i)} is its source.
• - *
• 1 if {@code graph.getNode(i)} is the target of - * {@code graph.getEdge(j)}.
• + *
• -1 if {@code graph.getEdge(j)} is directed and {@code + * graph.getNode(i)} is its source.
• + *
• 1 if {@code graph.getEdge(j)} is undirected and {@code + * graph.getNode(i)} is its source.
• + *
• 1 if {@code graph.getNode(i)} is the target of {@code + * graph.getEdge(j)}.
• *
• 0 otherwise.
• *
* In the special case when the j-th edge is a loop connecting the i-th node