Skip to content

dfs and dijkstra #2

Description

@yanshihao

I think the codes you have written belong to the dfs algorithm but not dijkstra, because the dijkstra algorithm uses the greedy strategy and each time the shortest distance is selected and added to the set.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions