📄 dijkstracontainer.java
字号:
/* * @(#)$Id: DijkstraContainer.java,v 1.5 2004/07/02 23:59:22 huebsch Exp $ * * Copyright (c) 2001-2004 Regents of the University of California. * All rights reserved. * * This file is distributed under the terms in the attached BERKELEY-LICENSE * file. If you do not find these files, copies can be found by writing to: * Computer Science Division, Database Group, Universite of California, * 617 Soda Hall #1776, Berkeley, CA 94720-1776. Attention: Berkeley License * * Copyright (c) 2003-2004 Intel Corporation. All rights reserved. * * This file is distributed under the terms in the attached INTEL-LICENSE file. * If you do not find these files, copies can be found by writing to: * Intel Research Berkeley, 2150 Shattuck Avenue, Suite 1300, * Berkeley, CA, 94704. Attention: Intel License Inquiry. */package simulator.schedulers.network.topology.transitstub;import java.util.ArrayList;/** Helper class for Dijkstra algorithm */public class DijkstraContainer { Vertex vertex; // vertex that this represents int currentWeight; ArrayList path; // set of nodes leading to this /** * Constructor DijkstraContainer * * @param vertex */ public DijkstraContainer(Vertex vertex) { this.vertex = vertex; } /** * Method getVertex * @return */ public Vertex getVertex() { return vertex; } /** * Method getCurrentWeight * @return */ public int getCurrentWeight() { return currentWeight; } /** * Method getPath * @return */ public ArrayList getPath() { return path; } /** * Method setCurrentWeight * * @param currentWeight */ public void setCurrentWeight(int currentWeight) { this.currentWeight = currentWeight; } /** * Method setPath * * @param path */ public void setPath(ArrayList path) { this.path = path; } /** * Method toString * @return */ public String toString() { return "DijkstraContainer:< " + vertex + ", " + currentWeight + ", Path:< " + path + ">>"; } ;}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -