Shortest Path Algorithm Visualization

as.spgraph | Coerce to a shortest path graph |

aStarSearch | A*-Search Algorithm |

bellmanFord | Bellman-Ford Algorithm |

dijkstra | Dijkstra Algorithm |

euclidean.vertex.distance | euclidean.vertex.distance |

floydWarshall | Floyd-Warshall Algorithm |

getShortestPaths | Get the shortest path between two vertices. |

get.vertex | get.vertex |

graphModification | Graph Modification |

has.vertex.coordinates | has.vertex.coordinates |

is.edge.intersection | is.edge.intersection |

is.spgraph | Check whether an object is a shortest path graph |

is.spresults | Check whether an object is a shortest path result object |

nice_vertex_label_colors | Produce a vector of suitable vector colors depending on the... |

nice_vertex_labels | Produce "name (current min dist)" labels for all vertices. |

plot.spgraph | Plotting of shortest path graphs |

print.spgraph | Print graphs to the terminal |

print.spresults | Print spresults to the terminal |

randomGraph | Random Graph Generation |

removeIntersectingEdges | Remove edge intersections |

sample_average_k_connected_graph | Create a random regular graph |

shortestpath | The shortestpath package |

spresults | Convert a list of graphs into an spresults object. |

summary.spgraph | summary.spgraph |

toLatexGraph | Export spgraphs as human-readable TikZ graphs. |

toLatexTable | toLatexTable |

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.