Skip to content
GitLab
Explorer
Connexion
Navigation principale
Rechercher ou aller à…
Projet
R
RDM_grands_graphes
Gestion
Activité
Membres
Labels
Programmation
Tickets
Tableaux des tickets
Jalons
Wiki
Wiki externe
Code
Requêtes de fusion
Dépôt
Branches
Validations
Étiquettes
Graphe du dépôt
Comparer les révisions
Extraits de code
Déploiement
Releases
Registre de paquets
Registre de conteneur
Registre de modèles
Opération
Modules Terraform
Surveillance
Incidents
Analyse
Données d'analyse des chaînes de valeur
Analyse des contributeurs
Données d'analyse du dépôt
Expériences du modèle
Aide
Aide
Support
Documentation de GitLab
Comparer les forfaits GitLab
Forum de la communauté
Contribuer à GitLab
Donner votre avis
Raccourcis clavier
?
Extraits de code
Groupes
Projets
Afficher davantage de fils d'Ariane
Louis FOURCADE
RDM_grands_graphes
Validations
03b76617
Valider
03b76617
rédigé
4 years ago
par
Louis Fourcade
Parcourir les fichiers
Options
Téléchargements
Correctifs
Plain Diff
fin TP2
parent
189896a5
Aucune branche associée trouvée
Aucune étiquette associée trouvée
Aucune requête de fusion associée trouvée
Modifications
3
Tout étendre
Masquer les modifications d'espaces
En ligne
Côte à côte
Affichage de
3 fichiers modifiés
TP2.c
+79
-0
79 ajouts, 0 suppression
TP2.c
scholar.csv
+287427
-0
287427 ajouts, 0 suppression
scholar.csv
trace_graphe.py
+35
-1
35 ajouts, 1 suppression
trace_graphe.py
avec
287541 ajouts
et
1 suppression
TP2.c
+
79
−
0
Voir le fichier @
03b76617
...
...
@@ -261,6 +261,85 @@ int main(int argc, char **argv) {
plot_out_2D_i_ul
(
"scholar.csv"
,
g
->
n
,
c
,
deg_tabl
);
// analyse des données :
// find biggest core value
int
max_core
=
0
;
for
(
unsigned
long
i
=
0
;
i
<
g
->
n
;
i
+=
1
)
{
if
(
c
[
i
]
>
max_core
)
{
max_core
=
c
[
i
];
}
}
// print biggest core value
printf
(
"########################
\n
biggest core value
\n
########################
\n
"
);
for
(
unsigned
long
i
=
0
;
i
<
g
->
n
;
i
+=
1
)
{
if
(
c
[
i
]
==
max_core
)
{
printf
(
"node [%lu] :: coreness = %i :: degree = %lu
\n
"
,
i
,
c
[
i
],
deg_tabl
[
i
]);
}
}
// find highest degree node
unsigned
long
max_degree
=
0
;
for
(
unsigned
long
i
=
0
;
i
<
g
->
n
;
i
+=
1
)
{
if
(
deg_tabl
[
i
]
>
max_degree
)
{
max_degree
=
deg_tabl
[
i
];
}
}
// print highest degree node
printf
(
"
\n\n
########################
\n
Highest degree
\n
########################
\n
"
);
for
(
unsigned
long
i
=
0
;
i
<
g
->
n
;
i
+=
1
)
{
if
(
deg_tabl
[
i
]
==
max_degree
)
{
printf
(
"node [%lu] :: coreness = %i :: degree = %lu
\n
"
,
i
,
c
[
i
],
deg_tabl
[
i
]);
}
}
// ######################
// DATA results
// ######################
// higest degree : 25501 = Ali Khademhosseini
// highest coreness :
// node [55807] :: coreness = 14 :: degree = 28 = Sa-kwang Song
// node [55809] :: coreness = 14 :: degree = 23 = Sung-Pil Choi
// node [55813] :: coreness = 14 :: degree = 26 = Chang-Hoo Jeong
// node [55815] :: coreness = 14 :: degree = 24 = Yun-soo Choi
// node [55816] :: coreness = 14 :: degree = 21 = Hong-Woo Chun
// node [71188] :: coreness = 14 :: degree = 22 = Jinhyung Kim
// node [123670] :: coreness = 14 :: degree = 31 = Hanmin Jung
// node [123671] :: coreness = 14 :: degree = 22 = Do-Heon Jeong
// node [123672] :: coreness = 14 :: degree = 26 = Myunggwon Hwang
// node [123673] :: coreness = 14 :: degree = 20 = Won-Kyung Sung
// node [123675] :: coreness = 14 :: degree = 19 = Hwamook Yoon
// node [123676] :: coreness = 14 :: degree = 22 = Minho Lee
// node [123677] :: coreness = 14 :: degree = 21 = Won-Goo Lee
// node [123678] :: coreness = 14 :: degree = 17 = Jung Ho Um
// node [123680] :: coreness = 14 :: degree = 26 = Dongmin Seo
// node [123681] :: coreness = 14 :: degree = 18 = Mi-Nyeong Hwang
// node [123682] :: coreness = 14 :: degree = 21 = Sung J. Jung
// node [123688] :: coreness = 14 :: degree = 24 = Minhee Cho
// node [123689] :: coreness = 14 :: degree = 26 = Sungho Shin
// node [123694] :: coreness = 14 :: degree = 29 = Seungwoo Lee
// node [123695] :: coreness = 14 :: degree = 15 = Heekwan Koo
// node [123696] :: coreness = 14 :: degree = 16 = Jinhee Lee
// node [123697] :: coreness = 14 :: degree = 24 = Taehong Kim
// node [192697] :: coreness = 14 :: degree = 18 = Mikyoung Lee
// node [192698] :: coreness = 14 :: degree = 17 = Ha-neul Yeom
// node [192699] :: coreness = 14 :: degree = 17 = Seungkyun Hong
// node [192700] :: coreness = 14 :: degree = 17 = Yun-ji Jang
free_adjlist
(
g
);
free
(
deg_tabl
);
free
(
eta
);
...
...
Ce diff est replié.
Cliquez pour l'agrandir.
scholar.csv
0 → 100644
+
287427
−
0
Voir le fichier @
03b76617
Ce diff est replié.
Cliquez pour l'agrandir.
trace_graphe.py
+
35
−
1
Voir le fichier @
03b76617
...
...
@@ -8,6 +8,7 @@ Created on Tue Mar 2 16:55:34 2021
import
pandas
as
pd
import
matplotlib.pyplot
as
plt
import
numpy
as
np
from
scipy.stats
import
gaussian_kde
...
...
@@ -17,10 +18,43 @@ import numpy as np
data
=
pd
.
read_csv
(
"
../plots/scholar.csv
"
,
sep
=
"
,
"
)
plt
.
plot
(
data
[
'
y
'
],
data
[
'
x
'
],
'
o
'
)
#plt.plot(data['y'], data['x'], c=data['x'], 'o')
plt
.
scatter
(
data
[
'
y
'
],
data
[
'
x
'
],
c
=
data
[
'
x
'
])
plt
.
xscale
(
"
log
"
)
plt
.
yscale
(
"
log
"
)
plt
.
xlabel
(
"
Degree
"
)
plt
.
ylabel
(
"
Coreness
"
)
plt
.
title
(
"
Google scholar
"
)
plt
.
show
()
x
=
data
[
'
y
'
]
y
=
data
[
'
x
'
]
# Calculate the point density
xy
=
np
.
vstack
([
x
,
y
])
z
=
gaussian_kde
(
xy
)(
xy
)
# Sort the points by density, so that the densest points are plotted last
idx
=
z
.
argsort
()
x
,
y
,
z
=
x
[
idx
],
y
[
idx
],
z
[
idx
]
z
=
z
=
(
z
/
z
.
min
())
*
(
1
/
4
)
plt
.
scatter
(
x
,
y
,
c
=
z
,
s
=
100
,
edgecolor
=
''
,
cmap
=
plt
.
cm
.
jet
)
plt
.
xscale
(
"
log
"
)
plt
.
yscale
(
"
log
"
)
plt
.
xlabel
(
"
Degree
"
)
plt
.
ylabel
(
"
Coreness
"
)
plt
.
title
(
"
Google scholar
"
)
plt
.
colorbar
()
plt
.
savefig
(
"
scholar.png
"
,
dpi
=
200
,
format
=
'
png
'
)
plt
.
show
()
########################################################################################################
...
...
Ce diff est replié.
Cliquez pour l'agrandir.
Aperçu
0%
Chargement en cours
Veuillez réessayer
ou
joindre un nouveau fichier
.
Annuler
You are about to add
0
people
to the discussion. Proceed with caution.
Terminez d'abord l'édition de ce message.
Enregistrer le commentaire
Annuler
Veuillez vous
inscrire
ou vous
se connecter
pour commenter