コード例 #1
0
ファイル: tabu_search.cpp プロジェクト: schulzchristian/KaHIP
        } endfor

        forall_nodes(G, node) {
                bool is_bnd      = false;
                PartitionID pIdx = G.getPartitionIndex(node);
                forall_out_edges(G, e, node) {
                        NodeID target = G.getEdgeTarget(e);
                        if( pIdx != G.getPartitionIndex(target)) {
                                is_bnd = true;
                                break;
                        }
                } endfor
コード例 #2
0
	    /**
	     * @brief Returns all outgoing edges of *srcVertex* paired with its target vertex.
	     *
	     */
	    std::vector<std::pair<Vertex, Edge> > getOutEdges(const Vertex srcVertex){
		OutEdgeIter ei, ei_end;
		std::tie(ei, ei_end) = boost::out_edges((*graph).global_to_local(srcVertex.id), (*graph));
		std::vector<BGLEdge> bglOutEdges(ei, ei_end);

		std::vector<std::pair<Vertex, Edge> > outEdges;
		for(BGLEdge e : bglOutEdges){
		    BGLVertex target = getEdgeTarget(e);
		    Vertex vertex    = getVertexProperty(target);
		    Edge   edge      = getEdge(e);
		    outEdges.push_back(std::make_pair(vertex, edge));
		}
		return outEdges;
	    }
コード例 #3
0
ファイル: tabu_search.cpp プロジェクト: schulzchristian/KaHIP
 forall_out_edges(G, e, node) {
         NodeID target            = G.getEdgeTarget(e);
         PartitionID target_block = G.getPartitionIndex(target);
         gamma->set_xy( node, target_block, gamma->get_xy(node, target_block) + 1);
 } endfor
コード例 #4
0
		forall_out_edges(G, e, node) {
			NodeID target = G.getEdgeTarget(e);
			sources[e] = node;
			targets[e] = target;
		} endfor
コード例 #5
0
ScAddr ScMemoryContext::getArcEnd(ScAddr const & arcAddr) const
{
	return getEdgeTarget(arcAddr);
}