本文整理汇总了Java中routing.maxprop.MaxPropDijkstra类的典型用法代码示例。如果您正苦于以下问题:Java MaxPropDijkstra类的具体用法?Java MaxPropDijkstra怎么用?Java MaxPropDijkstra使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
MaxPropDijkstra类属于routing.maxprop包,在下文中一共展示了MaxPropDijkstra类的5个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: setUp
import routing.maxprop.MaxPropDijkstra; //导入依赖的package包/类
public void setUp() throws Exception {
super.setUp();
core.NetworkInterface.reset();
core.DTNHost.reset();
TestUtils tu = new TestUtils(null, null, new TestSettings());
msets = new ArrayList<MeetingProbabilitySet>();
mapping = new HashMap<Integer, MeetingProbabilitySet>();
hostsSet = new HashSet<DTNHost>();
for (int i=0; i<NROF_HOSTS; i++) {
DTNHost host = tu.createHost();
MeetingProbabilitySet set = new MeetingProbabilitySet(
MeetingProbabilitySet.INFINITE_SET_SIZE, 1.0);
msets.add(set);
hostsSet.add(host);
mapping.put(host.getAddress(), set);
}
mpd = new MaxPropDijkstra(mapping);
targets = new HashSet<Integer>();
}
开发者ID:MaX121,项目名称:Bachelor-Thesis,代码行数:22,代码来源:MaxPropDijkstraTest.java
示例2: setUp
import routing.maxprop.MaxPropDijkstra; //导入依赖的package包/类
public void setUp() throws Exception {
super.setUp();
core.NetworkInterface.reset();
core.DTNHost.reset();
TestUtils tu = new TestUtils(null, null, new TestSettings());
msets = new ArrayList<MeetingProbabilitySet>();
mapping = new HashMap<Integer, MeetingProbabilitySet>();
hostsSet = new HashSet<DTNHost>();
for (int i=0; i<NROF_HOSTS; i++) {
DTNHost host = tu.createHost();
MeetingProbabilitySet set = new MeetingProbabilitySet(
MeetingProbabilitySet.INFINITE_SET_SIZE, 1.0);
msets.add(set);
hostsSet.add(host);
mapping.put(host.getAddress(), set);
}
mpd = new MaxPropDijkstra(mapping);
targets = new HashSet<Integer>();
}
开发者ID:raveious,项目名称:delay-tolerant-network,代码行数:22,代码来源:MaxPropDijkstraTest.java
示例3: MaxPropRouterWithEstimation
import routing.maxprop.MaxPropDijkstra; //导入依赖的package包/类
/**
* Copy constructor. Creates a new router based on the given prototype.
* @param r The router prototype where setting values are copied from
*/
protected MaxPropRouterWithEstimation(MaxPropRouterWithEstimation r) {
super(r);
this.alpha = r.alpha;
this.timescale = r.timescale;
this.probs = new MeetingProbabilitySet(
MeetingProbabilitySet.INFINITE_SET_SIZE, this.alpha);
this.allProbs = new HashMap<Integer, MeetingProbabilitySet>();
this.dijkstra = new MaxPropDijkstra(this.allProbs);
this.ackedMessageIds = new HashSet<String>();
this.avgSamples = new int[BYTES_TRANSFERRED_AVG_SAMPLES];
initMeetings();
}
开发者ID:MaX121,项目名称:Bachelor-Thesis,代码行数:17,代码来源:MaxPropRouterWithEstimation.java
示例4: MaxPropRouter
import routing.maxprop.MaxPropDijkstra; //导入依赖的package包/类
/**
* Copy constructor. Creates a new router based on the given prototype.
* @param r The router prototype where setting values are copied from
*/
protected MaxPropRouter(MaxPropRouter r) {
super(r);
this.alpha = r.alpha;
this.probs = new MeetingProbabilitySet(probSetMaxSize, this.alpha);
this.allProbs = new HashMap<Integer, MeetingProbabilitySet>();
this.dijkstra = new MaxPropDijkstra(this.allProbs);
this.ackedMessageIds = new HashSet<String>();
this.avgSamples = new int[BYTES_TRANSFERRED_AVG_SAMPLES];
}
开发者ID:MaX121,项目名称:Bachelor-Thesis,代码行数:14,代码来源:MaxPropRouter.java
示例5: MaxPropRouter
import routing.maxprop.MaxPropDijkstra; //导入依赖的package包/类
/**
* Copy constructor. Creates a new router based on the given prototype.
* @param r The router prototype where setting values are copied from
*/
protected MaxPropRouter(MaxPropRouter r) {
super(r);
this.alpha = r.alpha;
this.probs = new MeetingProbabilitySet(probSetMaxSize, this.alpha);
this.allProbs = new HashMap<Integer, MeetingProbabilitySet>();
this.dijkstra = new MaxPropDijkstra(this.allProbs);
this.ackedMessageIds = new HashSet<String>();
this.avgSamples = new int[BYTES_TRANSFERRED_AVG_SAMPLES];
this.sentMessages = new HashMap<DTNHost, Set<String>>();
}
开发者ID:raveious,项目名称:delay-tolerant-network,代码行数:15,代码来源:MaxPropRouter.java
注:本文中的routing.maxprop.MaxPropDijkstra类示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论