Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
load_digraph_test.cc File Reference

Tests for Load Digraph. More...

#include <gtest/gtest.h>
#include <sstream>
#include <string>
#include "load_digraph.H"
Include dependency graph for load_digraph_test.cc:

Go to the source code of this file.

Classes

struct  FlagReset
 

Functions

 TEST (LoadDigraph, LoadsNodesAndArcsAndSkipsShortRows)
 
 TEST (LoadDigraph, CreatesMissingNodesWhenParsingArcs)
 
 TEST (LoadDigraph, EmptyInputsProduceEmptyGraph)
 
 TEST (LoadDigraph, LinesWithExtraSeparatorsAreIgnored)
 
 TEST (GenerateDotFile, ProducesWarningWhenCycleExists)
 
 TEST (GenerateDotFile, EmitsTopologicalRanksWhenAcyclic)
 
 TEST (GenerateDotFile, RespectsOnlyNumFlagWhenTrue)
 
 TEST (Split, BasicSplitWithSingleSeparator)
 
 TEST (Split, SplitWithMultipleSeparators)
 
 TEST (Split, EmptyString)
 
 TEST (Split, OnlySeparators)
 
 TEST (Split, NoSeparatorsFound)
 
 TEST (Split, LeadingAndTrailingSeparators)
 
 TEST (EqualNode, ComparesById)
 
 TEST (LoadDigraph, ArcsWithCommaSeparator)
 
 TEST (LoadDigraph, DuplicateNodeIdsInArcs)
 
 TEST (LoadDigraph, MultipleArcsWithSameEndpoints)
 
 TEST (GenerateDotFile, AllColorsAndShapes)
 
 TEST (GenerateDotFile, SingleNodeGraph)
 
 TEST (GenerateDotFile, DisconnectedComponents)
 
 TEST (SearchNode, FindsExistingNode)
 
 TEST (SearchNode, CreatesNewNodeIfNotFound)
 
 TEST (MinNodeFields, HasCorrectValue)
 
 TEST (LoadDigraph, LargeGraph)
 

Detailed Description

Tests for Load Digraph.

Definition in file load_digraph_test.cc.

Function Documentation

◆ TEST() [1/24]

TEST ( EqualNode  ,
ComparesById   
)

◆ TEST() [2/24]

◆ TEST() [3/24]

TEST ( GenerateDotFile  ,
DisconnectedComponents   
)

◆ TEST() [4/24]

TEST ( GenerateDotFile  ,
EmitsTopologicalRanksWhenAcyclic   
)

◆ TEST() [5/24]

◆ TEST() [6/24]

◆ TEST() [7/24]

TEST ( GenerateDotFile  ,
SingleNodeGraph   
)

◆ TEST() [8/24]

TEST ( LoadDigraph  ,
ArcsWithCommaSeparator   
)

◆ TEST() [9/24]

TEST ( LoadDigraph  ,
CreatesMissingNodesWhenParsingArcs   
)

◆ TEST() [10/24]

TEST ( LoadDigraph  ,
DuplicateNodeIdsInArcs   
)

◆ TEST() [11/24]

TEST ( LoadDigraph  ,
EmptyInputsProduceEmptyGraph   
)

◆ TEST() [12/24]

TEST ( LoadDigraph  ,
LargeGraph   
)

◆ TEST() [13/24]

TEST ( LoadDigraph  ,
LinesWithExtraSeparatorsAreIgnored   
)

◆ TEST() [14/24]

TEST ( LoadDigraph  ,
LoadsNodesAndArcsAndSkipsShortRows   
)

◆ TEST() [15/24]

TEST ( LoadDigraph  ,
MultipleArcsWithSameEndpoints   
)

◆ TEST() [16/24]

TEST ( MinNodeFields  ,
HasCorrectValue   
)

◆ TEST() [17/24]

TEST ( SearchNode  ,
CreatesNewNodeIfNotFound   
)

◆ TEST() [18/24]

TEST ( SearchNode  ,
FindsExistingNode   
)

◆ TEST() [19/24]

TEST ( Split  ,
BasicSplitWithSingleSeparator   
)

◆ TEST() [20/24]

TEST ( Split  ,
EmptyString   
)

◆ TEST() [21/24]

TEST ( Split  ,
LeadingAndTrailingSeparators   
)

◆ TEST() [22/24]

TEST ( Split  ,
NoSeparatorsFound   
)

◆ TEST() [23/24]

TEST ( Split  ,
OnlySeparators   
)

◆ TEST() [24/24]

TEST ( Split  ,
SplitWithMultipleSeparators   
)