cliques                 package:ggm                 R Documentation

_C_l_i_q_u_e_s _o_f _a_n _u_n_d_i_r_e_c_t_e_d _g_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     Finds the cliques of an undirected graph.

_U_s_a_g_e:

     cliques(amat)

_A_r_g_u_m_e_n_t_s:

    amat: a square Boolean matrix with dimnames, representing the
          adjacency matrix of an undirected graph.

_D_e_t_a_i_l_s:

     The cliques of a graph are the subsets of nodes which induce a
     maximally complete subgraph. Determining the cliques of a graph is
     NP-hard in general.

_V_a_l_u_e:

     a list of vectors of nodes.

_A_u_t_h_o_r(_s):

     Mathias Drton

_R_e_f_e_r_e_n_c_e_s:

     Lauritzen, S. (1996). _Graphical models_. Oxford: Clarendon Press.

_S_e_e _A_l_s_o:

     'UG', 'bd'

_E_x_a_m_p_l_e_s:

     u <- UG(~ a*b*c + c*d*e*g)
     u
     cliques(u)

     graph22 <- UG(~x1*x2*x3+x3*x4*x5*x6+x5*x7*x8*x9*x10+x9*x11*x12*x13*x14+
     x12*x15+x15*x16*x17*x18+x17*x1*x18+x1*x5*x7*x19*x20+x6*x20*x21+x22)

     cliques(graph22)

