Discover published sets by community

A graph where edges have no direction and the relationship between vertices is mutual.

A sequence of vertices where each adjacent pair is connected by an edge in the graph.

A collection of lists or arrays, one for each vertex, where each list contains the adjacent vertices.

A connection between two vertices in a graph.

A square matrix used to represent a graph, where the element at row i and column j represents the presence or absence of an edge between vertices i and j.

A path in a graph that starts and ends at the same vertex with no other vertex repeated.

A graph where edges have numeric values called weights assigned to them, often representing cost, length, or capacity.

The number of edges incident to (or leading to/from) the vertex.

A property that determines whether there exists a path between any two vertices in a graph.

A graph where edges have a direction associated with them, from one vertex to another.

A collection of nodes, called vertices, and the relationships between them, called edges.