Package org.graph4j.util

Class Path

java.lang.Object

org.graph4j.util.VertexCollection

org.graph4j.util.VertexList

org.graph4j.util.Walk

org.graph4j.util.Trail

org.graph4j.util.Path

All Implemented Interfaces:

Iterable<Integer>

Direct Known Subclasses:

Cycle

public class Path
extends Trail

A path is a trail with no duplicate vertices. Vertices can not repeat. Edges can not repeat. The length of a walk is its number of edges.

Author:

Cristian Frăsinaru

See Also:

• Walk
• Trail
• Circuit
• Cycle

Field Summary

Fields inherited from class org.graph4j.util.Walk

numEdges

Fields inherited from class org.graph4j.util.VertexCollection

bitset, DEFAULT_CAPACITY, first, graph, numVertices, vertices

Constructor Summary

Constructors

Constructor	Description
Path(Graph graph)
Path(Graph graph, int initialCapacity)
Path(Graph graph, int[] vertices)

Method Summary

Modifier and Type	Method	Description
int	firstVertex()
boolean	isHamiltonian()	A Hamiltonian path contains all vertices in the graph.
boolean	isInduced()	Checks if the path is induced (there is no chord).
boolean	isValid()
int	lastVertex()

Methods inherited from class org.graph4j.util.Trail

checkDuplicateEdges

Methods inherited from class org.graph4j.util.Walk

add, checkEdge, checkEdges, computeEdgesWeight, equals, hashCode, isClosed, isDirected, length, reverse, toString, type

Methods inherited from class org.graph4j.util.VertexList

addAll, get, indexOf, indexOf, insert, remove, removeFromPos, set, union, union

Methods inherited from class org.graph4j.util.VertexCollection

clear, computeVerticesWeight, contains, getGraph, grow, isClique, isEmpty, isStableSet, iterator, numVertices, removeAll, removeLast, retainAll, size, union, vertexToString, vertices

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Details

Path

public Path(Graph graph)

Path

public Path(Graph graph,
 int initialCapacity)

Path

public Path(Graph graph,
 int[] vertices)

Method Details

firstVertex

public int firstVertex()

lastVertex

public int lastVertex()

isValid

public boolean isValid()

Overrides:

isValid in class Trail

Returns:

false if the vertices do not represent the intendended structure.

isInduced

public boolean isInduced()

Checks if the path is induced (there is no chord).

Returns:

true if the path is induced, false otherwise.

isHamiltonian

public boolean isHamiltonian()

A Hamiltonian path contains all vertices in the graph.

Returns:

true if the path is Hamiltonian.