# 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.algo.clustering
edu.claflin.finder.algo.clustering.struct.fast_greedy_struct
edu.claflin.finder.algo.clustering.struct.girvan_newman_struct
edu.claflin.finder.algo.clustering.struct.infomap_struct
edu.claflin.finder.algo.clustering.struct.leading_eigenvector_struct
edu.claflin.finder.algo.clustering.struct.louvain_struct
edu.claflin.finder.algo.shortestpath
edu.claflin.finder.algo.spanningtree
edu.claflin.finder.logic
Contains the data structure and processing code-base.

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

  Methods in edu.claflin.finder.algo with parameters of type Node
  Modifier and Type
  Method
  Description
  `private void`
  ConnectedComponentsDFS.`dfs(Node n, List<Node> inodes, List<Node> onodes, List<Boolean> visited)`
  Recursive dfs that stores the nodes of a connected component.
  `private Graph`
  BreadthFirstTraversalSearch.`searchNode(Graph graph, Node node)`
  Helper method to search for the SubGraphs in Breadth First Search.
  `private Graph`
  DepthFirstTraversalSearch.`searchNode(Graph graph, Graph subGraph, Node node, List<Node> visited)`
  Helper method to search for the SubGraphs in Depth First search.
  Method parameters in edu.claflin.finder.algo with type arguments of type Node
  Modifier and Type
  Method
  Description
  `private void`
  BronKerbosch.`addEdgesInParititeSet(Graph graph, List<Node> list)`
  Adds edges to a Graph between all Nodes in a partite set.
  `private void`
  BronKerbosch.`bronKerbosch(List<List<Node>> results, List<Node> clique, List<Node> candidates, List<Node> excluded)`
  Recursive helper method to do the above.
  `private void`
  ConnectedComponentsDFS.`dfs(Node n, List<Node> inodes, List<Node> onodes, List<Boolean> visited)`
  Recursive dfs that stores the nodes of a connected component.
  `private void`
  BronKerbosch.`removeEdgesInPartiteSet(Graph graph, List<Node> list)`
  Removes edges in a Graph between all Nodes in a partite set.
  `private Graph`
  DepthFirstTraversalSearch.`searchNode(Graph graph, Graph subGraph, Node node, List<Node> visited)`
  Helper method to search for the SubGraphs in Depth First search.

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

  Fields in edu.claflin.finder.algo.clustering with type parameters of type Node
  Modifier and Type
  Field
  Description
  `private Map<Integer,List<Node>>`
  Communities.`list`
  Map of Community Number to Nodes of the Community.
  `private HashMap<Integer,HashMap<Node,Double>>`
  Walktrap.`Pv`
  Methods in edu.claflin.finder.algo.clustering that return types with arguments of type Node
  Modifier and Type
  Method
  Description
  `private HashMap<Node,Double>`
  Walktrap.`cprobs(List<Node> C, Graph graph, List<Node> nList)`
  Get a probability vector for a community.
  `private List<Node>`
  LabelPropagation.`generateCommunityFromLabel(int target, int[] labels, Graph graph)`
  Performs FastGreedy community detection on a given Graph, returning the clustering with the maximum modularity.
  `List<Node>`
  LabelPropagation.`generateRandomOrder(List<Node> allNodes)`
  Makes a random order for LPA algorithm.
  `List<Node>`
  Communities.`get(Integer key)`
  Get Community.
  `private Set<Set<Node>>`
  GirvanNewman.`getComponents(List<Node> nList)`
  Extracts the weak components from a graph.
  `List<List<Node>>`
  Communities.`getList()`
  Get Community structure as a List of Node Lists.
  `private HashMap<Node,Double>`
  Walktrap.`merge_probs(int i, int j, Communities cms)`
  Calculate the probability vectors of joining 2 communities.
  Methods in edu.claflin.finder.algo.clustering with parameters of type Node
  Modifier and Type
  Method
  Description
  `private int`
  Walktrap.`getDegree(Node n)`
  Get the Node degree.
  `private double`
  Walktrap.`getWeight(Node n)`
  Get the Node weight.
  `int`
  Communities.`indexOfNode(Node n)`
  Get the index of the Community the given Node is in.
  `int`
  Communities.`NodesInSameCommunity(Node n1, Node n2)`
  Determine if 2 Nodes are in the same Community.
  Method parameters in edu.claflin.finder.algo.clustering with type arguments of type Node
  Modifier and Type
  Method
  Description
  `double`
  Communities.`a(List<Node> c)`
  Fraction of edges incident to Nodes in the given Community.
  `protected ArrayList<Graph>`
  ClusteringAlgorithm.`buildCommunityGraphs(List<List<Node>> cs, Graph graph, String algo_name)`
  `boolean`
  Communities.`connectedCommunities(List<Node> c1, List<Node> c2)`
  Determine whether 2 Communities are connected.
  `private HashMap<Node,Double>`
  Walktrap.`cprobs(List<Node> C, Graph graph, List<Node> nList)`
  Get a probability vector for a community.
  `private double`
  Walktrap.`delta_sigma(int C1index, int C2index, List<Node> nList, Communities cms)`
  Calculate delta sigma from communities C1 and C2 according to Section 4.2 Theorem 5 in the paper.
  `private double`
  Walktrap.`distance(int i, int j, List<Node> nList)`
  Compute the distance between community i and community j.
  `double`
  Communities.`e(List<Node> c1, List<Node> c2)`
  Fraction of edges that join vertices in 2 given Communities.
  `List<Node>`
  LabelPropagation.`generateRandomOrder(List<Node> allNodes)`
  Makes a random order for LPA algorithm.
  `private Set<Set<Node>>`
  GirvanNewman.`getComponents(List<Node> nList)`
  Extracts the weak components from a graph.
  Constructor parameters in edu.claflin.finder.algo.clustering with type arguments of type Node
  Modifier
  Constructor
  Description
  ``
  `Communities(Map<Integer,List<Node>> list, Graph g, boolean weighted)`
  Constructor to create Communities from existing Community group.
  `private`
  `Communities(Map<Integer,List<Node>> list, Graph g, boolean weighted, double m2)`
  Constructor called by copy().

- ## Uses of Node in edu.claflin.finder.algo.clustering.struct.fast_greedy_struct

  Fields in edu.claflin.finder.algo.clustering.struct.fast_greedy_struct with type parameters of type Node
  Modifier and Type
  Field
  Description
  `private List<Node>`
  VectorValue.`community`
  Methods in edu.claflin.finder.algo.clustering.struct.fast_greedy_struct that return types with arguments of type Node
  Modifier and Type
  Method
  Description
  `List<Node>`
  VectorValue.`getCommunity()`
  Constructor parameters in edu.claflin.finder.algo.clustering.struct.fast_greedy_struct with type arguments of type Node
  Modifier
  Constructor
  Description
  ``
  `VectorValue(List<Node> c)`
  ``
  `VectorValue(List<Node> c, double a)`

- ## Uses of Node in edu.claflin.finder.algo.clustering.struct.girvan_newman_struct

  Fields in edu.claflin.finder.algo.clustering.struct.girvan_newman_struct with type parameters of type Node
  Modifier and Type
  Field
  Description
  `protected Map<Node,BetweennessCentrality.BetweennessData>`
  BetweennessCentrality.`vertex_data`
  `protected Map<Node,Double>`
  BetweennessCentrality.`vertex_scores`
  Methods in edu.claflin.finder.algo.clustering.struct.girvan_newman_struct with parameters of type Node
  Modifier and Type
  Method
  Description
  `int`
  BetweennessCentrality.BetweennessComparator.`compare(Node v1, Node v2)`
  `Double`
  BetweennessCentrality.`getVertexScore(Node v)`
  Method parameters in edu.claflin.finder.algo.clustering.struct.girvan_newman_struct with type arguments of type Node
  Modifier and Type
  Method
  Description
  `protected void`
  BetweennessCentrality.`computeBetweenness(Queue<Node> queue)`

- ## Uses of Node in edu.claflin.finder.algo.clustering.struct.infomap_struct

  Subclasses of Node in edu.claflin.finder.algo.clustering.struct.infomap_struct
  Modifier and Type
  Class
  Description
  `class`
  `ModuleNode`
  Fields in edu.claflin.finder.algo.clustering.struct.infomap_struct declared as Node
  Modifier and Type
  Field
  Description
  `private Node`
  InfomapAlgorithm.`node`
  Fields in edu.claflin.finder.algo.clustering.struct.infomap_struct with type parameters of type Node
  Modifier and Type
  Field
  Description
  `(package private) List<List<Node>>`
  InfomapAlgorithm.`communities`
  `private final Set<Node>`
  ModuleNode.`members`
  `private Map<Node,Set<Node>>`
  InfomapImplementation.`moduleMembers`
  `private Map<Node,Set<Node>>`
  InfomapImplementation.`moduleMembers`
  `private Map<Integer,List<Node>>`
  AvgBitLength.`modules`
  `(package private) List<Node>`
  InfomapAlgorithm.`neighbors`
  `(package private) List<Node>`
  InfomapAlgorithm.`nodeList`
  `(package private) List<Node>`
  RelativeUndirectedBitLength.`nodes`
  `private Map<Node,Integer>`
  AvgBitLength.`nodeToModule`
  `private Map<Node,Integer>`
  InfomapImplementation.`nodeToModule`
  `(package private) Map<Node,Integer>`
  RelativeUndirectedBitLength.`nodeToModule`
  `private ArrayList<Node>`
  AvgBitLength.`randomPath`
  Methods in edu.claflin.finder.algo.clustering.struct.infomap_struct that return types with arguments of type Node
  Modifier and Type
  Method
  Description
  `Map<Integer,List<Node>>`
  InfomapImplementation.`cluster()`
  `private static Map<Node,Integer>`
  RelativeUndirectedBitLength.`generateNodeToModule(Map<Integer,List<Node>> modules)`
  `Map<Integer,List<Node>>`
  InfomapImplementation.`getCommunities()`
  `Set<Node>`
  ModuleNode.`getMembers()`
  `private static ArrayList<Node>`
  AvgBitLength.`randomWalker(Graph g)`
  Generates a path taken by random walker.
  `private static ArrayList<Node>`
  AvgBitLength.`testRandomWalker(Graph g)`
  Methods in edu.claflin.finder.algo.clustering.struct.infomap_struct with parameters of type Node
  Modifier and Type
  Method
  Description
  `void`
  ModuleNode.`addMember(Node node)`
  `private int`
  InfomapImplementation.`getNodeModule(Node node)`
  `private double`
  InfomapImplementation.`modularityGain(Node node, int currentModule, int targetModule)`
  `private void`
  InfomapImplementation.`moveNode(Node node, int targetModule)`
  `void`
  ModuleNode.`removeMember(Node node)`
  Method parameters in edu.claflin.finder.algo.clustering.struct.infomap_struct with type arguments of type Node
  Modifier and Type
  Method
  Description
  `double`
  InfomapAlgorithm.`AvgBitLength(ArrayList<Node> nodePath)`
  `double`
  RelativeUndirectedBitLength.`calculateNewModule(Map<Node,Integer> ntm)`
  `static RelativeUndirectedBitLength`
  RelativeUndirectedBitLength.`fromNodeToModule(Graph graph, Map<Node,Integer> nodeToModule)`
  `private static Map<Node,Integer>`
  RelativeUndirectedBitLength.`generateNodeToModule(Map<Integer,List<Node>> modules)`
  `void`
  InfomapAlgorithm.`HuffmanEncoder(List<Node> nodeList, PrioritySet<HuffmanNode> ps)`
  `double`
  MapEquation.`longSigmaNotation(ArrayList<Double> q, int m, List<List<Node>> communities, ArrayList<ArrayList<Double>> pProb)`
  `double`
  MapEquation.`LongSigmaWiyAndWi(int m, ArrayList<Double> wy, List<List<Node>> communities, ArrayList<ArrayList<Double>> wi)`
  `private void`
  InfomapImplementation.`optimize(Graph g, Map<Node,Integer> nodeToModule)`
  `void`
  AvgBitLength.`setModules(Map<Integer,List<Node>> modules)`
  `void`
  RelativeUndirectedBitLength.`setNodeToModule(Map<Node,Integer> nodeToModule)`
  `private double`
  AvgBitLength.`totalModuleCode(Map<Integer,List<Node>> modules, Map<Integer,Integer> moduleFrequency)`
  `private double`
  AvgBitLength.`totalModuleNodeFreq(List<Node> moduleNodes)`
  `private double`
  AvgBitLength.`totalNodeFreq(List<Node> nodes)`
  Constructors in edu.claflin.finder.algo.clustering.struct.infomap_struct with parameters of type Node
  Modifier
  Constructor
  Description
  ``
  `ModuleNode(Node node)`
  Constructor parameters in edu.claflin.finder.algo.clustering.struct.infomap_struct with type arguments of type Node
  Modifier
  Constructor
  Description
  ``
  `AvgBitLength(Graph graph, Map<Integer,List<Node>> modules)`
  ``
  `RelativeUndirectedBitLength(Graph graph, Map<Node,Integer> nodeToModule)`

- ## Uses of Node in edu.claflin.finder.algo.clustering.struct.leading_eigenvector_struct

  Fields in edu.claflin.finder.algo.clustering.struct.leading_eigenvector_struct with type parameters of type Node
  Modifier and Type
  Field
  Description
  `private HashMap<Integer,List<Node>>`
  LeadingEigenvectorAlgorithm.`communities`
  `private HashMap<Integer,List<Node>>`
  LeadingEigenvectorCaller.`communities`
  Methods in edu.claflin.finder.algo.clustering.struct.leading_eigenvector_struct that return types with arguments of type Node
  Modifier and Type
  Method
  Description
  `HashMap<Integer,List<Node>>`
  LeadingEigenvectorAlgorithm.`getCommunities()`
  `HashMap<Integer,List<Node>>`
  LeadingEigenvectorCaller.`getCommunities()`
  Method parameters in edu.claflin.finder.algo.clustering.struct.leading_eigenvector_struct with type arguments of type Node
  Modifier and Type
  Method
  Description
  `static String`
  Tester.`communitiesToString(HashMap<Integer,List<Node>> communities)`

- ## Uses of Node in edu.claflin.finder.algo.clustering.struct.louvain_struct

  Fields in edu.claflin.finder.algo.clustering.struct.louvain_struct with type parameters of type Node
  Modifier and Type
  Field
  Description
  `private HashMap<Integer,List<Node>>`
  LouvainAlgorithm.`communities`
  Methods in edu.claflin.finder.algo.clustering.struct.louvain_struct that return types with arguments of type Node
  Modifier and Type
  Method
  Description
  `HashMap<Integer,List<Node>>`
  LouvainAlgorithm.`getCommunities()`
  Method parameters in edu.claflin.finder.algo.clustering.struct.louvain_struct with type arguments of type Node
  Modifier and Type
  Method
  Description
  `static String`
  Tester.`communitiesToString(HashMap<Integer,List<Node>> communities, Graph graph)`

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

  Methods in edu.claflin.finder.algo.shortestpath that return Node
  Modifier and Type
  Method
  Description
  `private Node`
  DijkstraShortestPath.`closestReachableUnvisited(HashMap<Node,Double> shortestPathMap, Graph graph, Set<String> visited)`
  Methods in edu.claflin.finder.algo.shortestpath with parameters of type Node
  Modifier and Type
  Method
  Description
  `private Graph`
  ShortestPath.`removePaths(Graph graph, Node from, Node to)`
  Private class for removing visited paths that not reach the destination node.
  Method parameters in edu.claflin.finder.algo.shortestpath with type arguments of type Node
  Modifier and Type
  Method
  Description
  `private Node`
  DijkstraShortestPath.`closestReachableUnvisited(HashMap<Node,Double> shortestPathMap, Graph graph, Set<String> visited)`

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

  Method parameters in edu.claflin.finder.algo.spanningtree with type arguments of type Node
  Modifier and Type
  Method
  Description
  `private void`
  Prim.`startSearch(PrioritySet<Prim.DistanceRecord> ps, List<Node> treeList, List<Node> remainingNodes, Graph graph)`

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

  Fields in edu.claflin.finder.logic declared as Node
  Modifier and Type
  Field
  Description
  `private Node`
  Edge.`source`
  The node representing the source.
  `private Node`
  Edge.`target`
  The node representing the target.
  Fields in edu.claflin.finder.logic with type parameters of type Node
  Modifier and Type
  Field
  Description
  `private List<Node>`
  Node.`neighbors`
  `private final 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
  Description
  `Node`
  Node.`duplicate()`
  Returns a copy of this Node that is a new object in memory.
  `Node`
  Graph.`getNode(String NodeName)`
  Gets a node based on its name.
  `Node`
  Edge.`getOther(Node n)`
  `Node`
  Edge.`getSource()`
  Access method for the Edge's source.
  `Node`
  Edge.`getTarget()`
  Access method for the Edge's target.
  Methods in edu.claflin.finder.logic that return types with arguments of type Node
  Modifier and Type
  Method
  Description
  `List<Node>`
  Graph.`getAdjacencyList(Node node)`
  Obtains an adjacency list for the supplied node based on the Graph.
  `List<Node>`
  Edge.`getEndpoints()`
  `List<Node>`
  Node.`getNeighbors()`
  Get the Node's neighbors
  `List<Node>`
  Graph.`getNodeList()`
  Returns the list of nodes in the graph.
  `ArrayList<ArrayList<Node>>`
  Graph.`getPartiteSets()`
  Divides the given graph into two bipartite sets.
  Methods in edu.claflin.finder.logic with parameters of type Node
  Modifier and Type
  Method
  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.
  `int`
  Node.`compareTo(Node that)`
  `boolean`
  Graph.`containsNode(Node node)`
  Checks if the graph contains the given node.
  `Edge`
  Edge.`duplicate(Node source, Node destination)`
  Attempts to duplicate an Edge based on the supplied parameters.
  `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.
  `Edge`
  Node.`getEdge(Node t)`
  `List<Edge>`
  Graph.`getNodeEdges(Node n)`
  Get the list of Edges in which the given Node participates.
  `int`
  Graph.`getNodeIndex(Node node)`
  Gets the index of a Node object in memory.
  `Node`
  Edge.`getOther(Node n)`
  `boolean`
  Edge.`includes(Node n)`
  Determines whether the given Node is involved in the Edge.
  `private boolean`
  Graph.`isBipartite(Node current, Set<Node> addSet, Set<Node> compareSet)`
  Private method for stepping through the adjacency lists and determining if the graph is bipartite.
  `private void`
  Graph.`removeEdgesInvolving(Node n)`
  Remove all the edges in which the given Node participates.
  `void`
  Graph.`removeNode(Node node)`
  Removes a node from the set.
  `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
  Description
  `boolean`
  Graph.`addNodes(List<Node> nodes)`
  Adds a list of nodes to the graph.
  `boolean`
  ConditionedGraph.`addPartialGraph(List<Node> nodes, List<Edge> edges)`
  Adds a partial graph to this graph.
  `boolean`
  Graph.`addPartialGraph(List<Node> nodes, List<Edge> edges)`
  Adds a partial graph to this graph.
  `List<Edge>`
  Graph.`getEdgesBack(List<Node> nodes)`
  Gets the list edges of this Graph that involve the nodes in the given list
  `Graph`
  Graph.`getSubGraph(List<Node> nodes, String nameQualifier)`
  Returns a subGraph of this graph.
  `private boolean`
  Graph.`isBipartite(Node current, Set<Node> addSet, Set<Node> compareSet)`
  Private method for stepping through the adjacency lists and determining if the graph is bipartite.
  `private void`
  ConditionedGraph.`superAddPartialGraph(List<Node> nodes, List<Edge> edges)`
  Private method for circumventing the condition restrictions.
  Constructors in edu.claflin.finder.logic with parameters of type Node
  Modifier
  Constructor
  Description
  ``
  `Edge(Node source, Node target, double data, boolean undirected)`
  Initializes the Edge object.
  Constructor parameters in edu.claflin.finder.logic with type arguments of type Node
  Modifier
  Constructor
  Description
  ``
  `Graph(String graphName, List<Node> nodeList, List<Edge> edgeList)`
  Private constructor used by subGraph method.