Categorygithub.com/gyuho/learndocgo_graph_shortest_pathcode
package
0.0.0-20240816162523-c1683cc9cfe6
Repository: https://github.com/gyuho/learn.git
Documentation: pkg.go.dev
Overview
Versions
1
Dependencies
10
Dependents
0
Files
1.1k SLOC

# Functions

BellmanFord returns the shortest path using Bellman-Ford algorithm This algorithm works with negative weight edges.
Dijkstra returns the shortest path using Dijkstra algorithm with a min-priority queue.
No description provided by the author
No description provided by the author
NewGraph returns a new graph.
NewGraph returns a new graph.
NewGraphFromJSON returns a new Graph from a JSON file.
NewGraphFromJSON returns a new Graph from a JSON file.
No description provided by the author
No description provided by the author

# Interfaces

Edge connects between two Nodes.
Edge connects between two Nodes.
Graph describes the methods of graph operations.
Graph describes the methods of graph operations.
ID is unique identifier.
ID is unique identifier.
Node is vertex.
Node is vertex.

# Type aliases

No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author