Coerce between undirected and directed graphs when possible
An undirected graph G can be converted to a dag if G is chordal. A dag D can be converted to an undirected graph if D can be moralized without adding edges.
ug2dag(gn)
gn |
A graphNEL object or an object that can be converted to a graphNEL object. |
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.