g4n: graph for networks
Version 0.3-2

Creation and manipulation of graphs associated to networks. The first aim of this package is to support the /rebastaba/ package to which it was formerly included. It is mainly of interest for quite small graphs.

Browse man pages Browse package API and functions Browse package files

AuthorJean-Baptiste Denis <Jean-Baptiste.Denis@jouy.inra.fr>, Marie-Laure Delignette-Muller <ml.delignette@vet-lyon.fr> and Regis Pouillot <rpouillot@yahoo.fr>
Date of publicationNone
MaintainerJean-Baptiste Denis <Jean-Baptiste.Denis@jouy.inra.fr>
LicenseGPL (>= 2)
Version0.3-2
Package repositoryView on R-Forge
InstallationInstall the latest version of this package by entering the following in R:
install.packages("g4n", repos="http://R-Forge.R-project.org")

Man pages

and4gn: adds a series of nodes to a gn object
arc2pam: constructs the object pam from the object arc
arc4gn: adds or remove some arc(s) to or from a gn object
cycle8pam: detects if a cycle exists from a pam matrix
cycles4gn: reduces the graph to the portion with cycles
ends8gn: returns the root and leaf nodes/variables of a gn
explore8pam: finds different characteristics of relations between nodes
g4n2.arc-class: Class "arc" ~~~
g4n2.gn-class: Class for graphs associated to Bayesian networks
g4n2.pam-class: Class "pam" to define parentship matrices
g4n2.pgr-class: Class "pgr" to format the plot of /gn/ (mainly DAG associated...
g4n2.pos-class: Class "pos" to define the projection into $R^2$ of objects...
g4n3k: assigns the constants for the g4n layer
geneal4pam: constructs the genealoty of a given node
gn2item: returns the item names of a /gn/ object
gn2list: transforms a /gn/ object into a list
gn2path: returns all paths between two nodes
list2gn: transforms a consistent list into a new /gn/ object
minbar8gn: finds the minimum number of arcs between nodes of a gn object
mindis8pam: finds the minimum distance between every pair of nodes
modify4gn: interactive modifications of a gn
neighbours8gn: returns the direct parents (or children) of a gn nodes
new8arc: creates an /arc/ with a specified number of nodes and arcs
pam2arc: from the parentship object pam returns the arcs object
pam2gn: from a pam object generates a gn object
pam2path: returns all paths between two nodes
parcours8gn: find the ascendances until blocking
path4gn: reduces the graph to the portion in between two node sets
plot3D8gn: plots an object gn according to its 3 dimensions
plot8cgn: draws nodes and arcs of a gn with already computed xy values
plot8gn: plots an object gn
pos2pos: returns the equivalent pos object with standard view
position4gn: proposes positions for the nodes of a gn object
print8arc: prints an /arc/
print8gn: prints an object gn
print8pam: prints a /pam/
print8pgr: prints the node-variable names
print8pos: prints a /pos/
range8pos: returns the ranges (x,y) for a pos
read8gn: produced a /gn/ from a text file
relation4gn: formats the arc of a gn from a relation matrix
rgn: creates a pseudo-random gn object
rmar4gn: removes a series of arcs from a gn object
rmnd4gn: removes a series of nodes from a gn object
valid8arc: checks a /arc/
valid8gn: checks a /gn/
valid8pam: checks a /pam/
valid8pgr: checks a /pgr/
valid8pos: checks a /pos/
write8gn: writes a /gn/ to file

Functions

First.lib Source code
and4gn Man page Source code
arc-class Man page
arc2pam Man page Source code
arc4gn Man page Source code
cycle8pam Man page Source code
cycles4gn Man page Source code
ends8gn Man page Source code
explore8pam Man page Source code
g4n3k Man page Source code
geneal4pam Man page Source code
gn-class Man page
gn2item Man page Source code
gn2list Man page Source code
gn2path Man page Source code
list2gn Man page Source code
minbar8gn Man page Source code
mindis8pam Man page Source code
modify4gn Man page Source code
neighbours8gn Man page Source code
new8arc Man page Source code
pam-class Man page
pam2arc Man page Source code
pam2gn Man page Source code
pam2path Man page Source code
parcours8gn Man page Source code
path4gn Man page Source code
pgr-class Man page
plot,gn-method Man page
plot3D8gn Man page Source code
plot8cgn Man page Source code
plot8gn Man page Source code
pos-class Man page
pos2pos Man page Source code
position4gn Man page Source code
print,arc-method Man page
print,gn-method Man page
print,pam-method Man page
print,pgr-method Man page
print,pos-method Man page
print8arc Man page Source code
print8gn Man page Source code
print8pam Man page Source code
print8pgr Man page Source code
print8pos Man page Source code
range8pos Man page Source code
read8gn Man page Source code
relation4gn Man page Source code
rgn Man page Source code
rmar4gn Man page Source code
rmnd4gn Man page Source code
valid8arc Man page Source code
valid8gn Man page Source code
valid8pam Man page Source code
valid8pgr Man page Source code
valid8pos Man page Source code
write8gn Man page Source code

Files

NAMESPACE
R
R/zzz.R
R/f0.g4n1.code.r
R/f1.g4n2.code.r
tests
tests/g4n1.demo.misc.R
tests/g4n1.demo.gn.simple.txt
tests/g4n1.demo.creating.R
inst
inst/original
inst/original/g4n1.code.r
inst/original/g4n2.code.r
inst/files
inst/files/g4n1.demo.gn.simple.txt
DESCRIPTION
man
man/geneal4pam.Rd
man/write8gn.Rd
man/gn2list.Rd
man/rgn.Rd
man/pos2pos.Rd
man/new8arc.Rd
man/rmar4gn.Rd
man/cycles4gn.Rd
man/modify4gn.Rd
man/valid8pos.Rd
man/gn2path.Rd
man/cycle8pam.Rd
man/g4n3k.Rd
man/valid8arc.Rd
man/plot3D8gn.Rd
man/g4n2.pam-class.Rd
man/ends8gn.Rd
man/plot8cgn.Rd
man/explore8pam.Rd
man/position4gn.Rd
man/valid8pgr.Rd
man/g4n2.pos-class.Rd
man/arc4gn.Rd
man/relation4gn.Rd
man/arc2pam.Rd
man/gn2item.Rd
man/mindis8pam.Rd
man/valid8gn.Rd
man/parcours8gn.Rd
man/print8pam.Rd
man/pam2path.Rd
man/pam2gn.Rd
man/print8pos.Rd
man/and4gn.Rd
man/path4gn.Rd
man/list2gn.Rd
man/print8gn.Rd
man/minbar8gn.Rd
man/print8pgr.Rd
man/range8pos.Rd
man/plot8gn.Rd
man/valid8pam.Rd
man/g4n2.pgr-class.Rd
man/g4n2.arc-class.Rd
man/pam2arc.Rd
man/neighbours8gn.Rd
man/print8arc.Rd
man/read8gn.Rd
man/g4n2.gn-class.Rd
man/rmnd4gn.Rd
demo
demo/g4n1.demo.misc.R
demo/00Index
demo/g4n1.demo.creating.R
g4n documentation built on May 21, 2017, 1:40 a.m.