Simple classic graph algorithms for simple graph classes. Graphs may possess vertex and edge attributes. 'simplegraph' has so dependencies and it is written entirely in R, so it is easy to install.
|Date of publication||2015-12-10 23:15:15|
|Maintainer||Gabor Csardi <firstname.lastname@example.org>|
|License||MIT + file LICENSE|
adjacent_vertices: Adjacent vertices for all vertices in a graph
bfs: Breadth-first search of a graph
data_frame: Create a data frame, more robust than 'data.frame'
degree: Degree of vertices
edges: Edges of a graph
graph: Create a graph
incident_edges: Incident edges
is_loopy: Is this a loopy graph?
is_multigraph: Is this a multigraph?
is_simple: Is this a simple graph?
is_weighted: Is the graph weighted?
order: Order of a graph
predecessors: Predecessors and successors
remove_loops: Remove loop edges from a graph
remove_multiple: Remove multiple edges from a graph
sanitize: Check the validity of a graph data structure
simplegraph: Simple Graph Data Types and Basic Algorithms
simplify: Remove multiple and loop edges from a graph
size: The size of the graph is the number of edges
strength: Vertex strength: sum of weights of incident edges
topological_sort: Topological sorting of a graph
transpose: Transpose a graph
vertex_ids: Vertex ids of a graph
vertices: Vertices of a graph, with metadata