Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Tiago Peixoto
graph-tool
Commits
9dc8c691
Commit
9dc8c691
authored
Sep 13, 2015
by
Tiago Peixoto
Browse files
Get rid of inconsistent CamelCase in GraphInterface methods
parent
fa6816e0
Changes
78
Hide whitespace changes
Inline
Side-by-side
src/graph/centrality/graph_betweenness.cc
View file @
9dc8c691
...
...
@@ -140,10 +140,10 @@ void betweenness(GraphInterface& g, boost::any weight,
{
run_action
<>
()
(
g
,
std
::
bind
<>
(
get_weighted_betweenness
(),
std
::
placeholders
::
_1
,
g
.
G
et
V
ertex
I
ndex
(),
std
::
placeholders
::
_1
,
g
.
g
et
_v
ertex
_i
ndex
(),
std
::
placeholders
::
_2
,
std
::
placeholders
::
_3
,
weight
,
normalize
,
g
.
G
et
NumberOfV
ertices
(),
g
.
G
et
MaxE
dge
I
ndex
()),
g
.
g
et
_num_v
ertices
(),
g
.
g
et
_max_e
dge
_i
ndex
()),
edge_floating_properties
(),
vertex_floating_properties
())
(
edge_betweenness
,
vertex_betweenness
);
...
...
@@ -152,9 +152,9 @@ void betweenness(GraphInterface& g, boost::any weight,
{
run_action
<>
()
(
g
,
std
::
bind
<
void
>
(
get_betweenness
(),
std
::
placeholders
::
_1
,
g
.
G
et
V
ertex
I
ndex
(),
std
::
placeholders
::
_2
,
g
.
g
et
_v
ertex
_i
ndex
(),
std
::
placeholders
::
_2
,
std
::
placeholders
::
_3
,
normalize
,
g
.
G
et
NumberOfV
ertices
()),
g
.
g
et
_num_v
ertices
()),
edge_floating_properties
(),
vertex_floating_properties
())
(
edge_betweenness
,
vertex_betweenness
);
...
...
src/graph/centrality/graph_closeness.cc
View file @
9dc8c691
...
...
@@ -35,7 +35,7 @@ void do_get_closeness(GraphInterface& gi, boost::any weight,
{
run_action
<>
()(
gi
,
std
::
bind
(
get_closeness
(),
placeholders
::
_1
,
gi
.
G
et
V
ertex
I
ndex
(),
no_weightS
(),
gi
.
g
et
_v
ertex
_i
ndex
(),
no_weightS
(),
placeholders
::
_2
,
harmonic
,
norm
),
writable_vertex_scalar_properties
())(
closeness
);
}
...
...
@@ -43,7 +43,7 @@ void do_get_closeness(GraphInterface& gi, boost::any weight,
{
run_action
<>
()(
gi
,
std
::
bind
(
get_closeness
(),
placeholders
::
_1
,
gi
.
G
et
V
ertex
I
ndex
(),
placeholders
::
_2
,
gi
.
g
et
_v
ertex
_i
ndex
(),
placeholders
::
_2
,
placeholders
::
_3
,
harmonic
,
norm
),
edge_scalar_properties
(),
writable_vertex_scalar_properties
())(
weight
,
closeness
);
...
...
src/graph/centrality/graph_eigentrust.cc
View file @
9dc8c691
...
...
@@ -38,7 +38,7 @@ size_t eigentrust(GraphInterface& g, boost::any c, boost::any t,
size_t
iter
=
0
;
run_action
<>
()
(
g
,
bind
(
get_eigentrust
(),
_1
,
g
.
G
et
V
ertex
I
ndex
(),
g
.
G
et
E
dge
I
ndex
(),
_2
,
_1
,
g
.
g
et
_v
ertex
_i
ndex
(),
g
.
g
et
_e
dge
_i
ndex
(),
_2
,
_3
,
epslon
,
max_iter
,
ref
(
iter
)),
writable_edge_scalar_properties
(),
vertex_floating_properties
())(
c
,
t
);
...
...
src/graph/centrality/graph_eigenvector.cc
View file @
9dc8c691
...
...
@@ -42,7 +42,7 @@ long double eigenvector(GraphInterface& g, boost::any w, boost::any c,
long
double
eig
=
0
;
run_action
<>
()
(
g
,
std
::
bind
(
get_eigenvector
(),
placeholders
::
_1
,
g
.
G
et
V
ertex
I
ndex
(),
(
g
,
std
::
bind
(
get_eigenvector
(),
placeholders
::
_1
,
g
.
g
et
_v
ertex
_i
ndex
(),
placeholders
::
_2
,
placeholders
::
_3
,
epsilon
,
max_iter
,
std
::
ref
(
eig
)),
weight_props_t
(),
...
...
src/graph/centrality/graph_hits.cc
View file @
9dc8c691
...
...
@@ -68,7 +68,7 @@ long double hits(GraphInterface& g, boost::any w, boost::any x, boost::any y,
long
double
eig
=
0
;
run_action
<>
()
(
g
,
std
::
bind
(
get_hits_dispatch
(),
placeholders
::
_1
,
g
.
G
et
V
ertex
I
ndex
(),
(
g
,
std
::
bind
(
get_hits_dispatch
(),
placeholders
::
_1
,
g
.
g
et
_v
ertex
_i
ndex
(),
placeholders
::
_2
,
placeholders
::
_3
,
y
,
epsilon
,
max_iter
,
std
::
ref
(
eig
)),
weight_props_t
(),
...
...
src/graph/centrality/graph_katz.cc
View file @
9dc8c691
...
...
@@ -53,7 +53,7 @@ void katz(GraphInterface& g, boost::any w, boost::any c, boost::any beta,
if
(
beta
.
empty
())
beta
=
beta_map_t
(
1.
);
run_action
<>
()(
g
,
std
::
bind
(
get_katz
(),
placeholders
::
_1
,
g
.
G
et
V
ertex
I
ndex
(),
run_action
<>
()(
g
,
std
::
bind
(
get_katz
(),
placeholders
::
_1
,
g
.
g
et
_v
ertex
_i
ndex
(),
placeholders
::
_2
,
placeholders
::
_3
,
placeholders
::
_4
,
alpha
,
epsilon
,
max_iter
),
weight_props_t
(),
...
...
src/graph/centrality/graph_pagerank.cc
View file @
9dc8c691
...
...
@@ -42,7 +42,7 @@ size_t pagerank(GraphInterface& g, boost::any rank, boost::any pers,
pers_props_t
;
if
(
pers
.
empty
())
pers
=
pers_map_t
(
1.0
/
g
.
G
et
NumberOfV
ertices
());
pers
=
pers_map_t
(
1.0
/
g
.
g
et
_num_v
ertices
());
typedef
ConstantPropertyMap
<
double
,
GraphInterface
::
edge_t
>
weight_map_t
;
typedef
boost
::
mpl
::
push_back
<
edge_scalar_properties
,
weight_map_t
>::
type
...
...
@@ -57,7 +57,7 @@ size_t pagerank(GraphInterface& g, boost::any rank, boost::any pers,
size_t
iter
;
run_action
<>
()
(
g
,
std
::
bind
(
get_pagerank
(),
placeholders
::
_1
,
g
.
G
et
V
ertex
I
ndex
(),
placeholders
::
_2
,
placeholders
::
_1
,
g
.
g
et
_v
ertex
_i
ndex
(),
placeholders
::
_2
,
placeholders
::
_3
,
placeholders
::
_4
,
d
,
epsilon
,
max_iter
,
std
::
ref
(
iter
)),
vertex_floating_properties
(),
...
...
src/graph/centrality/graph_trust_transitivity.cc
View file @
9dc8c691
...
...
@@ -37,7 +37,7 @@ void trust_transitivity(GraphInterface& g, int64_t source, int64_t target,
throw
ValueException
(
"vertex property must be of floating point valued vector type"
);
run_action
<>
()(
g
,
bind
<
void
>
(
get_trust_transitivity
(),
_1
,
g
.
G
et
V
ertex
I
ndex
(),
bind
<
void
>
(
get_trust_transitivity
(),
_1
,
g
.
g
et
_v
ertex
_i
ndex
(),
source
,
target
,
_2
,
_3
),
edge_floating_properties
(),
vertex_floating_vector_properties
())(
c
,
t
);
...
...
src/graph/clustering/graph_clustering.cc
View file @
9dc8c691
...
...
@@ -34,25 +34,25 @@ using namespace graph_tool;
boost
::
python
::
tuple
global_clustering
(
GraphInterface
&
g
)
{
double
c
,
c_err
;
bool
directed
=
g
.
G
et
D
irected
();
g
.
S
et
D
irected
(
false
);
bool
directed
=
g
.
g
et
_d
irected
();
g
.
s
et
_d
irected
(
false
);
run_action
<
graph_tool
::
detail
::
never_directed
>
()
(
g
,
std
::
bind
(
get_global_clustering
(),
std
::
placeholders
::
_1
,
std
::
ref
(
c
),
std
::
ref
(
c_err
)))();
g
.
S
et
D
irected
(
directed
);
g
.
s
et
_d
irected
(
directed
);
return
boost
::
python
::
make_tuple
(
c
,
c_err
);
}
void
local_clustering
(
GraphInterface
&
g
,
boost
::
any
prop
)
{
bool
directed
=
g
.
G
et
D
irected
();
g
.
S
et
D
irected
(
false
);
bool
directed
=
g
.
g
et
_d
irected
();
g
.
s
et
_d
irected
(
false
);
run_action
<
graph_tool
::
detail
::
never_directed
>
()
(
g
,
std
::
bind
(
set_clustering_to_property
(),
std
::
placeholders
::
_1
,
std
::
placeholders
::
_2
),
writable_vertex_scalar_properties
())(
prop
);
g
.
S
et
D
irected
(
directed
);
g
.
s
et
_d
irected
(
directed
);
}
using
namespace
boost
::
python
;
...
...
src/graph/clustering/graph_extended_clustering.cc
View file @
9dc8c691
...
...
@@ -82,7 +82,7 @@ void extended_clustering(GraphInterface& g, boost::python::list props)
boost
::
any
vprop
=
prop_vector
<
writable_vertex_scalar_properties
>
()
(
cmaps
,
num_vertices
(
g
.
G
et
G
raph
()));
(
cmaps
,
num_vertices
(
g
.
g
et
_g
raph
()));
if
(
vprop
.
empty
())
throw
ValueException
(
"all vertex properties must be of the same"
" floating point type"
);
...
...
@@ -93,7 +93,7 @@ void extended_clustering(GraphInterface& g, boost::python::list props)
run_action
<>
()
(
g
,
std
::
bind
<
void
>
(
get_extended_clustering
(),
placeholders
::
_1
,
any_cast
<
GraphInterface
::
vertex_index_map_t
>
(
g
.
G
et
V
ertex
I
ndex
()),
any_cast
<
GraphInterface
::
vertex_index_map_t
>
(
g
.
g
et
_v
ertex
_i
ndex
()),
placeholders
::
_2
),
properties_vector
())
(
vprop
);
}
src/graph/clustering/graph_motifs.cc
View file @
9dc8c691
...
...
@@ -70,7 +70,7 @@ void get_motifs(GraphInterface& g, size_t k, boost::python::list subgraph_list,
bool
fill_list
,
rng_t
&
rng
)
{
boost
::
any
list
;
if
(
g
.
G
et
D
irected
())
if
(
g
.
g
et
_d
irected
())
list
=
vector
<
d_graph_t
>
();
else
list
=
vector
<
u_graph_t
>
();
...
...
@@ -139,7 +139,7 @@ void get_motifs(GraphInterface& g, size_t k, boost::python::list subgraph_list,
{
GraphInterface
sub
;
sub
.
S
et
D
irected
(
g
.
G
et
D
irected
());
sub
.
s
et
_d
irected
(
g
.
g
et
_d
irected
());
typedef
graph_tool
::
detail
::
get_all_graph_views
::
apply
<
graph_tool
::
detail
::
filt_scalar_type
,
boost
::
mpl
::
bool_
<
false
>
,
boost
::
mpl
::
bool_
<
false
>
,
...
...
src/graph/community/graph_blockmodel.cc
View file @
9dc8c691
...
...
@@ -179,16 +179,16 @@ boost::any do_create_emat(GraphInterface& gi, boost::any ob,
vmap_t
;
vmap_t
b
=
any_cast
<
vmap_t
>
(
ob
);
if
(
gi
.
G
et
D
irected
())
if
(
gi
.
g
et
_d
irected
())
{
run_action
<>
()(
gi
,
std
::
bind
<
void
>
(
create_emat
(),
placeholders
::
_1
,
std
::
ref
(
b
),
std
::
ref
(
bgi
.
G
et
G
raph
()),
std
::
ref
(
bgi
.
g
et
_g
raph
()),
std
::
ref
(
emat
)))();
}
else
{
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
ug
(
bgi
.
G
et
G
raph
());
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
ug
(
bgi
.
g
et
_g
raph
());
run_action
<>
()(
gi
,
std
::
bind
<
void
>
(
create_emat
(),
placeholders
::
_1
,
std
::
ref
(
b
),
std
::
ref
(
ug
),
...
...
@@ -206,17 +206,17 @@ boost::any do_create_ehash(GraphInterface& gi, boost::any ob,
vmap_t
;
vmap_t
b
=
any_cast
<
vmap_t
>
(
ob
);
if
(
gi
.
G
et
D
irected
())
if
(
gi
.
g
et
_d
irected
())
{
run_action
<>
()(
gi
,
std
::
bind
<
void
>
(
create_ehash
(),
placeholders
::
_1
,
std
::
ref
(
b
),
std
::
ref
(
bgi
.
G
et
G
raph
()),
std
::
ref
(
bgi
.
g
et
_g
raph
()),
std
::
ref
(
emat
),
std
::
ref
(
rng
)))();
}
else
{
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
ug
(
bgi
.
G
et
G
raph
());
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
ug
(
bgi
.
g
et
_g
raph
());
run_action
<>
()(
gi
,
std
::
bind
<
void
>
(
create_ehash
(),
placeholders
::
_1
,
std
::
ref
(
b
),
std
::
ref
(
ug
),
...
...
@@ -293,11 +293,11 @@ struct move_sweep_dispatch
if
(
is_directed
::
apply
<
Graph
>::
type
::
value
)
{
dispatch
(
mrs
,
mrp
,
mrm
,
wr
,
b
,
g
,
emat
,
sampler
,
cavity_sampler
,
bgi
.
G
et
G
raph
(),
weighted
);
bgi
.
g
et
_g
raph
(),
weighted
);
}
else
{
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
ug
(
bgi
.
G
et
G
raph
());
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
ug
(
bgi
.
g
et
_g
raph
());
dispatch
(
mrs
,
mrp
,
mrm
,
wr
,
b
,
g
,
emat
,
sampler
,
cavity_sampler
,
ug
,
weighted
);
}
...
...
@@ -489,7 +489,7 @@ boost::python::object do_move_sweep(GraphInterface& gi, GraphInterface& bgi,
label
,
vlist
,
block_list
,
target_list
,
deg_corr
,
dense
,
multigraph
,
beta
,
sequential
,
parallel
,
random_move
,
c
,
verbose
,
gi
.
G
et
MaxE
dge
I
ndex
(),
nmerges
,
niter
,
merge_map
,
gi
.
g
et
_max_e
dge
_i
ndex
(),
nmerges
,
niter
,
merge_map
,
partition_stats
,
rng
,
S
,
nmoves
,
bgi
),
mrs
,
mrp
,
mrm
,
wr
,
b
,
placeholders
::
_1
,
std
::
ref
(
emat
),
sampler
,
cavity_sampler
,
weighted
))();
...
...
@@ -531,11 +531,11 @@ boost::any do_build_egroups(GraphInterface& gi, GraphInterface& bgi,
boost
::
any
oegroups
;
run_action
<
graph_tool
::
detail
::
all_graph_views
,
boost
::
mpl
::
true_
>
()
(
gi
,
std
::
bind
<
void
>
(
build_egroups
(),
b
,
std
::
ref
(
oegroups
),
esrcpos
.
get_unchecked
(
gi
.
G
et
MaxE
dge
I
ndex
()),
etgtpos
.
get_unchecked
(
gi
.
G
et
MaxE
dge
I
ndex
()),
eweights
.
get_unchecked
(
gi
.
G
et
MaxE
dge
I
ndex
()),
placeholders
::
_1
,
bgi
.
G
et
V
ertex
I
ndex
(),
bgi
.
G
et
NumberOfV
ertices
(),
weighted
,
empty
))();
esrcpos
.
get_unchecked
(
gi
.
g
et
_max_e
dge
_i
ndex
()),
etgtpos
.
get_unchecked
(
gi
.
g
et
_max_e
dge
_i
ndex
()),
eweights
.
get_unchecked
(
gi
.
g
et
_max_e
dge
_i
ndex
()),
placeholders
::
_1
,
bgi
.
g
et
_v
ertex
_i
ndex
(),
bgi
.
g
et
_num_v
ertices
(),
weighted
,
empty
))();
return
oegroups
;
}
...
...
@@ -580,7 +580,7 @@ void do_collect_edge_marginals(GraphInterface& gi, GraphInterface& gbi,
run_action
<
graph_tool
::
detail
::
all_graph_views
,
boost
::
mpl
::
true_
>
()
(
gi
,
std
::
bind
<
void
>
(
collect_edge_marginals_dispatch
(),
placeholders
::
_1
,
B
,
b
,
p
,
std
::
tuple
<
boost
::
any
,
GraphInterface
&>
(
gbi
.
G
et
G
raph
V
iew
(),
gbi
)))();
std
::
tuple
<
boost
::
any
,
GraphInterface
&>
(
gbi
.
g
et
_g
raph
_v
iew
(),
gbi
)))();
}
boost
::
python
::
tuple
do_bethe_entropy
(
GraphInterface
&
gi
,
size_t
B
,
boost
::
any
op
,
...
...
src/graph/community/graph_blockmodel_covariates.cc
View file @
9dc8c691
...
...
@@ -151,13 +151,13 @@ struct cov_move_sweep_dispatch
{
vector
<
std
::
reference_wrapper
<
Graph
>>
gs
;
for
(
GraphInterface
&
ag
:
ags
)
gs
.
push_back
(
*
any_cast
<
Graph
*>
(
ag
.
G
et
G
raph
V
iew
()));
gs
.
push_back
(
*
any_cast
<
Graph
*>
(
ag
.
g
et
_g
raph
_v
iew
()));
if
(
is_directed
::
apply
<
Graph
>::
type
::
value
)
{
vector
<
std
::
reference_wrapper
<
GraphInterface
::
multigraph_t
>>
bgs
;
for
(
GraphInterface
&
bgi
:
bgis
)
bgs
.
push_back
(
bgi
.
G
et
G
raph
());
bgs
.
push_back
(
bgi
.
g
et
_g
raph
());
dispatch
(
mrs
,
mrp
,
mrm
,
wr
,
b
,
bs
,
g
,
gs
,
emat
,
sampler
,
cavity_sampler
,
bgs
,
weighted
);
}
...
...
@@ -165,7 +165,7 @@ struct cov_move_sweep_dispatch
{
vector
<
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>>
ubgs
;
for
(
GraphInterface
&
bgi
:
bgis
)
ubgs
.
push_back
(
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
(
bgi
.
G
et
G
raph
()));
ubgs
.
push_back
(
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
(
bgi
.
g
et
_g
raph
()));
vector
<
std
::
reference_wrapper
<
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>>>
rubgs
;
for
(
auto
&
bg
:
ubgs
)
rubgs
.
push_back
(
bg
);
...
...
@@ -577,7 +577,7 @@ boost::python::object do_cov_move_sweep(GraphInterface& gi,
vector
<
size_t
>
eidx
;
for
(
GraphInterface
&
g
:
gis
)
eidx
.
push_back
(
g
.
G
et
MaxE
dge
I
ndex
());
eidx
.
push_back
(
g
.
g
et
_max_e
dge
_i
ndex
());
auto
bgi
=
from_rlist
<
GraphInterface
>
(
obgi
);
...
...
@@ -606,7 +606,7 @@ boost::python::object do_cov_move_sweep(GraphInterface& gi,
label
,
vlist
,
block_list
,
target_blocks
,
deg_corr
,
dense
,
multigraph
,
beta
,
sequential
,
parallel
,
random_move
,
node_coherent
,
confine_layers
,
c
,
verbose
,
gi
.
G
et
MaxE
dge
I
ndex
(),
eidx
,
nmerges
,
niter
,
merge_map
,
gi
.
g
et
_max_e
dge
_i
ndex
(),
eidx
,
nmerges
,
niter
,
merge_map
,
partition_stats
,
overlap_partition_stats
,
overlap_stats
,
master
,
slave
,
rng
,
S
,
nmoves
,
bgi
,
bmap
,
brmap
,
free_blocks
,
B
),
std
::
ref
(
mrs
),
std
::
ref
(
mrp
),
std
::
ref
(
mrm
),
std
::
ref
(
wr
),
...
...
@@ -653,7 +653,7 @@ void do_ec_hist(GraphInterface& gi, boost::any& aevc, boost::any& aec)
GraphInterface
::
edge_index_map_t
>::
type
emap_t
;
typename
emap_t
::
unchecked_t
ec
=
any_cast
<
emap_t
&>
(
aec
).
get_unchecked
(
gi
.
G
et
MaxE
dge
I
ndex
());
any_cast
<
emap_t
&>
(
aec
).
get_unchecked
(
gi
.
g
et
_max_e
dge
_i
ndex
());
run_action
<>
()(
gi
,
std
::
bind
<
void
>
(
ec_hist
(),
placeholders
::
_1
,
placeholders
::
_2
,
std
::
ref
(
ec
)),
edge_properties
())(
aevc
);
...
...
src/graph/community/graph_blockmodel_covariates.hh
View file @
9dc8c691
...
...
@@ -83,7 +83,7 @@ struct split_graph
auto
iter
=
vhmap
[
v
].
find
(
l
);
if
(
iter
==
vhmap
[
v
].
end
())
{
size_t
u
=
add_vertex
(
us
[
l
].
get
().
G
et
G
raph
());
size_t
u
=
add_vertex
(
us
[
l
].
get
().
g
et
_g
raph
());
vhmap
[
v
][
l
]
=
u
;
size_t
pos
=
lower_bound
(
vc
[
v
].
begin
(),
vc
[
v
].
end
(),
l
)
-
vc
[
v
].
begin
();
vc
[
v
].
insert
(
vc
[
v
].
begin
()
+
pos
,
l
);
...
...
@@ -124,7 +124,7 @@ struct split_graph
auto
u_s
=
get_v
(
s
,
l
);
auto
u_t
=
get_v
(
t
,
l
);
auto
ne
=
add_edge
(
u_s
,
u_t
,
us
[
l
].
get
().
G
et
G
raph
()).
first
;
auto
ne
=
add_edge
(
u_s
,
u_t
,
us
[
l
].
get
().
g
et
_g
raph
()).
first
;
ueweight
[
l
].
get
()[
ne
]
=
eweight
[
e
];
}
}
...
...
src/graph/community/graph_blockmodel_overlap.cc
View file @
9dc8c691
...
...
@@ -116,11 +116,11 @@ struct move_sweep_overlap_dispatch
if
(
is_directed
::
apply
<
Graph
>::
type
::
value
)
{
dispatch
(
mrs
,
mrp
,
mrm
,
wr
,
b
,
g
,
emat
,
sampler
,
cavity_sampler
,
bgi
.
G
et
G
raph
(),
weighted
);
bgi
.
g
et
_g
raph
(),
weighted
);
}
else
{
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
ug
(
bgi
.
G
et
G
raph
());
UndirectedAdaptor
<
GraphInterface
::
multigraph_t
>
ug
(
bgi
.
g
et
_g
raph
());
dispatch
(
mrs
,
mrp
,
mrm
,
wr
,
b
,
g
,
emat
,
sampler
,
cavity_sampler
,
ug
,
weighted
);
}
...
...
@@ -324,7 +324,7 @@ do_move_sweep_overlap(GraphInterface& gi, GraphInterface& bgi, boost::any& emat,
(
eweight
,
vweight
,
oegroups
,
esrcpos
,
etgtpos
,
label
,
vlist
,
block_list
,
target_blocks
,
deg_corr
,
dense
,
multigraph
,
parallel_edges
,
beta
,
sequential
,
parallel
,
random_move
,
c
,
node_coherent
,
verbose
,
gi
.
G
et
MaxE
dge
I
ndex
(),
random_move
,
c
,
node_coherent
,
verbose
,
gi
.
g
et
_max_e
dge
_i
ndex
(),
nmerges
,
niter
,
merge_map
,
overlap_stats
,
partition_stats
,
rng
,
S
,
nmoves
,
bgi
),
mrs
,
mrp
,
mrm
,
wr
,
b
,
placeholders
::
_1
,
...
...
@@ -476,7 +476,7 @@ void do_get_eg_overlap(GraphInterface& gi, GraphInterface& egi, boost::any obe,
emap_t
eindex
=
any_cast
<
emap_t
>
(
oeindex
);
run_action
<>
()(
gi
,
std
::
bind
(
get_eg_overlap
(),
placeholders
::
_1
,
std
::
ref
(
egi
.
G
et
G
raph
()),
be
,
b
,
node_index
,
std
::
ref
(
egi
.
g
et
_g
raph
()),
be
,
b
,
node_index
,
half_edges
,
eindex
))();
}
...
...
@@ -534,7 +534,7 @@ void do_get_be_overlap(GraphInterface& gi, GraphInterface& egi, boost::any obe,
vimap_t
node_index
=
any_cast
<
vimap_t
>
(
onode_index
);
run_action
<>
()(
gi
,
std
::
bind
(
get_be_overlap
(),
placeholders
::
_1
,
std
::
ref
(
egi
.
G
et
G
raph
()),
be
,
b
,
std
::
ref
(
egi
.
g
et
_g
raph
()),
be
,
b
,
node_index
))();
}
...
...
src/graph/community/graph_community.cc
View file @
9dc8c691
...
...
@@ -66,7 +66,7 @@ void community_structure(GraphInterface& g, double gamma, string corr_name,
throw
ValueException
(
"invalid correlation type: "
+
corr_name
);
run_action
<
graph_tool
::
detail
::
never_directed
>
()
(
g
,
std
::
bind
(
get_communities_selector
(
corr
,
g
.
G
et
V
ertex
I
ndex
()),
(
g
,
std
::
bind
(
get_communities_selector
(
corr
,
g
.
g
et
_v
ertex
_i
ndex
()),
placeholders
::
_1
,
placeholders
::
_2
,
placeholders
::
_3
,
gamma
,
n_iter
,
make_pair
(
Tmin
,
Tmax
),
Nspins
,
std
::
ref
(
rng
),
make_pair
(
verbose
,
history_file
)),
...
...
src/graph/community/graph_community_network.cc
View file @
9dc8c691
...
...
@@ -101,7 +101,7 @@ void community_network(GraphInterface& gi, GraphInterface& cgi,
run_action
<>
()
(
gi
,
std
::
bind
(
get_community_network_vertices_dispatch
(),
placeholders
::
_1
,
std
::
ref
(
cgi
.
G
et
G
raph
()),
placeholders
::
_1
,
std
::
ref
(
cgi
.
g
et
_g
raph
()),
placeholders
::
_2
,
condensed_community_property
,
placeholders
::
_3
,
vertex_count
),
writable_vertex_properties
(),
vweight_properties
())
...
...
src/graph/community/graph_community_network_eavg_imp1.cc
View file @
9dc8c691
...
...
@@ -68,7 +68,7 @@ void sum_eprops(GraphInterface& gi, GraphInterface& cgi,
run_action
<
graph_tool
::
detail
::
always_directed
>
()
(
gi
,
std
::
bind
(
get_edge_sum_dispatch
(),
placeholders
::
_1
,
std
::
ref
(
cgi
.
G
et
G
raph
()),
placeholders
::
_1
,
std
::
ref
(
cgi
.
g
et
_g
raph
()),
placeholders
::
_2
,
condensed_community_property
,
placeholders
::
_3
,
ceprop
,
self_loops
),
...
...
src/graph/community/graph_community_network_edges.cc
View file @
9dc8c691
...
...
@@ -76,7 +76,7 @@ void community_network_edges(GraphInterface& gi, GraphInterface& cgi,
run_action
<>
()
(
gi
,
std
::
bind
(
get_community_network_edges_dispatch
(
self_loops
,
parallel_edges
),
placeholders
::
_1
,
std
::
ref
(
cgi
.
G
et
G
raph
()),
cgi
.
G
et
E
dge
I
ndex
(),
placeholders
::
_1
,
std
::
ref
(
cgi
.
g
et
_g
raph
()),
cgi
.
g
et
_e
dge
_i
ndex
(),
placeholders
::
_2
,
condensed_community_property
,
placeholders
::
_3
,
edge_count
),
writable_vertex_properties
(),
eweight_properties
())
...
...
src/graph/community/graph_community_network_vavg.cc
View file @
9dc8c691
...
...
@@ -107,7 +107,7 @@ void community_network_vavg(GraphInterface& gi, GraphInterface& cgi,
// sum weighted values
run_action
<
graph_tool
::
detail
::
always_directed_never_reversed
>
()
(
gi
,
std
::
bind
(
get_vertex_sum_dispatch
(),
placeholders
::
_1
,
std
::
ref
(
cgi
.
G
et
G
raph
()),
placeholders
::
_1
,
std
::
ref
(
cgi
.
g
et
_g
raph
()),
placeholders
::
_2
,
condensed_community_property
,
placeholders
::
_3
,
cvprop
),
...
...
@@ -119,7 +119,7 @@ void community_network_vavg(GraphInterface& gi, GraphInterface& cgi,
// sum unweighted values
run_action
<
graph_tool
::
detail
::
always_directed_never_reversed
>
()
(
gi
,
std
::
bind
(
get_vertex_sum_dispatch
(),
placeholders
::
_1
,
std
::
ref
(
cgi
.
G
et
G
raph
()),
placeholders
::
_1
,
std
::
ref
(
cgi
.
g
et
_g
raph
()),
placeholders
::
_2
,
condensed_community_property
,
placeholders
::
_3
,
cvprop
),
...
...
Prev
1
2
3
4
Next
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment