NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.5: NDN, CCN, CCNx, content centric networks
API Documentation
Main Page
Related Pages
Modules
+
Namespaces
Namespace List
+
Namespace Members
+
All
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
y
z
+
Functions
_
a
b
c
d
e
f
g
h
i
l
m
n
o
p
r
s
t
u
v
w
+
Variables
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
+
Typedefs
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
y
+
Enumerations
a
b
c
d
f
i
k
l
n
p
q
r
s
t
u
v
+
Enumerator
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
z
+
Classes
Class List
Class Index
Class Hierarchy
+
Class Members
+
All
_
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
~
+
Functions
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
r
s
t
u
v
w
~
+
Variables
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
+
Typedefs
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
r
s
t
u
v
w
+
Enumerations
_
a
c
e
r
s
t
v
+
Enumerator
a
c
d
e
f
h
i
l
m
n
p
r
s
u
v
w
+
Related Functions
a
b
c
d
e
f
g
i
k
l
m
n
o
p
s
v
+
Files
File List
+
File Members
+
All
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
r
s
t
u
v
w
z
+
Functions
b
c
d
e
f
g
h
m
o
p
r
s
t
u
v
w
+
Variables
a
b
c
d
e
f
g
i
k
l
m
n
p
r
s
t
+
Typedefs
b
c
d
e
i
m
p
s
u
w
Enumerations
Enumerator
+
Macros
_
a
b
d
e
i
l
m
n
o
p
r
s
t
u
v
z
•
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Friends
Macros
Modules
Pages
remove-loops.hpp
Go to the documentation of this file.
1
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
21
#ifndef LFID_REMOVE_LOOPS_H
22
#define LFID_REMOVE_LOOPS_H
23
24
#include <boost/graph/adjacency_list.hpp>
25
26
#include "ns3/ndnSIM/helper/lfid/abstract-fib.hpp"
27
28
namespace
ns3
{
29
namespace
ndn
{
30
31
// No Vertex Property
32
// Edge Property: Weight.
33
using
DiGraph
=
34
boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, boost::no_property,
35
boost::property<boost::edge_weight_t, int>>;
36
37
void
38
getDigraphFromFib
(
DiGraph
& dg,
const
AbstractFib::AllNodeFib
& allNodeFIB,
const
int
dstId);
39
40
int
41
removeLoops
(
AbstractFib::AllNodeFib
& allNodeFIB,
bool
printOutput =
true
);
42
43
int
44
removeDeadEnds
(
AbstractFib::AllNodeFib
& allNodeFIB,
bool
printOutput =
true
);
45
46
}
// namespace ndn
47
}
// namespace ns3
48
49
#endif //LFID_REMOVE_LOOPS_H
ndn
Copyright (c) 2011-2015 Regents of the University of California.
Definition:
ndn-strategy-choice-helper.hpp:34
ns3::ndn::removeLoops
int removeLoops(AllNodeFib &allNodeFIB, bool printOutput)
Definition:
remove-loops.cpp:146
ns3::ndn::getDigraphFromFib
void getDigraphFromFib(DiGraph &dg, const AllNodeFib &allNodeFIB, const int dstId)
Fill directed graph only with edges existing in the FIB.
Definition:
remove-loops.cpp:42
ns3::ndn::removeDeadEnds
int removeDeadEnds(AllNodeFib &allNodeFIB, bool printOutput)
Definition:
remove-loops.cpp:259
ns3::ndn::AbstractFib::AllNodeFib
std::unordered_map< int, AbstractFib > AllNodeFib
Definition:
abstract-fib.hpp:41
ns3
Copyright (c) 2011-2015 Regents of the University of California.
Definition:
ndn-app-link-service.cpp:32
ns3::ndn::DiGraph
boost::adjacency_list< boost::listS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property< boost::edge_weight_t, int > > DiGraph
Definition:
remove-loops.hpp:35
ndnSIM
helper
lfid
remove-loops.hpp
Generated on Fri May 6 2022 12:34:10 for ndnSIM by
1.8.13