Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
graph-tool
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
43
Issues
43
List
Boards
Labels
Service Desk
Milestones
Merge Requests
1
Merge Requests
1
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Incidents
Environments
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Tiago Peixoto
graph-tool
Commits
0cb5e19d
Commit
0cb5e19d
authored
Jan 24, 2016
by
Tiago Peixoto
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
graph_blockmodel.hh: Some trivial cosmetic changes
parent
e8393974
Pipeline
#102
failed with stage
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
7 additions
and
8 deletions
+7
-8
src/graph/community/graph_blockmodel.hh
src/graph/community/graph_blockmodel.hh
+7
-8
No files found.
src/graph/community/graph_blockmodel.hh
View file @
0cb5e19d
...
...
@@ -970,27 +970,25 @@ inline size_t get_mrs(Vertex r, Vertex s, const Eprop& mrs, const Emat& emat,
struct
standard_neighbours_policy
{
template
<
class
Graph
,
class
Vertex
>
IterRange
<
typename
out_edge_iteratorS
<
Graph
>::
type
>
get_out_edges
(
Vertex
v
,
Graph
&
g
)
const
auto
get_out_edges
(
Vertex
v
,
Graph
&
g
)
const
{
return
out_edges_range
(
v
,
g
);
}
template
<
class
Graph
,
class
Vertex
>
IterRange
<
typename
in_edge_iteratorS
<
Graph
>::
type
>
get_in_edges
(
Vertex
v
,
Graph
&
g
)
const
auto
get_in_edges
(
Vertex
v
,
Graph
&
g
)
const
{
return
in_edges_range
(
v
,
g
);
}
template
<
class
Graph
,
class
Vertex
,
class
Weight
>
int
get_out_degree
(
Vertex
&
v
,
Graph
&
g
,
Weight
&
eweight
)
const
auto
get_out_degree
(
Vertex
&
v
,
Graph
&
g
,
Weight
&
eweight
)
const
{
return
out_degreeS
()(
v
,
g
,
eweight
);
}
template
<
class
Graph
,
class
Vertex
,
class
Weight
>
int
get_in_degree
(
Vertex
&
v
,
Graph
&
g
,
Weight
&
eweight
)
const
auto
get_in_degree
(
Vertex
&
v
,
Graph
&
g
,
Weight
&
eweight
)
const
{
return
in_degreeS
()(
v
,
g
,
eweight
);
}
...
...
@@ -1480,8 +1478,9 @@ double entries_dS(MEntries& m_entries, Eprop& mrs, EMat& emat, BGraph& bg)
double
dS
=
0
;
for
(
size_t
i
=
0
;
i
<
entries
.
size
();
++
i
)
{
auto
er
=
entries
[
i
].
first
;
auto
es
=
entries
[
i
].
second
;
auto
&
ei
=
entries
[
i
];
auto
er
=
ei
.
first
;
auto
es
=
ei
.
second
;
int
d
=
delta
[
i
];
size_t
ers
=
d_mrs
[
i
];
if
(
ers
==
numeric_limits
<
size_t
>::
max
())
...
...
Write
Preview
Markdown
is supported
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