Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Update Graph class and add basic search algorithms #35

Merged
merged 15 commits into from
May 11, 2024
Merged

Update Graph class and add basic search algorithms #35

Changes from 1 commit
Commits
Show all changes
15 commits
Select commit Hold shift + click to select a range
fb21cd3
Add support for saving/loading graphs
eholum May 9, 2024
9f36ee1
Graph nodes are now very self referential
eholum May 10, 2024
70269e5
Add DFS
eholum May 10, 2024
186db1a
Fix logic around neighbors and make it a dictionary
eholum May 10, 2024
e843e4b
Fix typo
eholum May 10, 2024
09dfb99
Add basic astar
eholum May 10, 2024
e73acd2
We don't need hashing or equality for edges
eholum May 10, 2024
cd636ef
Add comments and cleanup graph class
eholum May 11, 2024
11514ed
Update docs modules
eholum May 11, 2024
fd8fa50
Cleanup graph search
eholum May 11, 2024
2d62d5a
Modify graph search tests
eholum May 11, 2024
bda09bd
Move retrace_path out to a util function
eholum May 11, 2024
89ca34b
Merge branch 'main' into add-graph-algorithms
eholum May 11, 2024
f060803
Update test/planning/test_graph_search.py
eholum May 11, 2024
b103fae
Set default heuristic
eholum May 11, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Fix typo
  • Loading branch information
@eholum
eholum committed May 10, 2024
commit e843e4bdf4d9808dbd4f3e6360423aebac659272
2 changes: 1 addition & 1 deletion test/planning/test_graph.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -162,7 +162,7 @@ def test_str_and_parse():
assert edgeAB == Edge.parse(eAB)


def atest_save_and_load():
def test_save_and_load():
nodeA = Node([1.0, 1.0], cost=1.0)
nodeB = Node([1.0, 2.0], cost=1.0)
edgeAB = Edge(nodeA, nodeB, 1.0)
Expand Down