Man pages for huoston/shortestpath
Shortest Path Algorithm Visualization

as.spgraphCoerce to a shortest path graph
aStarSearchA*-Search Algorithm
bellmanFordBellman-Ford Algorithm
dijkstraDijkstra Algorithm
euclidean.vertex.distanceeuclidean.vertex.distance
floydWarshallFloyd-Warshall Algorithm
getShortestPathsGet the shortest path between two vertices.
get.vertexget.vertex
graphModificationGraph Modification
has.vertex.coordinateshas.vertex.coordinates
is.edge.intersectionis.edge.intersection
is.spgraphCheck whether an object is a shortest path graph
is.spresultsCheck whether an object is a shortest path result object
nice_vertex_label_colorsProduce a vector of suitable vector colors depending on the...
nice_vertex_labelsProduce "name (current min dist)" labels for all vertices.
plot.spgraphPlotting of shortest path graphs
print.spgraphPrint graphs to the terminal
print.spresultsPrint spresults to the terminal
randomGraphRandom Graph Generation
removeIntersectingEdgesRemove edge intersections
sample_average_k_connected_graphCreate a random regular graph
shortestpathThe shortestpath package
spresultsConvert a list of graphs into an spresults object.
summary.spgraphsummary.spgraph
toLatexGraphExport spgraphs as human-readable TikZ graphs.
toLatexTabletoLatexTable
huoston/shortestpath documentation built on June 7, 2018, 12:25 a.m.