gRain (version 0.3.0)

grash: Create undirected and directed graphs

Description

Functions for creating undirected and directed acyclic graphs from an adjacency list.

Usage

newug(..., short=FALSE)
newdag(..., short=FALSE)

Arguments

...

An incidence list (a list of edges)

short

If TRUE then the edges/vertices are not printed. Can be convenient for large graphs.

Value

• An object of class "ugsh" or "dagsh".

See Also

queryg

Examples

ug <- newug(~me:ve,~me:al,~ve:al,~al:an,~al:st,~an:st)

ug <- newug(~me:ve:al,~al:an:st)

ug <- newug(c("me","ve"),c("me","al"),c("ve","al"),c("al","an"),c("al","st"),c("an","st"))

ug <- newug(~me:ve:al, c("me","ve"),c("me","al"),c("ve","al"),c("al","an"),c("al","st"),c("an","st"))

dag <- newdag(c("me","ve"),c("me","al"),c("ve","al"),c("al","an"),c("al","st"),c("an","st"))
dag <- newdag(~me:ve,~me:al,~ve:al,~al:an,~al:st,~an:st)

dag2 <- newdag(~me:ve:al,~ve:al:an)

edges(ug)
nodes(ug)

edges(dag)
nodes(dag)