Loading...
Searching...
No Matches
graph_visualizer.h
/*
Copyright (c) 2016, Taiga Nomi
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the <organization> nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include "tiny_dnn/node.h"
#include "tiny_dnn/layers/layer.h"
#include "tiny_dnn/network.h"
namespace tiny_dnn {
class graph_visualizer {
public:
explicit graph_visualizer(layer *root_node, const std::string& graph_name = "graph")
: root_(root_node), name_(graph_name) {}
template <typename N>
explicit graph_visualizer(network<N>& network, const std::string& graph_name = "graph")
: root_(network[0]), name_(graph_name) {}
void generate(std::ostream& stream) {
generate_header(stream);
generate_nodes(stream);
generate_footer(stream);
}
private:
typedef std::unordered_map<const node*, std::string> node2name_t;
void generate_header(std::ostream& stream) {
stream << "digraph \"" << name_ << "\" {" << std::endl;
stream << " node [ shape=record ];" << std::endl;
}
void generate_nodes(std::ostream& stream) {
node2name_t node2name;
get_layer_names(node2name);
graph_traverse(root_,
[&](const layer& l) { generate_layer(stream, l, node2name); },
[&](const edge& e) { generate_edge(stream, e, node2name); });
}
void get_layer_names(node2name_t& node2name) {
std::unordered_map<std::string, int> layer_counts; // [layer_type -> num]
auto namer = [&](const layer& l) {
std::string ltype = l.layer_type();
// add quote and sequential-id
node2name[&l] = "\"" + ltype + to_string(layer_counts[l.layer_type()]++) + "\"";
};
graph_traverse(root_, namer, [&](const edge&){});
}
void generate_edge(std::ostream& stream, const edge& e, node2name_t& node2name) {
auto next = e.next();
auto prev = e.prev();
for (auto n : next) {
serial_size_t dst_port = n->prev_port(e);
serial_size_t src_port = prev->next_port(e);
stream << " " << node2name[prev] << ":out" << src_port <<
" -> " << node2name[n] << ":in" << dst_port << ";" << std::endl;
}
}
void generate_layer(std::ostream& stream, const layer& layer, node2name_t& node2name) {
stream << " " << node2name[&layer] << " [" << std::endl;
stream << " label= \"";
stream << layer.layer_type() << "|{{in";
generate_layer_channels(stream, layer.in_shape(), layer.in_types(), "in");
stream << "}|{out";
generate_layer_channels(stream, layer.out_shape(), layer.out_types(), "out");
stream << "}}\""<< std::endl;
stream << " ];" << std::endl;
}
void generate_layer_channels(std::ostream& stream,
const std::vector<shape3d>& shapes,
const std::vector<vector_type>& vtypes,
const std::string& port_prefix) {
CNN_UNREFERENCED_PARAMETER(vtypes);
for (size_t i = 0; i < shapes.size(); i++) {
stream << "|<" << port_prefix << i << ">" << shapes[i] << "(" << vtypes[i] << ")";
}
}
void generate_footer(std::ostream& stream) {
stream << "}" << std::endl;
}
layer* root_;
std::string name_;
};
} // namespace tiny_dnn
tiny_dnn::graph_visualizer
utility for graph visualization
Definition graph_visualizer.h:38
tiny_dnn::graph_visualizer::generate
void generate(std::ostream &stream)
generate graph structure in dot language format
Definition graph_visualizer.h:50
tiny_dnn::image
Simple image utility class.
Definition image.h:94
tiny_dnn::layer
base class of all kind of NN layers
Definition layer.h:62
tiny_dnn::network
A model of neural networks in tiny-dnn.
Definition network.h:167