Man pages for robertness/lucy
Really useful things done with graphs.
| checkAttributes | Check if updated attribute is present |
| checkIndex | Enforce integer indexing |
| checkVertex | Type checking for igraph vertex arguments. |
| detect_cycle | Find a cycle Returns the first cycle detected in the graph.... |
| edge_updater | Edge propagation instance Executes a callback on the edge... |
| first_v | Select vertices from a sequence |
| fit_barabasi_power | Use input graph to estimate power of preferential attachment... |
| get_connecting_nodes | Find All Vertices or Edges on Paths Connecting Two Vertices |
| get_downstream_nodes | Find all Vertices Upstream or Downstream of a Given Vertex in... |
| get_edge_vertex | Pull the Vertex from a Given Edge in Graph Returns the index... |
| get_roots | Find all the leaves and root vertices in a directed graph. A... |
| igraphviz | igraph plotting with Graphviz library |
| in_degree | In/Out-degree of a set of vertices in a directed graph |
| iparents | Parents/Children/Markov Blanket of a Vertex |
| isBDownstreamOfA | Test if a Vertex is Downstream or Upstream of Another |
| layer_DAGs | Generate graph comprised of sequentially layered randomly... |
| mlp_graph | Generate a Multilayer Perceptron Graph |
| name_vertices | Quick Naming of the Vertices/Edges in a Graph |
| plot_path | Plot path from an upstream vertex to a downstream vertex. |
| power_law_sim | Simulate a scale-free network given an input network. |
| reverse_edge | Reverse an edge in a directed graph |
| reverse_edges | Reverse the edges of a directed graph |
| rw_restarts | Random Walk with Restarts |
| setIterator | Create an igraph Iterator Substitution Function |
| sim_DAG | Generate Multi-connected DAG |
| update_vertices | Vertex/Edge Propagation in igraph Foundation for any graph... |
| vertex_updater | Edge propagation instance Executes a callback on the edge... |
