Package | Description |
---|---|
org.clafer.graph |
This package provides data structure and algorithms for directed graphs.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
Vertex.addNeighbour(Vertex<V> neighbour)
Add a new edge starting from this edge to the neighbour.
|
Vertex<V> |
KeyGraph.getVertex(V data)
Returns the vertex associated with the data.
|
Modifier and Type | Method and Description |
---|---|
Set<Vertex<V>> |
Vertex.getNeighbours()
Returns the set of vertexes that have an incoming edge from this vertex.
|
Collection<Vertex<V>> |
KeyGraph.getVertices()
Return the set of vertices contained in the graph.
|
Collection<Vertex<V>> |
Graph.getVertices()
Return the set of vertices contained in the graph.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
Vertex.addNeighbour(Vertex<V> neighbour)
Add a new edge starting from this edge to the neighbour.
|
static <V> boolean |
GraphUtil.hasPath(Vertex<V> start,
Vertex<V> end,
Graph<V> graph) |
static <V> boolean |
GraphUtil.hasPath(Vertex<V> start,
Vertex<V> end,
Graph<V> graph) |
Copyright © 2013. All Rights Reserved.