#include <boost/graph/adjacency_list.hpp>
#include "ns3/ndnSIM/helper/lfid/abstract-fib.hpp"
Go to the source code of this file.
Namespaces | |
ns3 | |
Copyright (c) 2011-2015 Regents of the University of California. | |
ns3::ndn | |
Typedefs | |
using | ns3::ndn::DiGraph = boost::adjacency_list< boost::listS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property< boost::edge_weight_t, int > > |
Functions | |
void | ns3::ndn::getDigraphFromFib (DiGraph &dg, const AllNodeFib &allNodeFIB, const int dstId) |
Fill directed graph only with edges existing in the FIB. More... | |
int | ns3::ndn::removeLoops (AllNodeFib &allNodeFIB, bool printOutput) |
int | ns3::ndn::removeDeadEnds (AllNodeFib &allNodeFIB, bool printOutput) |