This repository has been archived by the owner on Nov 18, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
* Compute and draw exact-length edges * Refactor AbstractLayout / BasicForceLayout * Renaming: BusInnerNode -> BusNode * BusNodes HashMap in Graph and not in each VoltageLevelNode * Setting BusNodes position and index in layout * Add invisible bus nodes * Handle case of null connectableBus * Compute the edge for three-winding transformers * Update unit tests * Update unit test for empty voltage level node Signed-off-by: Florian Dupuy <florian.dupuy@rte-france.com>
- Loading branch information
Showing
29 changed files
with
6,181 additions
and
5,975 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,38 @@ | ||
/** | ||
* Copyright (c) 2021, RTE (http://www.rte-france.com) | ||
* This Source Code Form is subject to the terms of the Mozilla Public | ||
* License, v. 2.0. If a copy of the MPL was not distributed with this | ||
* file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
*/ | ||
package com.powsybl.nad.model; | ||
|
||
/** | ||
* @author Florian Dupuy <florian.dupuy at rte-france.com> | ||
*/ | ||
public class BusNode extends AbstractNode { | ||
|
||
public static final BusNode UNKNOWN = new BusNode("", ""); | ||
|
||
private int index; | ||
private int nbNeighbouringBusNodes; | ||
|
||
public BusNode(String diagramId, String id) { | ||
super(diagramId, id, null); | ||
} | ||
|
||
public void setIndex(int index) { | ||
this.index = index; | ||
} | ||
|
||
public int getIndex() { | ||
return index; | ||
} | ||
|
||
public void setNbNeighbouringBusNodes(int nbNeighbouringBusNodes) { | ||
this.nbNeighbouringBusNodes = nbNeighbouringBusNodes; | ||
} | ||
|
||
public int getNbNeighbouringBusNodes() { | ||
return nbNeighbouringBusNodes; | ||
} | ||
} |
Oops, something went wrong.