Closed Sasasu closed 3 years ago
add Edge::operator== to compare two edge
change Graph(Graph&) to Graph(const Graph&)
add Graph::getAdjavencyList() to give more convenient to use.
add Graph::getAdjacencyMatrix() to give more convenient to use.
compile error fix, change set<T,W> getVertices() to set<T,less<W>> getVertices()
set<T,W> getVertices()
set<T,less<W>> getVertices()
fix bug, whe graph contain negative margin, dijkstra may be infinite loop
fix bug, whe vertices.size is zero, bellmanFord may be infinite loop.
@Sasasu PR looks good for now!
add Edge::operator== to compare two edge
change Graph(Graph&) to Graph(const Graph&)
add Graph::getAdjavencyList() to give more convenient to use.
add Graph::getAdjacencyMatrix() to give more convenient to use.
compile error fix, change
set<T,W> getVertices()
toset<T,less<W>> getVertices()
fix bug, whe graph contain negative margin, dijkstra may be infinite loop
fix bug, whe vertices.size is zero, bellmanFord may be infinite loop.
5