Package networkx :: Module hybrid
[hide private]
[frames] | no frames]

Module hybrid

source code

Hybrid


Date: $Date: 2005-03-30 16:56:28 -0700 (Wed, 30 Mar 2005) $

Author: Aric Hagberg (hagberg@lanl.gov) Dan Schult (dschult@colgate.edu)

Functions [hide private]
 
kl_connected_subgraph(G, k, l, low_memory=False, same_as_graph=False)
Returns the maximum locally (k,l) connected subgraph of G.
source code
 
is_kl_connected(G, k, l, low_memory=False)
Returns True if G is kl connected
source code
 
_test_suite() source code
Variables [hide private]
  __credits__ = ''
  __revision__ = '$Revision: 911 $'
Function Details [hide private]

kl_connected_subgraph(G, k, l, low_memory=False, same_as_graph=False)

source code 

Returns the maximum locally (k,l) connected subgraph of G.

(k,l)-connected subgraphs are presented by Fan Chung and Li in "The Small World Phenomenon in hybrid power law graphs" to appear in "Complex Networks" (Ed. E. Ben-Naim) Lecture Notes in Physics, Springer (2004)

low_memory=True then use a slightly slower, but lower memory version same_as_graph=True then return a tuple with subgraph and pflag for if G is kl-connected