📄 networkdijkstra.java
字号:
package implementations;import java.util.Iterator;import simulator.Contact;import simulator.Dijkstra;import simulator.Message;public final class NetworkDijkstra extends Dijkstra<SourceRouteNode, Contact, Message>{ public NetworkDijkstra(NetworkGraph graph, SourceRouteNode sNode, double sTime, Message fObject) { super(graph, sNode, sTime, fObject); } /** * Implements the Dijkstra.Graph interface for SourceRouteNodes. It does not * implement getWeight or getArrivalTime. */ abstract static class NetworkGraph implements Dijkstra.Graph<SourceRouteNode, Contact, Message> { public Iterator<? extends Contact> getArcsOut(SourceRouteNode inNode) { return inNode.getContacts(); } public int compareNodes(SourceRouteNode a, SourceRouteNode b) { return a.compareTo(b); } public SourceRouteNode getSource(Contact ofArc) { return (SourceRouteNode) ofArc.getSource(); } public SourceRouteNode getDest(Contact ofArc) { return (SourceRouteNode) ofArc.getDest(); } }}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -