Man pages for rje42/MixedGraphs
Mixed Graphs and Graphical Models
| addEdges | Add or remove edges |
| addNodes | Add additional nodes to a graph |
| adj | Find adjacent vertices |
| adjList | Get adjacency list of edges |
| adjMatrix | Get adjacency matrix from list of edges |
| anSets | Find ancestral sets of a graph. |
| as_adjacency | Put edges in correct format |
| barren | Find barren, sterile, orphaned vertices |
| barrenSets | Get barren subsets |
| BK | Bron-Kerbosch Algorithm |
| check_edge_type | Check if edge object could be in given format |
| chgEnds | Modify edge marks |
| claudius | Find Claudius of a (bidirected-connected) set |
| collapse | Collapse multiple edge types to a single list or matrix |
| complete_mg | Construct complete graph |
| convert | Convert graph to format associated with specific package |
| determinePackage | Determine which graph package evaluation will occur in. |
| districts | Familial Mixed Graph Groups |
| dual | Dual Graphs |
| edgeList | Deprecated function |
| edgeMatrix | Get edges from adjacency matrix or list |
| edgeTypes | See list of vertex and edge types |
| eList | Edge list |
| family | Familial Mixed Graph Relations |
| gr1 | Example Graphs |
| grapes-G-grapes | Automatically convert and apply graph function |
| graph_algorithms | Algorithms for common graphical combinatorial problems |
| graphCr | Create graph from character parsing |
| graph_equal | Test graphs are equal |
| graphOps | Graph Operations |
| grp | Group vertices by adjacencies |
| is_complete | Check if a subgraph is complete |
| is_cyclic | Test cyclicity of graph |
| is.cyclic-deprecated | Deprecated function to test cyclicity of graph |
| is.mixedgraph | Test for 'mixedgraph' |
| list_isomorphisms | Obtain isomorphisms from one graph to another |
| makeEdgeList | Make an edgeList from a collection of edges |
| makeGraphComplete | Graph Constructor Functions |
| match_vnames | Function to match variables using their names |
| mb | Find Markov blanket |
| mixedgraph | Construct a mixed graph |
| moralize | Moralize a mixed graph |
| morphEdges | Transform edges to different type |
| m_sep | Test m-separation |
| mutilate | Delete edges |
| pathConnected | Find vertices in subset connected to vertex |
| print.mixedgraph | Print a mixedgraph object |
| remove_duplicate_edges | Remove duplicate edges |
| skeleton | Graph skeleton |
| standardizeEdges | Write graphs in standard format |
| standardizeVertices | Force graphs to have vertices 1,...,k |
| subGraph | Subgraphs for 'mixedgraph' objects |
| test_graph | Test type of graph |
| test_graph-deprecated | Deprecated functions to test type of graph |
| topologicalOrder | Find topological ordering of vertices |
| to_subgraph | Map a graph onto an induced subgraph |
| withAdjMatrix | Change representation of edges |
