|
BellmanFordWizard< BellmanFordWizardBase< GR, LEN > > | bellmanFord (const GR &digraph, const LEN &length) |
|
BfsWizard< BfsWizardBase< GR > > | bfs (const GR &digraph) |
|
Color | distantColor (const Color &c) |
|
Color | distantBW (const Color &c) |
|
void | function_requires () |
|
void | checkConcept () |
|
bool | connected (const Graph &graph) |
|
int | countConnectedComponents (const Graph &graph) |
|
int | connectedComponents (const Graph &graph, NodeMap &compMap) |
|
bool | stronglyConnected (const Digraph &digraph) |
|
int | countStronglyConnectedComponents (const Digraph &digraph) |
|
int | stronglyConnectedComponents (const Digraph &digraph, NodeMap &compMap) |
|
int | stronglyConnectedCutArcs (const Digraph &digraph, ArcMap &cutMap) |
|
int | countBiNodeConnectedComponents (const Graph &graph) |
|
bool | biNodeConnected (const Graph &graph) |
|
int | biNodeConnectedComponents (const Graph &graph, EdgeMap &compMap) |
|
int | biNodeConnectedCutNodes (const Graph &graph, NodeMap &cutMap) |
|
int | countBiEdgeConnectedComponents (const Graph &graph) |
|
bool | biEdgeConnected (const Graph &graph) |
|
int | biEdgeConnectedComponents (const Graph &graph, NodeMap &compMap) |
|
int | biEdgeConnectedCutEdges (const Graph &graph, EdgeMap &cutMap) |
|
bool | dag (const Digraph &digraph) |
|
void | topologicalSort (const Digraph &digraph, NodeMap &order) |
|
bool | checkedTopologicalSort (const Digraph &digraph, NodeMap &order) |
|
bool | acyclic (const Graph &graph) |
|
bool | tree (const Graph &graph) |
|
bool | bipartite (const Graph &graph) |
|
bool | bipartitePartitions (const Graph &graph, NodeMap &partMap) |
|
bool | loopFree (const Graph &graph) |
|
bool | parallelFree (const Graph &graph) |
|
bool | simpleGraph (const Graph &graph) |
|
int | countItems (const Graph &g) |
|
int | countNodes (const Graph &g) |
|
int | countRedNodes (const Graph &g) |
|
int | countBlueNodes (const Graph &g) |
|
int | countArcs (const Graph &g) |
|
int | countEdges (const Graph &g) |
|
int | countOutArcs (const Graph &g, const typename Graph::Node &n) |
|
int | countInArcs (const Graph &g, const typename Graph::Node &n) |
|
int | countIncEdges (const Graph &g, const typename Graph::Node &n) |
|
bool | undirected (const GR &g) |
|
DigraphCopy< From, To > | digraphCopy (const From &from, To &to) |
|
GraphCopy< From, To > | graphCopy (const From &from, To &to) |
|
BpGraphCopy< From, To > | bpGraphCopy (const From &from, To &to) |
|
Graph::Arc | findArc (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Arc prev=INVALID) |
|
Graph::Edge | findEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Edge p=INVALID) |
|
DfsWizard< DfsWizardBase< GR > > | dfs (const GR &digraph) |
|
DijkstraWizard< DijkstraWizardBase< GR, LEN > > | dijkstra (const GR &digraph, const LEN &length) |
|
DimacsDescriptor | dimacsType (std::istream &is) |
|
void | readDimacsMin (std::istream &is, Digraph &g, LowerMap &lower, CapacityMap &capacity, CostMap &cost, SupplyMap &supply, typename CapacityMap::Value infty=0, DimacsDescriptor desc=DimacsDescriptor()) |
|
void | readDimacsMax (std::istream &is, Digraph &g, CapacityMap &capacity, typename Digraph::Node &s, typename Digraph::Node &t, typename CapacityMap::Value infty=0, DimacsDescriptor desc=DimacsDescriptor()) |
|
void | readDimacsSp (std::istream &is, Digraph &g, LengthMap &length, typename Digraph::Node &s, DimacsDescriptor desc=DimacsDescriptor()) |
|
void | readDimacsCap (std::istream &is, Digraph &g, CapacityMap &capacity, typename CapacityMap::Value infty=0, DimacsDescriptor desc=DimacsDescriptor()) |
|
void | readDimacsMat (std::istream &is, Graph &g, DimacsDescriptor desc=DimacsDescriptor()) |
|
void | writeDimacsMat (std::ostream &os, const Digraph &g, std::string comment="") |
|
bool | eulerian (const GR &g) |
|
GraphToEps< DefaultGraphToEpsTraits< GR > > | graphToEps (GR &g, std::ostream &os=std::cout) |
|
GraphToEps< DefaultGraphToEpsTraits< GR > > | graphToEps (GR &g, const char *file_name) |
|
GraphToEps< DefaultGraphToEpsTraits< GR > > | graphToEps (GR &g, const std::string &file_name) |
|
Value | kruskal (const Graph &g, const In &in, Out &out) |
|
void | mapCopy (const GR &gr, const From &from, To &to) |
|
bool | mapCompare (const GR &gr, const Map1 &map1, const Map2 &map2) |
|
Map::Key | mapMin (const GR &gr, const Map &map) |
|
Map::Key | mapMin (const GR &gr, const Map &map, const Comp &comp) |
|
Map::Key | mapMax (const GR &gr, const Map &map) |
|
Map::Key | mapMax (const GR &gr, const Map &map, const Comp &comp) |
|
Map::Value | mapMinValue (const GR &gr, const Map &map) |
|
Map::Value | mapMinValue (const GR &gr, const Map &map, const Comp &comp) |
|
Map::Value | mapMaxValue (const GR &gr, const Map &map) |
|
Map::Value | mapMaxValue (const GR &gr, const Map &map, const Comp &comp) |
|
Map::Key | mapFind (const GR &gr, const Map &map, const typename Map::Value &val) |
|
Map::Key | mapFindIf (const GR &gr, const Map &map, const Pred &pred) |
|
int | mapCount (const GR &gr, const Map &map, const typename Map::Value &val) |
|
int | mapCountIf (const GR &gr, const Map &map, const Pred &pred) |
|
void | mapFill (const GR &gr, Map &map, const typename Map::Value &val) |
|
bool | isNaN (double v) |
|
double | round (double r) |
|
CostMap::Value | minCostArborescence (const Digraph &digraph, const CostMap &cost, typename Digraph::Node source, ArborescenceMap &arborescence) |
|
std::istream & | readNautyGraph (Graph &graph, std::istream &is=std::cin) |
|
void | pathCopy (const From &from, To &to) |
|
void | copyPath (To &to, const From &from) |
|
bool | checkPath (const Digraph &digraph, const Path &path) |
|
Digraph::Node | pathSource (const Digraph &digraph, const Path &path) |
|
Digraph::Node | pathTarget (const Digraph &digraph, const Path &path) |
|
bool | checkPlanarity (const GR &graph) |
|
void | radixSort (Iterator first, Iterator last, Functor functor) |
|
void | stableRadixSort (Iterator first, Iterator last, Functor functor) |
|
TimeStamp | runningTimeTest (F f, double min_time=10, unsigned int *num=NULL, TimeStamp *full_time=NULL) |
|
int | triangle_count_given_edge (const Graph &G, const Graph::Arc &e, const ArcLookUp< Graph > &look_up) |
|
int64_t | triangle_count (const Graph &G, int total_edge) |
|
int | triangle_count_given_node (const Graph &G, const Graph::Node &n, const ArcLookUp< Graph > &look_up, const std::vector< int > °ree_list, std::vector< int > *extra_node_list) |
|
int64_t | triangle_count_vertex_iteration (const Graph &G, const std::vector< int > °ree_list, int max_degree) |
|
int | collect_degree_info (const Graph &G, std::vector< int > *degree_list, int node_size) |
| compute the degree for each node and save them to degree_list
|
|
int64_t | get_edge (std::ifstream &fin) |
|
std::pair< int, int > | read_binfile_to_arclist (const char *file_name, std::vector< std::pair< int, int >> *arcs) |
| read the binary graph file and initialize the arcs data structure
|
|
void | construct_graph_from_arclist (Graph *G, const std::vector< std::pair< int, int > > &arcs, int node_size) |
| construct the static graph from given arc list
|
|