remove-loops.cpp File Reference

#include "remove-loops.hpp"
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/properties.hpp>
#include <boost/property_map/property_map.hpp>
#include <queue>
#include "ns3/abort.h"
#include "ns3/ndnSIM/helper/lfid/abstract-fib.hpp"

Include dependency graph for remove-loops.cpp:

Go to the source code of this file.

Classes
class	ns3::ndn::NodePrio

Namespaces
	ns3
	Copyright (c) 2011-2015 Regents of the University of California.
	ns3::ndn

Typedefs
using	ns3::ndn::AllNodeFib = AbstractFib::AllNodeFib

Functions
void	ns3::ndn::getDigraphFromFib (DiGraph &dg, const AllNodeFib &allNodeFIB, const int dstId)
	Fill directed graph only with edges existing in the FIB. More...
std::ostream &	ns3::ndn::operator<< (std::ostream &os, const NodePrio &node)
int	ns3::ndn::removeLoops (AllNodeFib &allNodeFIB, bool printOutput)
int	ns3::ndn::removeDeadEnds (AllNodeFib &allNodeFIB, bool printOutput)