sp

package

v0.0.0-...-e7df020 Latest Latest Go to latest Published: Jul 27, 2014 License: MIT Imports: 3 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/akiradeveloper/HeiankyoView-Go

Links

Open Source Insights

Documentation ¶

Overview ¶

Package sp returns the shortest path in the graph. If the graph contains the negative edges, it runs the Bellman-Ford algorithms. Otherwise, it runs Dijkstra algorithm.

Index ¶

func SP(g *gsd.Graph, src, dst string) (string, bool)

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func SP ¶

func SP(g *gsd.Graph, src, dst string) (string, bool)

Types ¶

This section is empty.

Source Files ¶

View all Source files

sp.go

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL