Man pages for kelvinyangli/wrsgraph
| calculate_cycle_length | Calculate the shortest cycle length |
| combn_ind | Auxilliary function to wrs_bktr() |
| common_nbrs | A function that finds the common neighbours between two nodes |
| deficiency | A function to calculates the deficiency of a node |
| degree | A function to calculates the degree of a node |
| d_wrs | Definite-WRS for maximum degree 3 graphs |
| d_wrs_deg4 | Definite-WRS for maximum degree 4 graphs |
| edit_dist_graph | The edit distance from the learned to the true undirected... |
| find_nbr | A function that finds neighbours of a node |
| find_simplicial | Find simplicial nodes |
| fixed_ordering_moralization | Fixed ordering moralization |
| is_chordal | Test chordality |
| is_clique | Identify a clique |
| is_simplicial | Identify a simplicial node |
| k3_ladder | A function that look for a k3 ladder. |
| matching_special_envelop_graph | special subgraph matching |
| mblist2moral | Convert a list of MBs to an undirected graph The list of MBs... |
| min_deficiency_moralization | A function to moralize a graph according to the minimum... |
| min_deg_moralization | Minimum degree moralization |
| min_deg_triangulation | Minimum degree triangulation |
| moralization | Graph moralization |
| progress | A function to keep track of the progress in a loop |
| prune_leaves | A function that prunes leaves |
| rand_bounded_deg_graph | Random graph generation |
| rand_bounded_deg_graph_aux | Random graph generation (auxiliary) |
| remove_duplicated_edges | A function to remove duplicated rows in a dataframe or matrix |
| subgraph | Subgraph |
| wrs_bktr | Test weak recursively simplicial |
