cd873b6acf
feat(community): Addition of C++ implementation and binding related to community analysis
...
Add C++ implementations of community detection algorithms such as LPA, Greedy Modularity, Louvin, and Local Search, as well as tool functions like ego_graph, motif enumeration , and modularity calculation.
2026-06-04 15:24:36 +08:00
91e4903aa5
Add GPU-accelerated structural hole evaluation functions
2025-05-11 22:54:37 +08:00
60b3094178
GPU-based SSSP is added. Return type of BC, CC and k-core are modified.
2024-06-03 09:11:31 +00:00
a405d93eb5
BC CC k_core bug fixing and optimization among cpp, gpu, py ver
2024-04-25 16:12:35 +00:00
7bea776bc1
integrate gpu_easygraph into cpp_easygraph
2024-04-24 14:39:58 +00:00
78f334fd09
feat: add generate_linkgraph function for both graph and directed graph in c version
2023-04-29 13:29:56 +08:00
bf806f6f68
fixed: pred in DiGraphC
2023-04-28 13:20:29 +08:00
5de5be65c4
fixed: pred in DiGraphC
2023-04-28 12:43:07 +08:00
473d893c47
fixed: only init once in betweenness and closeness by ybd
2023-04-22 23:41:29 -05:00
ee3cc84805
feat: add sources option for closeness and betweenness --ybd
2023-04-21 12:39:48 -05:00
09cdb11ccd
fixed: handle problems of node input that is not in the graph; Increase segement_tree size allocation
2023-04-19 20:25:47 +08:00
7c3803d367
fixed: add initialize function for segment_tree
2023-04-18 18:22:12 +08:00
5e6c686dd3
fixed: dis in closeness and betweenness is initialized to INT_MAX, t[i] in segment_tree.cpp is initialized to INT_MAX
2023-04-18 15:28:16 +08:00
1c61f2dde0
fixed: segeenntation fault in macos and windows
2023-04-18 00:21:38 -05:00
a6ac7b0b16
remove pbds, instead of segemnt tree
2023-04-17 21:04:36 -05:00
ab04c91a23
fixed: add cutoff for closeness and betweenness
2023-04-08 10:03:31 -05:00
2729215b74
fix cpp typos
2023-04-04 23:08:30 +08:00
ef4f8278f1
fixed:add k_core cache
2023-04-01 10:33:45 -05:00
9964be7163
fixed: _get_edges() in cpp
2023-03-23 12:51:27 +08:00
299908c18f
feat:cpp version for dijkstra、closeness_centrality、betweenness_centrality
2023-03-22 19:23:49 +08:00
679fe46ae1
feat: k_core in module cores
2023-03-18 19:38:35 +08:00
dad9a4001f
feat: add cpp_dijkstra_multisource
2023-03-17 16:03:42 +08:00
a47399f5d5
fix density bug
2022-09-21 13:26:20 +08:00
0c1340c746
fix:connected_component
2022-09-14 16:57:19 +08:00
9a0ec555e0
kruskal mst
2022-09-10 15:56:52 +08:00
599767ca1c
feat: add to_index_node_graph & modify test ecript
2022-08-27 19:30:50 +08:00
e3f087a64a
feat: add py() for cpp class and cpp() for py class
2022-08-25 22:06:47 +08:00
8548af5514
fix: number of edges in digraph
2022-08-22 15:24:12 +08:00
d3013eb714
fix: degree of bosth classes
2022-08-22 14:53:55 +08:00
3a8a3a551d
fix: digraph remove node
2022-08-22 14:46:20 +08:00
29a0ef0fce
fix: copy method forgot it
2022-08-22 13:19:06 +08:00
67631d824d
fix: == for pybind11 is .equal not .is & update: remove MappingProxyType
2022-08-22 12:27:36 +08:00
ba6ef60d6c
Merge branch 'pybind11' of https://github.com/easy-graph/Easy-Graph into hybrid
2022-08-21 21:45:17 +08:00
b6da8c2f12
fix:add weight arg in Path functions
2022-08-21 21:45:07 +08:00
9b8de8a70b
fix: object cannot be cast to bool automatically
2022-08-21 15:07:06 +08:00
b68758379c
feat:add DiGraph base class methods
2022-08-20 13:35:01 +08:00
2e74de828e
pass compilation
2022-08-17 15:03:52 +08:00
e17492c0e5
Merge branch 'hybrid' into pybind11
2022-08-17 14:22:18 +08:00
4fea0f0d03
try to use pybind11
2022-08-16 23:45:39 +08:00
d784be5252
feat:density
2022-08-09 00:33:11 +08:00
4c6b9ecbba
implement number of edges
2022-08-08 21:10:40 +08:00
295df3e289
add py_sum
2022-08-07 16:47:07 +08:00
06da896947
fix: degree of graph implement: degree & size
2022-08-07 16:30:17 +08:00
64c847bfc4
add DiGraph
2022-08-07 15:22:08 +08:00
c115469bf7
refactor C++ files: add __init__.h
2022-08-01 23:18:08 +08:00
f3ce80b7f4
refactor C++ files
2022-08-01 22:14:53 +08:00
Musicaldg