00001 /********************************************************************* 00002 * Software License Agreement (BSD License) 00003 * 00004 * Copyright (c) 2010, LABUST, UNIZG-FER 00005 * All rights reserved. 00006 * 00007 * Redistribution and use in source and binary forms, with or without 00008 * modification, are permitted provided that the following conditions 00009 * are met: 00010 * 00011 * * Redistributions of source code must retain the above copyright 00012 * notice, this list of conditions and the following disclaimer. 00013 * * Redistributions in binary form must reproduce the above 00014 * copyright notice, this list of conditions and the following 00015 * disclaimer in the documentation and/or other materials provided 00016 * with the distribution. 00017 * * Neither the name of the LABUST nor the names of its 00018 * contributors may be used to endorse or promote products derived 00019 * from this software without specific prior written permission. 00020 * 00021 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 00022 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00023 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 00024 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 00025 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 00026 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 00027 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 00028 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00029 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00030 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 00031 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00032 * POSSIBILITY OF SUCH DAMAGE. 00033 * 00034 * Author: Dula Nad 00035 * Created: 30.10.2013. 00036 *********************************************************************/ 00037 #include <labust/control/ExecDepGraph.hpp> 00038 00039 #include <boost/graph/graphviz.hpp> 00040 00041 #include <sstream> 00042 00043 using namespace labust::control; 00044 00045 ExecDepGraph::ExecDepGraph() 00046 { 00047 //Add the basic vertices. 00048 std::string dofs[]={"X","Y","Z","K","M","N"}; 00049 //Add DOFs to the name list 00050 for (int i=0; i<6;++i) nameMap[dofs[i]] = boost::add_vertex(dofs[i], graph); 00051 } 00052 00053 void ExecDepGraph::addToGraph(const navcon_msgs::RegisterControllerRequest& info) 00054 { 00055 //Build from scratch 00056 using namespace boost; 00057 GraphType::vertex_descriptor curr_vert = boost::add_vertex(info.name,graph); 00058 nameMap[info.name] = curr_vert; 00059 //Add basic dependencies. 00060 for (int i=0; i<info.used_dofs.size(); ++i) 00061 if (info.used_dofs[i]) boost::add_edge(curr_vert,i, 1, graph); 00062 00063 //Add advanced dependencies 00064 for (int i=0; i<info.used_cnt.size(); ++i) 00065 boost::add_edge(curr_vert,nameMap[info.used_cnt[i]], 1, graph); 00066 } 00067 00068 void ExecDepGraph::getDotDesc(std::string& desc) 00069 { 00070 using namespace boost; 00071 //Construct a label writer. 00072 std::ostringstream out; 00073 write_graphviz(out, graph, 00074 make_label_writer(get(vertex_name_t(), graph))); 00075 desc = out.str(); 00076 } 00077 00078 void ExecDepGraph::findPath(const std::string& start, const std::string& end, 00079 std::list<std::string>& path){}