## Uses of Class
edu.claflin.finder.logic.Node

- Packages that use Node
  Package | Description
  --- | ---
  edu.claflin.finder.algo | Contains the Algorithm code for finding bipartite subgraphs.
  edu.claflin.finder.logic | Contains the data structure and processing code-base.
  edu.claflin.finder.logic.cond | Contains Condition implementations for identifying subgraph types.

- - ### Uses of Node in edu.claflin.finder.algo

    Methods in edu.claflin.finder.algo with parameters of type Node
    Modifier and Type | Method and Description
    --- | ---
    `private Graph` | DepthFirstTraversalSearch.`searchNode(Graph graph, Graph subGraph, Node node, java.util.List<Node> visited)` Helper method to search for the SubGraphs.
    `private Graph` | BreadthFirstTraversalSearch.`searchNode(Graph graph, Node node)` Helper method to search for the SubGraphs.

    Method parameters in edu.claflin.finder.algo with type arguments of type Node
    Modifier and Type | Method and Description
    --- | ---
    `private Graph` | DepthFirstTraversalSearch.`searchNode(Graph graph, Graph subGraph, Node node, java.util.List<Node> visited)` Helper method to search for the SubGraphs.

  - ### Uses of Node in edu.claflin.finder.logic

    Fields in edu.claflin.finder.logic declared as Node
    Modifier and Type | Field and Description
    --- | ---
    `private Node` | Edge.`destination` The node representing the destination.
    `private Node` | Edge.`source` The node representing the source.

    Fields in edu.claflin.finder.logic with type parameters of type Node
    Modifier and Type | Field and Description
    --- | ---
    `private java.util.ArrayList<Node>` | Graph.`nodeList` The list of the nodes added to the graph.

    Methods in edu.claflin.finder.logic that return Node
    Modifier and Type | Method and Description
    --- | ---
    `Node` | Node.`duplicate()` Returns a copy of this Node that is a new object in memory.
    `Node` | Edge.`getDestination()` Access method for the Edge's destination.
    `Node` | Edge.`getSource()` Access method for the Edge's source.

    Methods in edu.claflin.finder.logic that return types with arguments of type Node
    Modifier and Type | Method and Description
    --- | ---
    `java.util.List<Node>` | Graph.`getAdjacencyList(Node node)` Obtains an adjacency list for the supplied node based on the Graph.
    `java.util.List<Node>` | Graph.`getNodeList()` Returns the list of nodes in the graph.

    Methods in edu.claflin.finder.logic with parameters of type Node
    Modifier and Type | Method and Description
    --- | ---
    `boolean` | Graph.`addNode(Node node)` Adds a node to the graph.
    `private void` | Graph.`checkNode(Node node)` Verifies that the node is NOT in the graph.
    `Edge` | Edge.`duplicate(Node source, Node destination)` Attempts to duplicate an Edge based on the supplied parameters.
    `java.util.List<Node>` | Graph.`getAdjacencyList(Node node)` Obtains an adjacency list for the supplied node based on the Graph.
    `Edge` | Graph.`getEdge(Node source, Node destination)` Locates an Edge object in the edgeList and returns it.
    `int` | Graph.`getNodeIndex(Node node)` Gets the index of a Node object in memory.
    `void` | Graph.`transpose(Node node1, Node node2)` Transposes the specified nodes.

    Method parameters in edu.claflin.finder.logic with type arguments of type Node
    Modifier and Type | Method and Description
    --- | ---
    `boolean` | Graph.`addNodes(java.util.List<Node> nodes)` Adds a list of nodes to the graph.
    `boolean` | ConditionedGraph.`addPartialGraph(java.util.List<Node> nodes, java.util.List<Edge> edges)` Adds a partial graph to this graph.
    `boolean` | Graph.`addPartialGraph(java.util.List<Node> nodes, java.util.List<Edge> edges)` Adds a partial graph to this graph.
    `Graph` | Graph.`getSubGraph(java.util.List<Node> nodes, java.lang.String nameQualifier)` Returns a subGraph of this graph.
    `private void` | ConditionedGraph.`superAddPartialGraph(java.util.List<Node> nodes, java.util.List<Edge> edges)` Private method for circumventing the condition restrictions.

    Constructors in edu.claflin.finder.logic with parameters of type Node
    Constructor and Description
    `Edge(Node source, Node destination, D data, boolean undirected)` Initializes the Edge object.

    Constructor parameters in edu.claflin.finder.logic with type arguments of type Node
    Constructor and Description
    `Graph(java.lang.String graphName, java.util.ArrayList<Node> nodeList, java.util.ArrayList<Edge> edgeList)` Private constructor used by subGraph method.

  - ### Uses of Node in edu.claflin.finder.logic.cond

    Methods in edu.claflin.finder.logic.cond with parameters of type Node
    Modifier and Type | Method and Description
    --- | ---
    `private boolean` | BipartiteCondition.`satisfies(Graph existingGraph, java.util.Set<Node> addSet, java.util.Set<Node> compareSet, Node current)` Private method for stepping through the adjacency lists and determining if the graph is bipartite.

    Method parameters in edu.claflin.finder.logic.cond with type arguments of type Node
    Modifier and Type | Method and Description
    --- | ---
    `private boolean` | BipartiteCondition.`satisfies(Graph existingGraph, java.util.Set<Node> addSet, java.util.Set<Node> compareSet, Node current)` Private method for stepping through the adjacency lists and determining if the graph is bipartite.
    `private boolean` | BipartiteCondition.`satisfies(Graph existingGraph, java.util.Set<Node> addSet, java.util.Set<Node> compareSet, Node current)` Private method for stepping through the adjacency lists and determining if the graph is bipartite.