Simple Graph Data Types and Basic Algorithms

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_simplegraph | Check if object is a simplegraph |

is_vertices_of | Check if the an object is a sequence of vertices from a graph |

is_weighted | Is the graph weighted? |

merge_named_lists | Merge two names lists |

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 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.