search

lanl / dfnWorks

dfnWorks is a parallelized computational suite to generate three-dimensional discrete fracture networks (DFN) and simulate flow and transport. If you download the software please fill out our interest form to stay up to date on releases https://goo.gl/forms/VE39oKsyp4LVC6Gj2 and join our google group https://groups.google.com/d/forum/dfnworks-users . Precompiled Docker Container https://hub.docker.com/r/ees16/dfnworks
https://dfnworks.lanl.gov/
Other
73 stars 42 forks source link

dfnGraph (v2.8) fails to identify the backbones with bipartite approach considering weight (length and hydraulic resistence) #85

Open yingtaohu opened 1 month ago

yingtaohu commented 1 month ago

Hello all,

When i run the example "pruning" to generate bipartite graphs, there is an error: image So i change the code in "pruning.py": "path_nodes = sorted(list(k_shortest))--------> path_nodes =list(k_shortest)" Then the running is OK.

However, if i try to use "greedy_edge_disjoint" method to identifying the backbones of DFN, here is another issue: image So i change the code in "pruning.py" again: "if G.graph['representation'] != "intersection":--------> if G.graph['representation'] != "bipartite":" Then the running is OK. Is it right?

These results are good for me. However,how can i identify the backbones with bipartite graph-based approach considering weight (length and hydraulic resistence) ? Is there any open source codes ? I cann't find it. So i cann't repeat the results in: Hyman et al. 2018 "Identifying Backbones in Three-Dimensional Discrete Fracture Networks: A Bipartite Graph-Based Approach" SIAM Multiscale Modeling and Simulation.

Thanks in advance!

hymanjd commented 1 month ago

Hi, the greedy disjoint path algorithm requires that you use the intersection graph, not the bipartite.

All source code is in the pydfnworks/dfnGraph subdirectory

yingtaohu commented 1 month ago

Thanks, Jeffrey.