Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
H
haskell-gargantext
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Przemyslaw Kaminski
haskell-gargantext
Commits
21b53040
Commit
21b53040
authored
May 31, 2021
by
Przemyslaw Kaminski
Browse files
Options
Browse Files
Download
Plain Diff
Merge branch 'dev' into dev-test
parents
e2a8460a
4c7c38ee
Pipeline
#1490
failed with stage
in 44 minutes and 58 seconds
Changes
2
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
5 additions
and
3 deletions
+5
-3
API.hs
src/Gargantext/Core/Viz/Graph/API.hs
+2
-2
IGraph.hs
src/Gargantext/Core/Viz/Graph/Tools/IGraph.hs
+3
-1
No files found.
src/Gargantext/Core/Viz/Graph/API.hs
View file @
21b53040
...
...
@@ -125,7 +125,7 @@ recomputeGraph _uId nId maybeDistance = do
identity
$
nodeGraph
^.
node_parent_id
similarity
=
case
graphMetric
of
Nothing
->
withMetric
Order
2
Nothing
->
withMetric
Order
1
Just
m
->
withMetric
m
case
graph
of
...
...
@@ -159,7 +159,7 @@ computeGraph cId d nt repo = do
let
ngs
=
filterListWithRoot
MapTerm
$
mapTermListRoot
[
lId
]
nt
repo
myCooc
<-
HashMap
.
filter
(
>
1
)
-- Removing the hapax (ngrams with 1 cooc)
myCooc
<-
HashMap
.
filter
(
>
2
)
-- Removing the hapax (ngrams with 1 cooc)
<$>
getCoocByNgrams
(
Diagonal
True
)
<$>
groupNodesByNgrams
ngs
<$>
getNodesByNgramsOnlyUser
cId
(
lIds
<>
[
lId
])
nt
(
HashMap
.
keys
ngs
)
...
...
src/Gargantext/Core/Viz/Graph/Tools/IGraph.hs
View file @
21b53040
...
...
@@ -68,7 +68,9 @@ spinglass s g = toClusterNode
g''
=
mkGraphUfromEdges
(
Map
.
keys
g'
)
g'''
=
case
IG
.
isConnected
g''
of
True
->
g''
False
->
panic
"[G.C.V.G.T.Igraph: not connected graph]"
False
->
case
head
(
IG
.
decompose
g''
)
of
Nothing
->
panic
"[G.C.V.G.T.Igraph: not connected graph]"
Just
g''''
->
g''''
(
toI
,
fromI
)
=
createIndices
g
...
...
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