Here are the classes, structs, unions and interfaces with brief descriptions:
| mmn_arc | Representation of topological arc joining two vertices |
| mmn_csp_solver | Given (sparse?) graph eliminate invalid arcs and nodes until a kernel of arc-consistent nodes and arcs remains |
| mmn_dependancy | Store information about which node a given node depends on |
| mmn_diffusion_solver | Run diffusion algorithm to solve max sum problem |
| mmn_dp_solver | Solve restricted class of Markov problems (trees and tri-trees) |
| mmn_graph_rep1 | Representation of a graph, stored by links at each node |
| mmn_lbp_solver | Run loopy belief to estimate overall marginal probabilities of all node states |
| mmn_solver | Base for classes which solve Markov Random Field problems |
| mmn_triplet | Representation of three vertex indices, eg a triangle |
