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


Java Graph.getIncidentEdges方法代碼示例

本文整理匯總了Java中edu.uci.ics.jung.graph.Graph.getIncidentEdges方法的典型用法代碼示例。如果您正苦於以下問題:Java Graph.getIncidentEdges方法的具體用法?Java Graph.getIncidentEdges怎麽用?Java Graph.getIncidentEdges使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在edu.uci.ics.jung.graph.Graph的用法示例。


在下文中一共展示了Graph.getIncidentEdges方法的4個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的Java代碼示例。

示例1: addSynsets

import edu.uci.ics.jung.graph.Graph; //導入方法依賴的package包/類
private void addSynsets(ViwnNode v) {
    popup.setVisible(false);
    Object[] syns = synset_list_.getSelectedValues();
    if (syns.length > 0) {
        vgvui.deselectAll();
    }
    ViwnNode other = v;
    for (Object obj : syns) {
        vgvui.addSynsetFromSet((ViwnNodeSynset) obj);
        other = (ViwnNode) obj;
    }
    if (syns.length > 0) {
        ViwnNode p2 = v;
        Graph<ViwnNode, ViwnEdge> g = vgvui.getGraph();
        ViwnNode parent = v.getSpawner();
        boolean dissapear = true;
        for (ViwnEdge edge : g.getIncidentEdges(parent)) {
            ViwnNode opposite = g.getOpposite(parent, edge);
            if (parent.equals(opposite.getSpawner())
                    && (opposite.getSpawnDir() != null)) {
                if (opposite == v) {
                    dissapear = false;
                }
            }
        }
        if (dissapear) {
            if (other != null) {
                p2 = other;
            } else {
                p2 = v.getSpawner();
            }
        }
        vgvui.recreateLayoutWithFix(v, p2);
    }
}
 
開發者ID:CLARIN-PL,項目名稱:WordnetLoom,代碼行數:36,代碼來源:ViwnGraphViewPopupGraphMousePlugin.java

示例2: getNeighborsWithHigherCoreness

import edu.uci.ics.jung.graph.Graph; //導入方法依賴的package包/類
private List<V> getNeighborsWithHigherCoreness(Graph<V, E> g, V v) {
	List<V> neighborsWithHigherCoreness = new ArrayList<V>();
	for( E e : g.getIncidentEdges(v) ) {					
		V n = g.getOpposite(v, e);
		if( coreness.get(n) >= coreness.get(v) ) {
			neighborsWithHigherCoreness.add(n);
		}
			
	}
	return neighborsWithHigherCoreness;
}
 
開發者ID:dev-cuttlefish,項目名稱:cuttlefish,代碼行數:12,代碼來源:KCoreLayout.java

示例3: getNeighborsWithHigherCoreness

import edu.uci.ics.jung.graph.Graph; //導入方法依賴的package包/類
private List<V> getNeighborsWithHigherCoreness(Graph<V, E> g, V v) {
	List<V> neighborsWithHigherCoreness = new ArrayList<V>();
	for (E e : g.getIncidentEdges(v)) {
		V n = g.getOpposite(v, e);
		if (coreness.get(n) >= coreness.get(v)) {
			neighborsWithHigherCoreness.add(n);
		}

	}
	return neighborsWithHigherCoreness;
}
 
開發者ID:dev-cuttlefish,項目名稱:cuttlefish,代碼行數:12,代碼來源:WeightedKCoreLayout.java

示例4: getNeighborsWithHigherCoreness

import edu.uci.ics.jung.graph.Graph; //導入方法依賴的package包/類
private List<V> getNeighborsWithHigherCoreness(Graph<V, E> g, V v) {
	List<V> neighborsWithHigherCoreness = new ArrayList<V>();
	for( E e : g.getIncidentEdges(v) ) {					
		V n = g.getOpposite(v, e);
		if( coreness.get(n) > coreness.get(v) ) {
			neighborsWithHigherCoreness.add(n);
		}
			
	}
	return neighborsWithHigherCoreness;
}
 
開發者ID:dev-cuttlefish,項目名稱:cuttlefish,代碼行數:12,代碼來源:KCoreSimpleLayout.java


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