StatGraphs : Index

• Bigraph -- a graph with bidirected edges and no multiple edges
• bigraph -- create a bigraph
• bigraph(...,EntryMode=>...) -- optional input, accepts 'auto', 'edges', or 'neighbors'
• bigraph(...,Singletons=>...) -- optional input, accepts the list of isolated vertices in a bigraph
• bigraph(HashTable) -- create a bigraph
• bigraph(List) -- create a bigraph
• bigraph(List,List) -- create a bigraph
• bigraph(List,Matrix) -- create a bigraph
• bigraph(Matrix) -- create a bigraph
• bigraph(MixedGraph) -- extract the bigraph component of a mixed graph
• children(MixedGraph,Thing) -- return the children of a vertex of a mixed graph
• collateVertices -- convert a mixed graph into a new mixed graph where each component subgraph has the same set of vertices
• collateVertices(MixedGraph) -- convert a mixed graph into a new mixed graph where each component subgraph has the same set of vertices
• descendants(MixedGraph,Thing) -- return the descendants of a vertex of a mixed graph
• digraph(MixedGraph) -- extract the digraph component of a mixed graph
• forefathers(MixedGraph,Thing) -- return the forefathers of a vertex of a mixed graph
• graph(MixedGraph) -- convert mixed graph to a hash table
• indexLabelGraph(MixedGraph) -- relabel the vertices of a mixed graph according to their indices, indexed from 0
• isCyclic(MixedGraph) -- check whether a mixed graph contains a directed cycle
• isLoopless -- check whether a graph contains a loop
• isLoopless(Bigraph) -- check whether a graph contains a loop
• isLoopless(Digraph) -- check whether a graph contains a loop
• isLoopless(Graph) -- check whether a graph contains a loop
• isLoopless(MixedGraph) -- check whether a graph contains a loop
• isSimple(MixedGraph) -- check whether a mixed graph is simple
• MixedGraph -- a graph that has undirected, directed and bidirected edges
• mixedGraph -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Bigraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Bigraph,Digraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Bigraph,Digraph,Graph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Bigraph,Graph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Bigraph,Graph,Digraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Digraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Digraph,Bigraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Digraph,Bigraph,Graph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Digraph,Graph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Digraph,Graph,Bigraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Graph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Graph,Bigraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Graph,Bigraph,Digraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Graph,Digraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• mixedGraph(Graph,Digraph,Bigraph) -- create a mixed graph from a combination of undirected graph, digraph and bigraph
• neighbors(MixedGraph,Thing) -- return the neighbors of a vertex of a mixed graph
• net(MixedGraph) -- print a mixed graph as a net
• nondescendants(MixedGraph,Thing) -- return the nondescendents of a vertex of a mixed graph
• nonneighbors(MixedGraph,Thing) -- return the neighbors of a vertex of a mixed graph
• parents(MixedGraph,Thing) -- return the parents of a vertex of a mixed graph
• partitionLMG -- partition the vertices of a loopless mixed graph into adjacent to undirected edges and adjacent to bidirected edges
• partitionLMG(MixedGraph) -- partition the vertices of a loopless mixed graph into adjacent to undirected edges and adjacent to bidirected edges
• StatGraphs -- a package for graphs used in statistical models
• toString(MixedGraph) -- print a mixed graph as a string
• undirectedGraph -- extract the undirected graph component of a mixed graph
• undirectedGraph(MixedGraph) -- extract the undirected graph component of a mixed graph
• vertexSet(MixedGraph) -- create a union of all vertices of a mixed graph
• vertices(MixedGraph) -- create a union of all vertices of a mixed graph