Revision 28552 trunk/extensions/extGraph/src/org/gvsig/graph/core/GvNode.java
GvNode.java | ||
---|---|---|
64 | 64 |
// ArrayList<GvEdge> outputLinks = new ArrayList<GvEdge>(); // Neighbors links |
65 | 65 |
// ArrayList<GvEdge> inputLinks = new ArrayList<GvEdge>(); // links with end node in this node. |
66 | 66 |
|
67 |
ArrayList<GvConnector> connectors = new ArrayList<GvConnector>(); |
|
67 |
ArrayList<GvConnector> connectors = new ArrayList<GvConnector>(2);
|
|
68 | 68 |
|
69 |
ArrayList<GvTurn> turnCosts = new ArrayList<GvTurn>(); // Turn costs. If a GvTurnCost exists, we add its cost. |
|
69 |
ArrayList<GvTurn> turnCosts = new ArrayList<GvTurn>(0); // Turn costs. If a GvTurnCost exists, we add its cost.
|
|
70 | 70 |
// If the cost is < 0, it is a prohibited cost. |
71 | 71 |
|
72 | 72 |
public GvNode() { |
Also available in: Unified diff