當前位置: 首頁>>代碼示例>>Java>>正文


Java SubstrateLinkDemandTransformer類代碼示例

本文整理匯總了Java中vnreal.algorithms.utils.energy.linkStressTransformers.SubstrateLinkDemandTransformer的典型用法代碼示例。如果您正苦於以下問題:Java SubstrateLinkDemandTransformer類的具體用法?Java SubstrateLinkDemandTransformer怎麽用?Java SubstrateLinkDemandTransformer使用的例子?那麽, 這裏精選的類代碼示例或許可以為您提供幫助。


SubstrateLinkDemandTransformer類屬於vnreal.algorithms.utils.energy.linkStressTransformers包,在下文中一共展示了SubstrateLinkDemandTransformer類的2個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的Java代碼示例。

示例1: findShortestPath

import vnreal.algorithms.utils.energy.linkStressTransformers.SubstrateLinkDemandTransformer; //導入依賴的package包/類
LinkedList<SubstrateLink> findShortestPath(SubstrateNetwork sNetwork,
		SubstrateNode n1, SubstrateNode n2,
		Collection<AbstractDemand> vldemands, int epsilon) {

	if (n1.getId() == n2.getId()) {
		return new LinkedList<SubstrateLink>();
	}

	MyDijkstraShortestPath<SubstrateNode, SubstrateLink> dijkstra = new MyDijkstraShortestPath<SubstrateNode, SubstrateLink>(
			sNetwork, new SubstrateLinkDemandTransformer(vldemands), true);

	LinkedList<SubstrateLink> path = dijkstra.getPath(n1, n2, epsilon);
	assert (path == null || Utils.fulfills(path, vldemands));

	return path;
}
 
開發者ID:KeepTheBeats,項目名稱:alevin-svn2,代碼行數:17,代碼來源:SubgraphIsomorphismAlgorithm.java

示例2: findShortestPath

import vnreal.algorithms.utils.energy.linkStressTransformers.SubstrateLinkDemandTransformer; //導入依賴的package包/類
LinkedList<SubstrateLink> findShortestPath(SubstrateNetwork sNetwork,
                                           SubstrateNode n1, SubstrateNode n2,
                                           Collection<AbstractDemand> vldemands, int epsilon) {

    if (n1.getId() == n2.getId()) {
        return new LinkedList<SubstrateLink>();
    }

    MyDijkstraShortestPath<SubstrateNode, SubstrateLink> dijkstra = new MyDijkstraShortestPath<SubstrateNode, SubstrateLink>(
            sNetwork, new SubstrateLinkDemandTransformer(vldemands),
            true);

    LinkedList<SubstrateLink> path = dijkstra.getPath(n1, n2, epsilon);
    assert (path == null || Utils.fulfills(path, vldemands));

    return path;
}
 
開發者ID:liruixpc11,項目名稱:crucian,代碼行數:18,代碼來源:SubgraphIsomorphismAlgorithm.java


注:本文中的vnreal.algorithms.utils.energy.linkStressTransformers.SubstrateLinkDemandTransformer類示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台,相關代碼片段篩選自各路編程大神貢獻的開源項目,源碼版權歸原作者所有,傳播和使用請參考對應項目的License;未經允許,請勿轉載。