-
Notifications
You must be signed in to change notification settings - Fork 264
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.
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
Implemented the Moran process on graphs #799
Merged
Merged
Changes from 1 commit
Commits
Show all changes
7 commits
Select commit
Hold shift + click to select a range
8b9459a
Add Moran process on graphs
marcharper 96c73e0
Docs for Moran Process on Graphs
marcharper af69177
Death-birth Moran process variant
marcharper 88989f7
Update Moran doctests
marcharper 0985230
Graph and Moran tests
marcharper d4bb462
Fix seed for py3.5 and py3.6 compatibility.
drvinceknight 496fe41
Cite reference in text for moran docs.
drvinceknight File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,97 @@ | ||
import unittest | ||
|
||
from axelrod import graph | ||
|
||
|
||
class TestGraph(unittest.TestCase): | ||
|
||
def test_cycle(self): | ||
g = graph.cycle(1, directed=False) | ||
self.assertEqual(g.vertices(), [0]) | ||
self.assertEqual(g.edges(), [(0, 0)]) | ||
self.assertEqual(g.directed, False) | ||
g = graph.cycle(1, directed=True) | ||
self.assertEqual(g.vertices(), [0]) | ||
self.assertEqual(g.edges(), [(0, 0)]) | ||
self.assertEqual(g.directed, True) | ||
g = graph.cycle(2, directed=True) | ||
self.assertEqual(g.vertices(), [0, 1]) | ||
self.assertEqual(g.edges(), [(0, 1), (1, 0)]) | ||
g = graph.cycle(2, directed=False) | ||
self.assertEqual(g.vertices(), [0, 1]) | ||
self.assertEqual(g.edges(), [(0, 1), (1, 0)]) | ||
g = graph.cycle(3, directed=True) | ||
self.assertEqual(g.vertices(), [0, 1, 2]) | ||
self.assertEqual(g.edges(), [(0, 1), (1, 2), (2, 0)]) | ||
g = graph.cycle(3, directed=False) | ||
edges = [(0, 1), (1, 0), (1, 2), (2, 1), (2, 0), (0, 2)] | ||
self.assertEqual(g.vertices(), [0, 1, 2]) | ||
self.assertEqual(g.edges(), edges) | ||
g = graph.cycle(4, directed=True) | ||
self.assertEqual(g.vertices(), [0, 1, 2, 3]) | ||
self.assertEqual(g.edges(), [(0, 1), (1, 2), (2, 3), (3, 0)]) | ||
self.assertEqual(g.out_vertices(0), [1]) | ||
self.assertEqual(g.out_vertices(1), [2]) | ||
self.assertEqual(g.out_vertices(2), [3]) | ||
self.assertEqual(g.out_vertices(3), [0]) | ||
self.assertEqual(g.in_vertices(0), [3]) | ||
self.assertEqual(g.in_vertices(1), [0]) | ||
self.assertEqual(g.in_vertices(2), [1]) | ||
self.assertEqual(g.in_vertices(3), [2]) | ||
g = graph.cycle(4, directed=False) | ||
edges = [(0, 1), (1, 0), (1, 2), (2, 1), | ||
(2, 3), (3, 2), (3, 0), (0, 3)] | ||
self.assertEqual(g.vertices(), [0, 1, 2, 3]) | ||
self.assertEqual(g.edges(), edges) | ||
for vertex, neighbors in [ | ||
(0, (1, 3)), (1, (0, 2)), (2, (1, 3)), (3, (0, 2))]: | ||
self.assertEqual(set(g.out_vertices(vertex)), set(neighbors)) | ||
for vertex, neighbors in [ | ||
(0, (1, 3)), (1, (0, 2)), (2, (1, 3)), (3, (0, 2))]: | ||
self.assertEqual(set(g.in_vertices(vertex)), set(neighbors)) | ||
|
||
def test_complete(self): | ||
g = graph.complete_graph(2, loops=False) | ||
self.assertEqual(g.vertices(), [0, 1]) | ||
self.assertEqual(g.edges(), [(0, 1), (1, 0)]) | ||
self.assertEqual(g.directed, False) | ||
g = graph.complete_graph(3, loops=False) | ||
self.assertEqual(g.vertices(), [0, 1, 2]) | ||
edges = [(0, 1), (1, 0), (0, 2), (2, 0), (1, 2), (2, 1)] | ||
self.assertEqual(g.edges(), edges) | ||
self.assertEqual(g.directed, False) | ||
g = graph.complete_graph(4, loops=False ) | ||
self.assertEqual(g.vertices(), [0, 1, 2, 3]) | ||
edges = [(0, 1), (1, 0), (0, 2), (2, 0), (0, 3), (3, 0), | ||
(1, 2), (2, 1), (1, 3), (3, 1), (2, 3), (3, 2)] | ||
self.assertEqual(g.edges(), edges) | ||
self.assertEqual(g.directed, False) | ||
for vertex, neighbors in [ | ||
(0, (1, 2, 3)), (1, (0, 2, 3)), (2, (0, 1, 3)), (3, (0, 1, 2))]: | ||
self.assertEqual(set(g.out_vertices(vertex)), set(neighbors)) | ||
for vertex, neighbors in [ | ||
(0, (1, 2, 3)), (1, (0, 2, 3)), (2, (0, 1, 3)), (3, (0, 1, 2))]: | ||
self.assertEqual(set(g.in_vertices(vertex)), set(neighbors)) | ||
|
||
def test_complete_with_loops(self): | ||
g = graph.complete_graph(2, loops=True) | ||
self.assertEqual(g.vertices(), [0, 1]) | ||
self.assertEqual(g.edges(), [(0, 0), (0, 1), (1, 0), (1, 1)]) | ||
self.assertEqual(g.directed, False) | ||
g = graph.complete_graph(3, loops=True) | ||
self.assertEqual(g.vertices(), [0, 1, 2]) | ||
edges = [(0, 0), (0, 1), (1, 0), (0, 2), (2, 0), (1, 1), | ||
(1, 2), (2, 1), (2, 2)] | ||
self.assertEqual(g.edges(), edges) | ||
self.assertEqual(g.directed, False) | ||
g = graph.complete_graph(4, loops=True) | ||
self.assertEqual(g.vertices(), [0, 1, 2, 3]) | ||
edges = [(0, 0), (0, 1), (1, 0), (0, 2), (2, 0), (0, 3), (3, 0), | ||
(1, 1), (1, 2), (2, 1), (1, 3), (3, 1), | ||
(2, 2), (2, 3), (3, 2), (3, 3)] | ||
self.assertEqual(g.edges(), edges) | ||
self.assertEqual(g.directed, False) | ||
neighbors = range(4) | ||
for vertex in range(4): | ||
self.assertEqual(set(g.out_vertices(vertex)), set(neighbors)) | ||
self.assertEqual(set(g.in_vertices(vertex)), set(neighbors)) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for this: could you cite it in the moran.rst file?