Skip to content

Commit

Permalink
Fix readme table formatting
Browse files Browse the repository at this point in the history
  • Loading branch information
j6k4m8 authored Feb 26, 2021
1 parent 3e7affa commit 9062ea3
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -65,8 +65,8 @@ For very large graphs, you may use a good chunk of RAM not only on the queue of
| `directed` | `bool` | `None` | Whether to enforce a directed/undirected search. True means enforce directivity; False means enforce undirected search. The default (None) will guess based upon your motif and host. |
| `profile` | `bool` | `False` | Whether to slow down execution but give you a better idea of where your RAM usage is going. This is better ignored unless you're debugging something particularly nuanced. |
| `isomorphisms_only` | `bool` | `False` | Whether to search only for isomorphisms. In other words, whether to search for edges that exist in the node-induced subgraph. |
| `hints` | `List[Dict[Hashable, Hashable]]` | A list of valid candidate mappings to use as the starting seeds for new maps. See _Using Hints_, below. |
| `limit` | `int` | An optional integer limit of results to return. If the limit is reached, the search will return early. |
| `hints` | `List[Dict[Hashable, Hashable]]` | `None` | A list of valid candidate mappings to use as the starting seeds for new maps. See _Using Hints_, below. |
| `limit` | `int` | `None` | An optional integer limit of results to return. If the limit is reached, the search will return early. |

## Using Hints

Expand Down

0 comments on commit 9062ea3

Please sign in to comment.