| Package | Description |
|---|---|
| com.mastfrog.graph |
| Modifier and Type | Method and Description |
|---|---|
IntPath |
IntPath.appending(int value)
Create a new path appending the passed value.
|
IntPath |
IntPath.childPath()
Create a new path, lopping off the first element.
|
IntPath |
IntPath.parentPath()
Create a new path, lopping off the last element.
|
IntPath |
IntPath.prepending(int value)
Create a new path prepending the passed value.
|
IntPath |
IntPath.reversed()
Create a new path whose elements are this one's in reverse order.
|
| Modifier and Type | Method and Description |
|---|---|
List<IntPath> |
IntGraph.pathsBetween(int src,
int target)
Get a list of all paths between the source and target node, sorted low to
high by length.
|
Optional<IntPath> |
IntGraph.shortestPathBetween(int src,
int target)
Get the shortest path between two nodes in the graph.
|
Optional<IntPath> |
IntGraph.shortestUndirectedPathBetween(int src,
int target)
Get the shortest undirected path between two nodes.
|
List<IntPath> |
IntGraph.undirectedPathsBetween(int src,
int target)
Get a list of all inbound and outbound paths between two nodes.
|
| Modifier and Type | Method and Description |
|---|---|
int |
IntPath.compareTo(IntPath o) |
boolean |
IntPath.contains(IntPath path)
Determine if this path contains the subsequence in the passed path, or is
equal to it.
|
Copyright © 2010–2020 Mastfrog Technologies. All rights reserved.