chordalGraph(G)
chordalGraph(G,ordering)
This method finds a simple chordal completion of a given graph G. A chordal completion is a supergraph of G that is chordal. If a vertex ordering is given, it completes the graph using this ordering; otherwise it finds one using a minimum degree ordering heuristic.
|
|
|
|
If the input is a digraph, it must be topologically ordered; no check is made.
The object chordalGraph is a method function.