Graphs/ADT - Revision history

Admin at 06:52, 10 October 2017

2017-10-10T06:52:50Z

← Older revision		Revision as of 06:52, 10 October 2017
Line 1:		Line 1:
			Graphs abstract data types.

	See also: [[Graphs/Java/ADT]]		See also: [[Graphs/Java/ADT]]

Admin: /* Graph ADT */

2017-08-21T02:09:32Z

Graph ADT

← Older revision		Revision as of 02:09, 21 August 2017
Line 19:		Line 19:

	==Graph ADT==		==Graph ADT==

			Members:
			* Nearly every implementation of a graph maintains two lists: a list of vertices and a list of edges

	Size/count methods:		Size/count methods:
Line 40:		Line 43:
	* removeVertex(v) - remove vertex v and any connecting edges from the graph		* removeVertex(v) - remove vertex v and any connecting edges from the graph
	* removeEdge(e) - remove edge e from the graph		* removeEdge(e) - remove edge e from the graph


	=Code=		=Code=

Admin at 21:56, 20 August 2017

2017-08-20T21:56:57Z

← Older revision		Revision as of 21:56, 20 August 2017
Line 1:		Line 1:
			See also: [[Graphs/Java/ADT]]

	=Notes=		=Notes=

Admin: /* Flags */

2017-08-20T21:56:34Z

Flags

← Older revision		Revision as of 21:56, 20 August 2017
Line 39:		Line 39:
	* removeEdge(e) - remove edge e from the graph		* removeEdge(e) - remove edge e from the graph


			=Code=

			See http://git.charlesreid1.com/cs/java repository, graphs folder.

	=Flags=		=Flags=

Admin at 02:23, 19 August 2017

2017-08-19T02:23:36Z

← Older revision		Revision as of 02:23, 19 August 2017
Line 38:		Line 38:
	* removeVertex(v) - remove vertex v and any connecting edges from the graph		* removeVertex(v) - remove vertex v and any connecting edges from the graph
	* removeEdge(e) - remove edge e from the graph		* removeEdge(e) - remove edge e from the graph


			=Flags=

			{{GraphsFlag}}

			[[Category:ADT]]
			[[Category:Data Structures]]

Admin: Created page with "=Notes= Graphs are composed of three basic object types: * Vertex/Node * Edge * Graph The vertex stores information specific to the vertex - typically a data element, plus a..."

2017-08-19T01:55:27Z

Created page with "=Notes= Graphs are composed of three basic object types: * Vertex/Node * Edge * Graph The vertex stores information specific to the vertex - typically a data element, plus a..."

New page

=Notes=

Graphs are composed of three basic object types:
* Vertex/Node
* Edge
* Graph

The vertex stores information specific to the vertex - typically a data element, plus additional info required by the data structure used (see [[Graphs/Data Structures]]).

==Vertex ADT==

* element() - get the data element associated with this node

==Edge ADT==

* element() - get the data element associated with this edge

==Graph ADT==

Size/count methods:
* numVertices() - returns number of vertices on graph
* numEdges() - returns number of edges on graph

Sets methods:
* vertices() - return set of vertices V
* edges() - return set of edges E

Get methods:
* getEdge(u,v) - given two vertices, return the edge that connects them (if any)
* endVertices(e) - get a pair of vertices at the endpoints of the given edge
* opposite(v,e) - for a given vertex and edge, get the vertex at the other end of the edge
* outgoingEdges(v) - return a set of outgoing edges from vertex v
* incomingEdges(v) - return a set of incoming edges to vertex v

Modification methods:
* insertVertex(x) - insert a new Vertex object storing data element x
* insertEdge(u,v,y) - insert a new Edge object storing data element y that connects vertices u and v
* removeVertex(v) - remove vertex v and any connecting edges from the graph
* removeEdge(e) - remove edge e from the graph