Create simple_paths_generator_with_score.rs

[ranjana-mishra]

It uses Dijkstra Algo to generate all possible paths , by deleting one edge at a time, and gives the paths with their score. Related to https://github.com/Qiskit/rustworkx/issues/671

[CLAassistant]

All committers have signed the CLA.

[ranjana-mishra]

@mtreinish can you review the PR and suggest how we move forward.

[coveralls]

Pull Request Test Coverage Report for Build 11030598879

Warning: This coverage report may be inaccurate.

This pull request's base commit is no longer the HEAD commit of its target branch. This means it includes changes from outside the original pull request, including, potentially, unrelated coverage changes.

• For more information on this, see Tracking coverage changes with pull request builds.
• To avoid this issue with future PRs, see these Recommended CI Configurations.
• For a quick fix, rebase this PR at GitHub. Your next report should be accurate.

Details

• 0 of 0 changed or added relevant lines in 0 files are covered.
• No unchanged relevant lines lost coverage.
• Overall coverage remained the same at 95.816%

---

Totals
Change from base Build 10928052046:	0.0%
Covered Lines:	17999
Relevant Lines:	18785

---

💛 - Coveralls

[ranjana-mishra]

Please review the PR -

• it is fix over k-shortest paths ( same cost paths ), as that is not considering already visited points and fails on test cases.
• Provide function to get n paths in increasing cost order.

[ranjana-mishra]

New PR for this https://github.com/Qiskit/rustworkx/pull/1363