[Kratos] Nelson: some idea

pooyan en cimne.upc.edu pooyan en cimne.upc.edu
Jue Jun 20 12:40:40 CEST 2013


  

Hi Nelson, 

This problem is called in graph bridge finding
algorithm. Here you can find the standard algorithm for it:


http://en.wikipedia.org/wiki/Bridge_(graph_theory) [1] 

Bests,


Pooyan. 

On Thu, 20 Jun 2013 18:12:24 +0800, Nelson Lafontaine wrote:


> Hi friends
> 
> In this case i need an implementation idea related
we geometry. Consider a two volume domain discretized in tetrahedra
element. both domains is connected with only one node or one side on the
tettahedra (a line). How can i identify this nodes?? there a numerical
tricks to do do it??? The main objective of this is to force the 3D
discrete fracture.
> 
> Any ida is welcome. Thanks in advance.
> 
>
Nelson 
> 
> -- 
> Ing. Nelson M. Lafontaine

  

Links:
------
[1]
http://en.wikipedia.org/wiki/Bridge_(graph_theory)
------------ próxima parte ------------
Se ha borrado un adjunto en formato HTML...
URL: http://listas.cimne.upc.edu/pipermail/kratos/attachments/20130620/0fc22370/attachment.htm 


Más información sobre la lista de distribución Kratos