mCRL2
Loading...
Searching...
No Matches
ParityGameSolver.cpp
Go to the documentation of this file.
1// Copyright (c) 2009-2013 University of Twente
2// Copyright (c) 2009-2013 Michael Weber <michaelw@cs.utwente.nl>
3// Copyright (c) 2009-2013 Maks Verver <maksverver@geocities.com>
4// Copyright (c) 2009-2013 Eindhoven University of Technology
5//
6// Distributed under the Boost Software License, Version 1.0.
7// (See accompanying file LICENSE_1_0.txt or copy at
8// http://www.boost.org/LICENSE_1_0.txt)
9
11
12void merge_strategies( std::vector<verti> &strategy,
13 const std::vector<verti> &substrat,
14 const std::vector<verti> &vertex_map )
15{
16 assert(substrat.size() == vertex_map.size());
17 for (verti v = 0; v < (verti)vertex_map.size(); ++v)
18 {
19 strategy[vertex_map[v]] =
20 (substrat[v] == NO_VERTEX) ? NO_VERTEX : vertex_map[substrat[v]];
21 }
22}
std::size_t verti
type used to number vertices
Definition Graph.h:24
#define NO_VERTEX
Definition Graph.h:27
void merge_strategies(std::vector< verti > &strategy, const std::vector< verti > &substrat, const std::vector< verti > &vertex_map)