var searchIndex = {};
searchIndex["graph_neighbor_matching"] = {"doc":"","items":[[3,"Edge","graph_neighbor_matching","",null,null],[3,"Graph","","",null,null],[3,"IgnoreNodeColors","","",null,null],[3,"GraphSimilarityMatrix","","",null,null],[8,"NodeColorMatching","","",null,null],[10,"node_color_matching","","Determines how close or distant two nodes `node_i` of graph A,\nand `node_j` of graph B are. If they have different colors,\nthis method could return 0.0 to describe that they are completely\ndifferent nodes and as such the neighbor matching will try to choose\na different node.\nNOTE: The returned value MUST be in the range [0, 1].",0,null],[11,"fmt","","",1,null],[11,"new","","",1,{"inputs":[{"name":"usize"},{"name":"closed01"}],"output":{"name":"edge"}}],[11,"fmt","","",2,null],[11,"clone","","",2,null],[11,"new","","",2,null],[11,"fmt","","",3,null],[11,"node_color_matching","","",3,null],[11,"fmt","","",4,null],[11,"new","","",4,{"inputs":[{"name":"graph"},{"name":"graph"},{"name":"f"}],"output":{"name":"graphsimilaritymatrix"}}],[11,"next","","Calculates the next iteration of the similarity matrix (x[k+1]).",4,null],[11,"iterate","","Iteratively calculate the similarity matrix.",4,null],[11,"matrix","","",4,null],[11,"num_iterations","","",4,null],[11,"min_nodes","","",4,null],[11,"max_nodes","","",4,null],[11,"optimal_node_assignment","","",4,null],[11,"score_outgoing_edge_weights","","Calculate a measure how good the edge weights match up.",4,null],[11,"score_sum_norm_min_degree","","Sums the optimal assignment of the node similarities and normalizes (divides)\nby the min degree of both graphs.\nUsed as default in the paper.",4,null],[11,"score_sum_norm_max_degree","","Sums the optimal assignment of the node similarities and normalizes (divides)\nby the min degree of both graphs.\nPenalizes the difference in size of graphs.",4,null],[11,"score_average","","Calculates the average over the whole node similarity matrix. This is faster,\nas no assignment has to be found. "Graphs with greater number of automorphisms\nwould be considered to be more self-similar than graphs without automorphisms."",4,null]],"paths":[[8,"NodeColorMatching"],[3,"Edge"],[3,"Graph"],[3,"IgnoreNodeColors"],[3,"GraphSimilarityMatrix"]]};
initSearch(searchIndex);